/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 11:40:53,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 11:40:53,144 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 11:40:53,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 11:40:53,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 11:40:53,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 11:40:53,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 11:40:53,159 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 11:40:53,160 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 11:40:53,161 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 11:40:53,162 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 11:40:53,163 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 11:40:53,163 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 11:40:53,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 11:40:53,165 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 11:40:53,166 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 11:40:53,167 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 11:40:53,168 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 11:40:53,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 11:40:53,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 11:40:53,172 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 11:40:53,173 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 11:40:53,174 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 11:40:53,175 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 11:40:53,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 11:40:53,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 11:40:53,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 11:40:53,178 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 11:40:53,179 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 11:40:53,180 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 11:40:53,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 11:40:53,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 11:40:53,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 11:40:53,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 11:40:53,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 11:40:53,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 11:40:53,183 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 11:40:53,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 11:40:53,184 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 11:40:53,185 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 11:40:53,185 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 11:40:53,186 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 11:40:53,200 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 11:40:53,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 11:40:53,201 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 11:40:53,202 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 11:40:53,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 11:40:53,202 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:40:53,202 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 11:40:53,202 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 11:40:53,202 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 11:40:53,203 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 11:40:53,203 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 11:40:53,203 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 11:40:53,203 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 11:40:53,203 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 11:40:53,204 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 11:40:53,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 11:40:53,204 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 11:40:53,204 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 11:40:53,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 11:40:53,204 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 11:40:53,205 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 11:40:53,205 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 11:40:53,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 11:40:53,205 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 11:40:53,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:40:53,206 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 11:40:53,206 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 11:40:53,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 11:40:53,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 11:40:53,370 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 11:40:53,383 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 11:40:53,386 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 11:40:53,388 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 11:40:53,388 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 11:40:53,389 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:40:53,455 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_U5SEcl/tmp/07bbb4ad0ba041c99c9f75571245e585/FLAGb4c6a41b4 [2020-07-01 11:40:53,787 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 11:40:53,787 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 11:40:53,788 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 11:40:53,795 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_U5SEcl/tmp/07bbb4ad0ba041c99c9f75571245e585/FLAGb4c6a41b4 [2020-07-01 11:40:54,189 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_U5SEcl/tmp/07bbb4ad0ba041c99c9f75571245e585 [2020-07-01 11:40:54,200 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 11:40:54,202 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 11:40:54,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 11:40:54,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 11:40:54,206 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 11:40:54,207 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:40:54" (1/1) ... [2020-07-01 11:40:54,210 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c31eab8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:54, skipping insertion in model container [2020-07-01 11:40:54,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 11:40:54" (1/1) ... [2020-07-01 11:40:54,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 11:40:54,236 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 11:40:54,473 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:40:54,485 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 11:40:54,502 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 11:40:54,518 INFO L208 MainTranslator]: Completed translation [2020-07-01 11:40:54,518 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:54 WrapperNode [2020-07-01 11:40:54,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 11:40:54,519 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 11:40:54,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 11:40:54,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 11:40:54,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:54" (1/1) ... [2020-07-01 11:40:54,538 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:54" (1/1) ... [2020-07-01 11:40:54,560 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 11:40:54,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 11:40:54,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 11:40:54,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 11:40:54,570 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:54" (1/1) ... [2020-07-01 11:40:54,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:54" (1/1) ... [2020-07-01 11:40:54,572 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:54" (1/1) ... [2020-07-01 11:40:54,572 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:54" (1/1) ... [2020-07-01 11:40:54,579 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:54" (1/1) ... [2020-07-01 11:40:54,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:54" (1/1) ... [2020-07-01 11:40:54,585 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:54" (1/1) ... [2020-07-01 11:40:54,588 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 11:40:54,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 11:40:54,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 11:40:54,588 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 11:40:54,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:54" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 11:40:54,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 11:40:54,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-01 11:40:54,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 11:40:54,665 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 11:40:54,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 11:40:54,880 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 11:40:54,880 INFO L295 CfgBuilder]: Removed 9 assume(true) statements. [2020-07-01 11:40:54,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:40:54 BoogieIcfgContainer [2020-07-01 11:40:54,884 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 11:40:54,884 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 11:40:54,884 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 11:40:54,886 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 11:40:54,887 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:40:54" (1/1) ... [2020-07-01 11:40:54,900 INFO L313 BlockEncoder]: Initial Icfg 19 locations, 21 edges [2020-07-01 11:40:54,901 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 11:40:54,902 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 11:40:54,903 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 11:40:54,903 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 11:40:54,905 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 11:40:54,906 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 11:40:54,906 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 11:40:54,929 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 11:40:54,957 INFO L200 BlockEncoder]: SBE split 8 edges [2020-07-01 11:40:54,962 INFO L70 emoveInfeasibleEdges]: Removed 1 edges and 0 locations because of local infeasibility [2020-07-01 11:40:54,964 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:40:54,991 INFO L100 BaseMinimizeStates]: Removed 10 edges and 5 locations by large block encoding [2020-07-01 11:40:54,994 INFO L70 RemoveSinkStates]: Removed 9 edges and 2 locations by removing sink states [2020-07-01 11:40:54,995 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 11:40:54,996 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 11:40:54,996 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 11:40:54,997 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 11:40:54,997 INFO L313 BlockEncoder]: Encoded RCFG 12 locations, 20 edges [2020-07-01 11:40:54,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:40:54 BasicIcfg [2020-07-01 11:40:54,998 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 11:40:54,999 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 11:40:54,999 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 11:40:55,002 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 11:40:55,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 11:40:54" (1/4) ... [2020-07-01 11:40:55,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103e4d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:40:55, skipping insertion in model container [2020-07-01 11:40:55,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:54" (2/4) ... [2020-07-01 11:40:55,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103e4d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 11:40:55, skipping insertion in model container [2020-07-01 11:40:55,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:40:54" (3/4) ... [2020-07-01 11:40:55,005 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@103e4d22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:40:55, skipping insertion in model container [2020-07-01 11:40:55,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:40:54" (4/4) ... [2020-07-01 11:40:55,006 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:40:55,018 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 11:40:55,025 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2020-07-01 11:40:55,039 INFO L251 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2020-07-01 11:40:55,063 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 11:40:55,063 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 11:40:55,064 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:40:55,064 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:40:55,064 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:40:55,064 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 11:40:55,064 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:40:55,064 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 11:40:55,079 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-07-01 11:40:55,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 11:40:55,085 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:40:55,086 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 11:40:55,087 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:40:55,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:55,093 INFO L82 PathProgramCache]: Analyzing trace with hash 3653978, now seen corresponding path program 1 times [2020-07-01 11:40:55,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:55,103 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686687209] [2020-07-01 11:40:55,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:55,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:40:55,267 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686687209] [2020-07-01 11:40:55,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:40:55,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:40:55,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249155536] [2020-07-01 11:40:55,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:40:55,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:40:55,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:40:55,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:40:55,292 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 3 states. [2020-07-01 11:40:55,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:40:55,361 INFO L93 Difference]: Finished difference Result 12 states and 20 transitions. [2020-07-01 11:40:55,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:40:55,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 11:40:55,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:40:55,375 INFO L225 Difference]: With dead ends: 12 [2020-07-01 11:40:55,375 INFO L226 Difference]: Without dead ends: 11 [2020-07-01 11:40:55,378 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:40:55,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-01 11:40:55,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-01 11:40:55,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-01 11:40:55,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 18 transitions. [2020-07-01 11:40:55,413 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 18 transitions. Word has length 4 [2020-07-01 11:40:55,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:40:55,414 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 18 transitions. [2020-07-01 11:40:55,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:40:55,414 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 18 transitions. [2020-07-01 11:40:55,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 11:40:55,414 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:40:55,415 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 11:40:55,415 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 11:40:55,415 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:40:55,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:55,416 INFO L82 PathProgramCache]: Analyzing trace with hash 3653980, now seen corresponding path program 1 times [2020-07-01 11:40:55,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:55,416 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414106081] [2020-07-01 11:40:55,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:55,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:55,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:40:55,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414106081] [2020-07-01 11:40:55,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:40:55,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:40:55,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585051199] [2020-07-01 11:40:55,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:40:55,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:40:55,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:40:55,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:40:55,452 INFO L87 Difference]: Start difference. First operand 11 states and 18 transitions. Second operand 3 states. [2020-07-01 11:40:55,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:40:55,500 INFO L93 Difference]: Finished difference Result 12 states and 18 transitions. [2020-07-01 11:40:55,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:40:55,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 11:40:55,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:40:55,501 INFO L225 Difference]: With dead ends: 12 [2020-07-01 11:40:55,502 INFO L226 Difference]: Without dead ends: 11 [2020-07-01 11:40:55,503 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:40:55,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-01 11:40:55,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-01 11:40:55,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-01 11:40:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 17 transitions. [2020-07-01 11:40:55,507 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 17 transitions. Word has length 4 [2020-07-01 11:40:55,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:40:55,507 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 17 transitions. [2020-07-01 11:40:55,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:40:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 17 transitions. [2020-07-01 11:40:55,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 11:40:55,508 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:40:55,508 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 11:40:55,508 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 11:40:55,508 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:40:55,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:55,509 INFO L82 PathProgramCache]: Analyzing trace with hash 3653981, now seen corresponding path program 1 times [2020-07-01 11:40:55,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:55,509 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950535128] [2020-07-01 11:40:55,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:55,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:40:55,541 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950535128] [2020-07-01 11:40:55,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:40:55,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-01 11:40:55,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417501620] [2020-07-01 11:40:55,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:40:55,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:40:55,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:40:55,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:40:55,543 INFO L87 Difference]: Start difference. First operand 11 states and 17 transitions. Second operand 4 states. [2020-07-01 11:40:55,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:40:55,578 INFO L93 Difference]: Finished difference Result 11 states and 17 transitions. [2020-07-01 11:40:55,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:40:55,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2020-07-01 11:40:55,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:40:55,580 INFO L225 Difference]: With dead ends: 11 [2020-07-01 11:40:55,580 INFO L226 Difference]: Without dead ends: 10 [2020-07-01 11:40:55,580 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-01 11:40:55,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-07-01 11:40:55,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-01 11:40:55,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-01 11:40:55,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 16 transitions. [2020-07-01 11:40:55,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 16 transitions. Word has length 4 [2020-07-01 11:40:55,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:40:55,584 INFO L479 AbstractCegarLoop]: Abstraction has 10 states and 16 transitions. [2020-07-01 11:40:55,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:40:55,584 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 16 transitions. [2020-07-01 11:40:55,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 11:40:55,585 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:40:55,585 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 11:40:55,585 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 11:40:55,585 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:40:55,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:55,585 INFO L82 PathProgramCache]: Analyzing trace with hash 113274074, now seen corresponding path program 1 times [2020-07-01 11:40:55,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:55,586 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105906956] [2020-07-01 11:40:55,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:40:55,623 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105906956] [2020-07-01 11:40:55,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:40:55,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:40:55,623 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070979755] [2020-07-01 11:40:55,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:40:55,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:40:55,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:40:55,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:40:55,625 INFO L87 Difference]: Start difference. First operand 10 states and 16 transitions. Second operand 3 states. [2020-07-01 11:40:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:40:55,655 INFO L93 Difference]: Finished difference Result 10 states and 16 transitions. [2020-07-01 11:40:55,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:40:55,656 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 11:40:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:40:55,656 INFO L225 Difference]: With dead ends: 10 [2020-07-01 11:40:55,656 INFO L226 Difference]: Without dead ends: 9 [2020-07-01 11:40:55,657 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:40:55,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-07-01 11:40:55,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-01 11:40:55,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-01 11:40:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 14 transitions. [2020-07-01 11:40:55,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 14 transitions. Word has length 5 [2020-07-01 11:40:55,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:40:55,660 INFO L479 AbstractCegarLoop]: Abstraction has 9 states and 14 transitions. [2020-07-01 11:40:55,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:40:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 14 transitions. [2020-07-01 11:40:55,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 11:40:55,661 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:40:55,661 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 11:40:55,661 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 11:40:55,661 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:40:55,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:55,662 INFO L82 PathProgramCache]: Analyzing trace with hash 113274076, now seen corresponding path program 1 times [2020-07-01 11:40:55,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:55,662 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231937586] [2020-07-01 11:40:55,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:55,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:55,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:40:55,714 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231937586] [2020-07-01 11:40:55,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:40:55,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-01 11:40:55,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663565106] [2020-07-01 11:40:55,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-01 11:40:55,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:40:55,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-01 11:40:55,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-01 11:40:55,716 INFO L87 Difference]: Start difference. First operand 9 states and 14 transitions. Second operand 5 states. [2020-07-01 11:40:55,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:40:55,769 INFO L93 Difference]: Finished difference Result 14 states and 22 transitions. [2020-07-01 11:40:55,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 11:40:55,770 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2020-07-01 11:40:55,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:40:55,772 INFO L225 Difference]: With dead ends: 14 [2020-07-01 11:40:55,772 INFO L226 Difference]: Without dead ends: 13 [2020-07-01 11:40:55,773 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:40:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-01 11:40:55,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 10. [2020-07-01 11:40:55,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-01 11:40:55,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2020-07-01 11:40:55,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 5 [2020-07-01 11:40:55,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:40:55,778 INFO L479 AbstractCegarLoop]: Abstraction has 10 states and 15 transitions. [2020-07-01 11:40:55,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-01 11:40:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2020-07-01 11:40:55,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 11:40:55,779 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:40:55,779 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:40:55,779 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 11:40:55,779 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:40:55,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:55,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1482188220, now seen corresponding path program 1 times [2020-07-01 11:40:55,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:55,780 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283515002] [2020-07-01 11:40:55,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:55,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:55,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:40:55,880 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283515002] [2020-07-01 11:40:55,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:40:55,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-01 11:40:55,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604916616] [2020-07-01 11:40:55,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-01 11:40:55,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:40:55,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-01 11:40:55,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:40:55,882 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. Second operand 6 states. [2020-07-01 11:40:55,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:40:55,974 INFO L93 Difference]: Finished difference Result 21 states and 32 transitions. [2020-07-01 11:40:55,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-01 11:40:55,975 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2020-07-01 11:40:55,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:40:55,975 INFO L225 Difference]: With dead ends: 21 [2020-07-01 11:40:55,975 INFO L226 Difference]: Without dead ends: 16 [2020-07-01 11:40:55,976 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-01 11:40:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-01 11:40:55,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 14. [2020-07-01 11:40:55,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-01 11:40:55,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 20 transitions. [2020-07-01 11:40:55,980 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 20 transitions. Word has length 7 [2020-07-01 11:40:55,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:40:55,981 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 20 transitions. [2020-07-01 11:40:55,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-01 11:40:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 20 transitions. [2020-07-01 11:40:55,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 11:40:55,981 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:40:55,982 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:40:55,982 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 11:40:55,982 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:40:55,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:55,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1482186796, now seen corresponding path program 1 times [2020-07-01 11:40:55,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:55,983 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294643978] [2020-07-01 11:40:55,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:55,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:56,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:40:56,012 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294643978] [2020-07-01 11:40:56,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 11:40:56,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 11:40:56,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153694947] [2020-07-01 11:40:56,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 11:40:56,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:40:56,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 11:40:56,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:40:56,014 INFO L87 Difference]: Start difference. First operand 14 states and 20 transitions. Second operand 3 states. [2020-07-01 11:40:56,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:40:56,049 INFO L93 Difference]: Finished difference Result 14 states and 20 transitions. [2020-07-01 11:40:56,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 11:40:56,050 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-01 11:40:56,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:40:56,050 INFO L225 Difference]: With dead ends: 14 [2020-07-01 11:40:56,050 INFO L226 Difference]: Without dead ends: 8 [2020-07-01 11:40:56,051 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 11:40:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-07-01 11:40:56,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-01 11:40:56,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-01 11:40:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 11 transitions. [2020-07-01 11:40:56,054 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 11 transitions. Word has length 7 [2020-07-01 11:40:56,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:40:56,054 INFO L479 AbstractCegarLoop]: Abstraction has 8 states and 11 transitions. [2020-07-01 11:40:56,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 11:40:56,054 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 11 transitions. [2020-07-01 11:40:56,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 11:40:56,055 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:40:56,055 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:40:56,055 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 11:40:56,055 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:40:56,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:56,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1768479730, now seen corresponding path program 1 times [2020-07-01 11:40:56,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:56,056 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134926164] [2020-07-01 11:40:56,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:56,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:40:56,201 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134926164] [2020-07-01 11:40:56,201 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1200185878] [2020-07-01 11:40:56,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:40:56,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:56,246 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-01 11:40:56,252 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:40:56,332 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2020-07-01 11:40:56,332 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:40:56,346 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:40:56,349 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-01 11:40:56,349 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:28, output treesize:24 [2020-07-01 11:40:56,397 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:40:56,397 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2020-07-01 11:40:56,399 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:40:56,402 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:40:56,414 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:40:56,416 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:40:56,419 INFO L477 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-07-01 11:40:56,421 INFO L539 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-07-01 11:40:56,421 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-07-01 11:40:56,456 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:40:56,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:40:56,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:40:56,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2020-07-01 11:40:56,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546505763] [2020-07-01 11:40:56,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-01 11:40:56,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:40:56,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-01 11:40:56,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-07-01 11:40:56,461 INFO L87 Difference]: Start difference. First operand 8 states and 11 transitions. Second operand 9 states. [2020-07-01 11:40:56,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:40:56,918 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-01 11:40:56,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-01 11:40:56,918 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 7 [2020-07-01 11:40:56,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:40:56,919 INFO L225 Difference]: With dead ends: 12 [2020-07-01 11:40:56,919 INFO L226 Difference]: Without dead ends: 11 [2020-07-01 11:40:56,920 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2020-07-01 11:40:56,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-01 11:40:56,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2020-07-01 11:40:56,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-01 11:40:56,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 15 transitions. [2020-07-01 11:40:56,923 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 15 transitions. Word has length 7 [2020-07-01 11:40:56,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:40:56,923 INFO L479 AbstractCegarLoop]: Abstraction has 10 states and 15 transitions. [2020-07-01 11:40:56,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-01 11:40:56,924 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 15 transitions. [2020-07-01 11:40:56,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-01 11:40:56,924 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:40:56,924 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-01 11:40:57,125 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2020-07-01 11:40:57,125 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:40:57,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:57,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1768479731, now seen corresponding path program 1 times [2020-07-01 11:40:57,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:57,127 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685517000] [2020-07-01 11:40:57,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:57,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:40:57,165 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685517000] [2020-07-01 11:40:57,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1725629420] [2020-07-01 11:40:57,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:40:57,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:57,197 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-01 11:40:57,197 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:40:57,209 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:40:57,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-01 11:40:57,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2020-07-01 11:40:57,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978376343] [2020-07-01 11:40:57,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-01 11:40:57,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:40:57,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-01 11:40:57,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:40:57,211 INFO L87 Difference]: Start difference. First operand 10 states and 15 transitions. Second operand 4 states. [2020-07-01 11:40:57,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:40:57,235 INFO L93 Difference]: Finished difference Result 11 states and 15 transitions. [2020-07-01 11:40:57,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-01 11:40:57,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 7 [2020-07-01 11:40:57,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:40:57,236 INFO L225 Difference]: With dead ends: 11 [2020-07-01 11:40:57,236 INFO L226 Difference]: Without dead ends: 10 [2020-07-01 11:40:57,237 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-01 11:40:57,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-07-01 11:40:57,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-01 11:40:57,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-01 11:40:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 13 transitions. [2020-07-01 11:40:57,240 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 13 transitions. Word has length 7 [2020-07-01 11:40:57,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:40:57,240 INFO L479 AbstractCegarLoop]: Abstraction has 10 states and 13 transitions. [2020-07-01 11:40:57,240 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-01 11:40:57,240 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 13 transitions. [2020-07-01 11:40:57,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-01 11:40:57,241 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:40:57,241 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2020-07-01 11:40:57,441 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:40:57,442 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:40:57,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:57,442 INFO L82 PathProgramCache]: Analyzing trace with hash -1298045102, now seen corresponding path program 2 times [2020-07-01 11:40:57,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:57,443 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099145054] [2020-07-01 11:40:57,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:57,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:40:57,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099145054] [2020-07-01 11:40:57,610 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [223848571] [2020-07-01 11:40:57,610 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:40:57,641 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-01 11:40:57,642 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-01 11:40:57,643 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 26 conjunts are in the unsatisfiable core [2020-07-01 11:40:57,644 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:40:57,651 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:40:57,651 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:40:57,655 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:40:57,656 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:40:57,656 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 11:40:57,675 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2020-07-01 11:40:57,676 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:40:57,681 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:40:57,682 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-07-01 11:40:57,682 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:23, output treesize:19 [2020-07-01 11:40:57,718 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:40:57,718 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2020-07-01 11:40:57,720 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:40:57,721 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:40:57,731 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:40:57,732 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-01 11:40:57,733 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:40:57,734 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:33, output treesize:24 [2020-07-01 11:40:57,766 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:40:57,779 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-01 11:40:57,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:40:57,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2020-07-01 11:40:57,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268790749] [2020-07-01 11:40:57,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-01 11:40:57,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:40:57,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-01 11:40:57,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2020-07-01 11:40:57,781 INFO L87 Difference]: Start difference. First operand 10 states and 13 transitions. Second operand 10 states. [2020-07-01 11:40:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:40:58,187 INFO L93 Difference]: Finished difference Result 14 states and 18 transitions. [2020-07-01 11:40:58,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-01 11:40:58,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 9 [2020-07-01 11:40:58,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:40:58,188 INFO L225 Difference]: With dead ends: 14 [2020-07-01 11:40:58,188 INFO L226 Difference]: Without dead ends: 13 [2020-07-01 11:40:58,189 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2020-07-01 11:40:58,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-01 11:40:58,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2020-07-01 11:40:58,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-01 11:40:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2020-07-01 11:40:58,193 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 16 transitions. Word has length 9 [2020-07-01 11:40:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:40:58,193 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 16 transitions. [2020-07-01 11:40:58,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-01 11:40:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 16 transitions. [2020-07-01 11:40:58,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-01 11:40:58,194 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 11:40:58,194 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1] [2020-07-01 11:40:58,394 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-01 11:40:58,395 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC, ULTIMATE.startErr2REQUIRES_VIOLATION]=== [2020-07-01 11:40:58,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:58,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1880843567, now seen corresponding path program 1 times [2020-07-01 11:40:58,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:58,396 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655720616] [2020-07-01 11:40:58,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:58,487 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-01 11:40:58,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655720616] [2020-07-01 11:40:58,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [423853837] [2020-07-01 11:40:58,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:40:58,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:40:58,526 INFO L264 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 29 conjunts are in the unsatisfiable core [2020-07-01 11:40:58,527 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:40:58,533 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2020-07-01 11:40:58,534 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:40:58,539 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:40:58,540 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:40:58,540 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2020-07-01 11:40:58,548 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-01 11:40:58,548 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-01 11:40:58,550 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:40:58,551 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:40:58,551 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2020-07-01 11:40:58,564 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:40:58,565 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2020-07-01 11:40:58,566 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:40:58,566 INFO L539 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-01 11:40:58,576 INFO L619 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-01 11:40:58,576 INFO L539 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-01 11:40:58,577 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:26, output treesize:20 [2020-07-01 11:40:58,597 INFO L477 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-01 11:40:58,608 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-01 11:40:58,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-01 11:40:58,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2020-07-01 11:40:58,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704426109] [2020-07-01 11:40:58,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-01 11:40:58,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 11:40:58,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-01 11:40:58,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2020-07-01 11:40:58,610 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. Second operand 8 states. [2020-07-01 11:40:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 11:40:58,682 INFO L93 Difference]: Finished difference Result 12 states and 16 transitions. [2020-07-01 11:40:58,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-01 11:40:58,682 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-07-01 11:40:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 11:40:58,683 INFO L225 Difference]: With dead ends: 12 [2020-07-01 11:40:58,683 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 11:40:58,683 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2020-07-01 11:40:58,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 11:40:58,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 11:40:58,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 11:40:58,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 11:40:58,684 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2020-07-01 11:40:58,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 11:40:58,684 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:40:58,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-01 11:40:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 11:40:58,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 11:40:58,885 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-01 11:40:58,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 11:40:59,094 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 46 [2020-07-01 11:40:59,097 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 11:40:59,098 INFO L268 CegarLoopResult]: For program point L28-1(lines 28 29) no Hoare annotation was computed. [2020-07-01 11:40:59,098 INFO L264 CegarLoopResult]: At program point L28-3(lines 28 29) the Hoare annotation is: (let ((.cse9 (select |#length| ULTIMATE.start_cstrlen_~p~0.base))) (let ((.cse0 (= 0 ULTIMATE.start_cstrlen_~p~0.offset)) (.cse7 (<= 1 .cse9)) (.cse8 (select |#memory_int| ULTIMATE.start_cstrlen_~p~0.base)) (.cse1 (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0)) (.cse2 (= 1 (select |#valid| ULTIMATE.start_cstrlen_~p~0.base))) (.cse3 (= ULTIMATE.start_cstrlen_~s.base ULTIMATE.start_cstrlen_~p~0.base)) (.cse4 (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0)) (.cse5 (= 1 (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base))) (.cse6 (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0))) (or (and .cse0 .cse1 .cse2 (<= (+ ULTIMATE.start___VERIFIER_nondet_String_~length~0 ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset) 1) .cse3 .cse4 .cse5 .cse6 .cse7 (= 0 (select .cse8 ULTIMATE.start_cstrlen_~p~0.offset))) (and (exists ((ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset Int)) (and (<= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (= 0 (select (select |#memory_int| ULTIMATE.start_cstrlen_~p~0.base) (+ ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset (select |#length| ULTIMATE.start_cstrlen_~p~0.base) (- 1)))) (<= 0 ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset))) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7) (and (= 0 (select .cse8 (+ .cse9 (- 1)))) (<= (+ ULTIMATE.start_cstrlen_~p~0.offset 1) .cse9) .cse1 .cse2 (<= 1 ULTIMATE.start_cstrlen_~p~0.offset) .cse3 .cse4 .cse5 .cse6)))) [2020-07-01 11:40:59,098 INFO L268 CegarLoopResult]: For program point L28-4(lines 28 29) no Hoare annotation was computed. [2020-07-01 11:40:59,098 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (and (= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset 0) (= (select |#length| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base) ULTIMATE.start___VERIFIER_nondet_String_~length~0) (= 1 (select |#valid| ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base)) (<= 1 ULTIMATE.start___VERIFIER_nondet_String_~length~0)) [2020-07-01 11:40:59,099 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONILLEGAL_POINTER_ARITHMETIC(line 30) no Hoare annotation was computed. [2020-07-01 11:40:59,099 INFO L268 CegarLoopResult]: For program point L12(lines 12 14) no Hoare annotation was computed. [2020-07-01 11:40:59,099 INFO L268 CegarLoopResult]: For program point L12-2(lines 12 14) no Hoare annotation was computed. [2020-07-01 11:40:59,099 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 11:40:59,099 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 11:40:59,099 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 28) no Hoare annotation was computed. [2020-07-01 11:40:59,099 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 11:40:59,101 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 11:40:59,109 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:40:59,115 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:40:59,118 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:40:59,118 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:40:59,119 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:40:59,120 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:40:59,121 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:40:59,121 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:40:59,121 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:40:59,121 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:40:59,121 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:40:59,122 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:40:59,122 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:40:59,122 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:40:59,122 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:40:59,123 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:40:59,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:40:59,124 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:40:59,125 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:40:59,126 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:40:59,127 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:40:59,127 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:40:59,127 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:40:59,127 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:40:59,127 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:40:59,128 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:40:59,128 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:40:59,128 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:40:59,128 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:40:59,129 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:40:59,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:40:59 BasicIcfg [2020-07-01 11:40:59,131 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 11:40:59,132 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 11:40:59,132 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 11:40:59,135 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 11:40:59,136 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:40:59,136 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 11:40:54" (1/5) ... [2020-07-01 11:40:59,136 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58401aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:40:59, skipping insertion in model container [2020-07-01 11:40:59,137 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:40:59,137 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 11:40:54" (2/5) ... [2020-07-01 11:40:59,137 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58401aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 11:40:59, skipping insertion in model container [2020-07-01 11:40:59,137 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:40:59,137 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 11:40:54" (3/5) ... [2020-07-01 11:40:59,137 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58401aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:40:59, skipping insertion in model container [2020-07-01 11:40:59,138 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:40:59,138 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 11:40:54" (4/5) ... [2020-07-01 11:40:59,138 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@58401aeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:40:59, skipping insertion in model container [2020-07-01 11:40:59,138 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 11:40:59,138 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 11:40:59" (5/5) ... [2020-07-01 11:40:59,139 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 11:40:59,160 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 11:40:59,160 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 11:40:59,160 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 11:40:59,160 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 11:40:59,161 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 11:40:59,161 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 11:40:59,161 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 11:40:59,161 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 11:40:59,164 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-01 11:40:59,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-01 11:40:59,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:40:59,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:40:59,173 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 11:40:59,173 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 11:40:59,173 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 11:40:59,173 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2020-07-01 11:40:59,174 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2020-07-01 11:40:59,175 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 11:40:59,175 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 11:40:59,175 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-07-01 11:40:59,175 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-07-01 11:40:59,180 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue [90] ULTIMATE.startENTRY-->L12: Formula: (and (= 0 |v_#NULL.base_2|) (= (store |v_#valid_10| 0 0) |v_#valid_9|) (< 0 |v_#StackHeapBarrier_3|) (= 0 |v_#NULL.offset_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_3|, #valid=|v_#valid_10|} OutVars{ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_3|, #NULL.offset=|v_#NULL.offset_2|, #NULL.base=|v_#NULL.base_2|, #StackHeapBarrier=|v_#StackHeapBarrier_3|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_4|, #valid=|v_#valid_9|, ULTIMATE.start_main_#t~ret4.base=|v_ULTIMATE.start_main_#t~ret4.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_10, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0_6|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_4|, ULTIMATE.start_main_#t~ret5=|v_ULTIMATE.start_main_#t~ret5_4|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_3|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_7, ULTIMATE.start_main_#t~ret4.offset=|v_ULTIMATE.start_main_#t~ret4.offset_4|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, #NULL.offset, #NULL.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_main_#t~ret4.base, ULTIMATE.start___VERIFIER_nondet_String_~length~0, ULTIMATE.start___VERIFIER_nondet_String_#t~nondet0, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_main_#t~ret5, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base, ULTIMATE.start_main_#t~ret4.offset] 9#L12true [59] L12-->L12-2: Formula: (>= v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6 1) InVars {ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} OutVars{ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_6} AuxVars[] AssignedVars[] 3#L12-2true [69] L12-2-->L16: Formula: (and (= (store |v_#length_2| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7) |v_#length_1|) (= 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|) (= (store |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| 1) |v_#valid_3|) (< |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2| |v_#StackHeapBarrier_2|) (= 0 (select |v_#valid_4| |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) (< 0 |v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_2|, #valid=|v_#valid_4|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_2, #valid=|v_#valid_3|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_7, #length=|v_#length_1|, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base_2|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_2} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.offset, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset, #valid, #length, ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base] 6#L16true [92] L16-->L28-3: Formula: (let ((.cse0 (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12))) (and (= |v_ULTIMATE.start_main_#t~ret4.offset_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|) (<= .cse0 (select |v_#length_8| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (= |v_ULTIMATE.start_cstrlen_#in~s.base_2| v_ULTIMATE.start_cstrlen_~s.base_5) (= |v_ULTIMATE.start_cstrlen_#in~s.offset_2| v_ULTIMATE.start_cstrlen_~s.offset_4) (= |v_ULTIMATE.start_cstrlen_#in~s.base_2| |v_ULTIMATE.start_main_#t~ret4.base_5|) (= |v_ULTIMATE.start_main_#t~ret4.base_5| |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= (store |v_#memory_int_7| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 (store (select |v_#memory_int_7| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9) (+ v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8 v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12 (- 1)) 0)) |v_#memory_int_6|) (= v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9 |v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|) (= |v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8) (= 1 (select |v_#valid_12| v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9)) (<= 1 .cse0) (= v_ULTIMATE.start_cstrlen_~s.base_5 v_ULTIMATE.start_cstrlen_~p~0.base_10) (= |v_ULTIMATE.start_main_#t~ret4.offset_5| |v_ULTIMATE.start_cstrlen_#in~s.offset_2|) (= v_ULTIMATE.start_cstrlen_~p~0.offset_8 v_ULTIMATE.start_cstrlen_~s.offset_4))) InVars {ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_7|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, #length=|v_#length_8|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9} OutVars{ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_8, ULTIMATE.start_cstrlen_#t~post3.offset=|v_ULTIMATE.start_cstrlen_#t~post3.offset_4|, ULTIMATE.start___VERIFIER_nondet_String_#res.offset=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.offset_6|, ULTIMATE.start_cstrlen_~s.base=v_ULTIMATE.start_cstrlen_~s.base_5, ULTIMATE.start_cstrlen_#in~s.base=|v_ULTIMATE.start_cstrlen_#in~s.base_2|, ULTIMATE.start_cstrlen_~s.offset=v_ULTIMATE.start_cstrlen_~s.offset_4, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_10, ULTIMATE.start_cstrlen_#in~s.offset=|v_ULTIMATE.start_cstrlen_#in~s.offset_2|, ULTIMATE.start_cstrlen_#res=|v_ULTIMATE.start_cstrlen_#res_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset_8, #valid=|v_#valid_12|, #memory_int=|v_#memory_int_6|, ULTIMATE.start_main_#t~ret4.base=|v_ULTIMATE.start_main_#t~ret4.base_5|, ULTIMATE.start___VERIFIER_nondet_String_~length~0=v_ULTIMATE.start___VERIFIER_nondet_String_~length~0_12, #length=|v_#length_8|, ULTIMATE.start___VERIFIER_nondet_String_#res.base=|v_ULTIMATE.start___VERIFIER_nondet_String_#res.base_6|, ULTIMATE.start_cstrlen_#t~post3.base=|v_ULTIMATE.start_cstrlen_#t~post3.base_4|, ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base=v_ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.base_9, ULTIMATE.start_cstrlen_#t~mem2=|v_ULTIMATE.start_cstrlen_#t~mem2_7|, ULTIMATE.start_main_#t~ret4.offset=|v_ULTIMATE.start_main_#t~ret4.offset_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_~p~0.offset, ULTIMATE.start_cstrlen_#t~post3.offset, ULTIMATE.start___VERIFIER_nondet_String_#res.offset, ULTIMATE.start_cstrlen_~s.base, ULTIMATE.start_cstrlen_#in~s.base, ULTIMATE.start_cstrlen_~s.offset, ULTIMATE.start_cstrlen_~p~0.base, ULTIMATE.start_cstrlen_#in~s.offset, ULTIMATE.start_cstrlen_#res, #memory_int, ULTIMATE.start_main_#t~ret4.base, ULTIMATE.start___VERIFIER_nondet_String_#res.base, ULTIMATE.start_cstrlen_#t~post3.base, ULTIMATE.start_cstrlen_#t~mem2, ULTIMATE.start_main_#t~ret4.offset] 13#L28-3true [2020-07-01 11:40:59,180 INFO L796 eck$LassoCheckResult]: Loop: 13#L28-3true [56] L28-3-->L28-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_cstrlen_~p~0.base_4)) (= (select (select |v_#memory_int_3| v_ULTIMATE.start_cstrlen_~p~0.base_4) v_ULTIMATE.start_cstrlen_~p~0.offset_4) |v_ULTIMATE.start_cstrlen_#t~mem2_2|) (<= 0 v_ULTIMATE.start_cstrlen_~p~0.offset_4) (<= (+ v_ULTIMATE.start_cstrlen_~p~0.offset_4 1) (select |v_#length_5| v_ULTIMATE.start_cstrlen_~p~0.base_4))) InVars {#memory_int=|v_#memory_int_3|, ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_4, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_4, #length=|v_#length_5|, #valid=|v_#valid_7|} OutVars{ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_4, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_4, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_3|, #length=|v_#length_5|, ULTIMATE.start_cstrlen_#t~mem2=|v_ULTIMATE.start_cstrlen_#t~mem2_2|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_#t~mem2] 7#L28-1true [88] L28-1-->L28-3: Formula: (and (= v_ULTIMATE.start_cstrlen_~p~0.offset_6 (+ v_ULTIMATE.start_cstrlen_~p~0.offset_7 1)) (> 0 |v_ULTIMATE.start_cstrlen_#t~mem2_6|) (= v_ULTIMATE.start_cstrlen_~p~0.base_8 v_ULTIMATE.start_cstrlen_~p~0.base_7)) InVars {ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_7, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_8, ULTIMATE.start_cstrlen_#t~mem2=|v_ULTIMATE.start_cstrlen_#t~mem2_6|} OutVars{ULTIMATE.start_cstrlen_~p~0.offset=v_ULTIMATE.start_cstrlen_~p~0.offset_6, ULTIMATE.start_cstrlen_#t~post3.offset=|v_ULTIMATE.start_cstrlen_#t~post3.offset_2|, ULTIMATE.start_cstrlen_~p~0.base=v_ULTIMATE.start_cstrlen_~p~0.base_7, ULTIMATE.start_cstrlen_#t~post3.base=|v_ULTIMATE.start_cstrlen_#t~post3.base_2|, ULTIMATE.start_cstrlen_#t~mem2=|v_ULTIMATE.start_cstrlen_#t~mem2_5|} AuxVars[] AssignedVars[ULTIMATE.start_cstrlen_~p~0.offset, ULTIMATE.start_cstrlen_#t~post3.offset, ULTIMATE.start_cstrlen_~p~0.base, ULTIMATE.start_cstrlen_#t~post3.base, ULTIMATE.start_cstrlen_#t~mem2] 13#L28-3true [2020-07-01 11:40:59,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:59,181 INFO L82 PathProgramCache]: Analyzing trace with hash 3663641, now seen corresponding path program 1 times [2020-07-01 11:40:59,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:59,182 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859594437] [2020-07-01 11:40:59,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:59,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:59,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:59,211 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:40:59,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:59,212 INFO L82 PathProgramCache]: Analyzing trace with hash 2785, now seen corresponding path program 1 times [2020-07-01 11:40:59,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:59,212 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350234825] [2020-07-01 11:40:59,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:59,219 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:40:59,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:40:59,219 INFO L82 PathProgramCache]: Analyzing trace with hash -774206471, now seen corresponding path program 1 times [2020-07-01 11:40:59,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 11:40:59,220 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726009345] [2020-07-01 11:40:59,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 11:40:59,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:59,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 11:40:59,238 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 11:40:59,412 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2020-07-01 11:40:59,479 INFO L210 LassoAnalysis]: Preferences: [2020-07-01 11:40:59,480 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-07-01 11:40:59,481 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-07-01 11:40:59,481 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-07-01 11:40:59,481 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-07-01 11:40:59,481 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:40:59,481 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-07-01 11:40:59,481 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-07-01 11:40:59,481 INFO L133 ssoRankerPreferences]: Filename of dumped script: theBenchmark.c_BEv2_Iteration1_Lasso [2020-07-01 11:40:59,482 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-07-01 11:40:59,482 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-07-01 11:40:59,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:40:59,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:40:59,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:40:59,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:40:59,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:40:59,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:40:59,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:40:59,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:40:59,653 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2020-07-01 11:40:59,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:40:59,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-07-01 11:40:59,955 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-07-01 11:40:59,961 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:40:59,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:40:59,968 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:40:59,968 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:40:59,969 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:40:59,969 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:40:59,969 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:40:59,971 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:40:59,971 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:40:59,973 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:41:00,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:41:00,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:41:00,008 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:41:00,008 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:41:00,008 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:41:00,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:41:00,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:41:00,009 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:41:00,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:41:00,042 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:41:00,044 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:41:00,044 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:41:00,044 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:41:00,044 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:41:00,044 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:41:00,045 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:41:00,045 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:41:00,046 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:41:00,078 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:41:00,080 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:41:00,080 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:41:00,081 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:41:00,081 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:41:00,081 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:41:00,081 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:41:00,082 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:41:00,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:41:00,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:41:00,117 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:41:00,117 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:41:00,117 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:41:00,117 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:41:00,120 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:41:00,120 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:41:00,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:41:00,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:41:00,158 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:41:00,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:41:00,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:41:00,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:41:00,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:41:00,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:41:00,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:41:00,161 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:41:00,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:41:00,195 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:41:00,195 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-07-01 11:41:00,195 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:41:00,195 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:41:00,195 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:41:00,196 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-07-01 11:41:00,196 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-07-01 11:41:00,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:41:00,229 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:41:00,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:41:00,232 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:41:00,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:41:00,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:41:00,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:41:00,241 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:41:00,253 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:41:00,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-07-01 11:41:00,287 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-07-01 11:41:00,288 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-07-01 11:41:00,288 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-07-01 11:41:00,288 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-07-01 11:41:00,297 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-07-01 11:41:00,298 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-07-01 11:41:00,312 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-07-01 11:41:00,338 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2020-07-01 11:41:00,338 INFO L444 ModelExtractionUtils]: 12 out of 34 variables were initially zero. Simplification set additionally 19 variables to zero. No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-07-01 11:41:00,345 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-07-01 11:41:00,349 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-07-01 11:41:00,349 INFO L510 LassoAnalysis]: Proved termination. [2020-07-01 11:41:00,350 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_cstrlen_~p~0.offset, v_rep(select #length ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base)_1) = -1*ULTIMATE.start_cstrlen_~p~0.offset + 1*v_rep(select #length ULTIMATE.start___VERIFIER_nondet_String_#t~malloc1.base)_1 Supporting invariants [] [2020-07-01 11:41:00,391 INFO L297 tatePredicateManager]: 3 out of 4 supporting invariants were superfluous and have been removed [2020-07-01 11:41:00,396 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:41:00,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 11:41:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:41:00,438 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-01 11:41:00,439 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:41:00,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 11:41:00,460 WARN L262 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-01 11:41:00,460 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-01 11:41:00,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 11:41:00,538 INFO L98 LoopCannibalizer]: 3 predicates before loop cannibalization 3 predicates after loop cannibalization [2020-07-01 11:41:00,542 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-07-01 11:41:00,543 INFO L69 BuchiDifferenceNCSB]: Start buchiDifferenceNCSB. First operand 12 states. Second operand 4 states. [2020-07-01 11:41:00,628 INFO L73 BuchiDifferenceNCSB]: Finished buchiDifferenceNCSB. First operand 12 states.. Second operand 4 states. Result 18 states and 38 transitions. Complement of second has 7 states. [2020-07-01 11:41:00,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2020-07-01 11:41:00,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-01 11:41:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-07-01 11:41:00,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 2 letters. [2020-07-01 11:41:00,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:41:00,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 6 letters. Loop has 2 letters. [2020-07-01 11:41:00,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:41:00,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 4 letters. Loop has 4 letters. [2020-07-01 11:41:00,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-07-01 11:41:00,640 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 38 transitions. [2020-07-01 11:41:00,641 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 11:41:00,641 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 0 states and 0 transitions. [2020-07-01 11:41:00,643 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-07-01 11:41:00,643 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-07-01 11:41:00,643 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-07-01 11:41:00,643 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-07-01 11:41:00,644 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:41:00,644 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:41:00,644 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 11:41:00,644 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2020-07-01 11:41:00,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-07-01 11:41:00,644 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-07-01 11:41:00,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-07-01 11:41:00,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 11:41:00 BasicIcfg [2020-07-01 11:41:00,650 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-07-01 11:41:00,651 INFO L168 Benchmark]: Toolchain (without parser) took 6449.94 ms. Allocated memory was 514.9 MB in the beginning and 622.3 MB in the end (delta: 107.5 MB). Free memory was 436.0 MB in the beginning and 563.7 MB in the end (delta: -127.6 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:41:00,652 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.9 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:41:00,652 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.28 ms. Allocated memory was 514.9 MB in the beginning and 545.8 MB in the end (delta: 30.9 MB). Free memory was 435.5 MB in the beginning and 514.0 MB in the end (delta: -78.5 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. [2020-07-01 11:41:00,653 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.56 ms. Allocated memory is still 545.8 MB. Free memory was 514.0 MB in the beginning and 512.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. [2020-07-01 11:41:00,653 INFO L168 Benchmark]: Boogie Preprocessor took 27.48 ms. Allocated memory is still 545.8 MB. Free memory was 512.5 MB in the beginning and 510.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. [2020-07-01 11:41:00,653 INFO L168 Benchmark]: RCFGBuilder took 295.74 ms. Allocated memory is still 545.8 MB. Free memory was 510.2 MB in the beginning and 493.9 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 50.3 GB. [2020-07-01 11:41:00,654 INFO L168 Benchmark]: BlockEncodingV2 took 113.61 ms. Allocated memory is still 545.8 MB. Free memory was 493.9 MB in the beginning and 485.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 50.3 GB. [2020-07-01 11:41:00,654 INFO L168 Benchmark]: TraceAbstraction took 4132.08 ms. Allocated memory was 545.8 MB in the beginning and 584.1 MB in the end (delta: 38.3 MB). Free memory was 484.7 MB in the beginning and 400.8 MB in the end (delta: 84.0 MB). Peak memory consumption was 122.2 MB. Max. memory is 50.3 GB. [2020-07-01 11:41:00,655 INFO L168 Benchmark]: BuchiAutomizer took 1518.39 ms. Allocated memory was 584.1 MB in the beginning and 622.3 MB in the end (delta: 38.3 MB). Free memory was 398.4 MB in the beginning and 563.7 MB in the end (delta: -165.2 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 11:41:00,658 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 19 locations, 21 edges - StatisticsResult: Encoded RCFG 12 locations, 20 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 514.9 MB. Free memory is still 455.9 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 316.28 ms. Allocated memory was 514.9 MB in the beginning and 545.8 MB in the end (delta: 30.9 MB). Free memory was 435.5 MB in the beginning and 514.0 MB in the end (delta: -78.5 MB). Peak memory consumption was 28.3 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 40.56 ms. Allocated memory is still 545.8 MB. Free memory was 514.0 MB in the beginning and 512.5 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 27.48 ms. Allocated memory is still 545.8 MB. Free memory was 512.5 MB in the beginning and 510.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 50.3 GB. * RCFGBuilder took 295.74 ms. Allocated memory is still 545.8 MB. Free memory was 510.2 MB in the beginning and 493.9 MB in the end (delta: 16.4 MB). Peak memory consumption was 16.4 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 113.61 ms. Allocated memory is still 545.8 MB. Free memory was 493.9 MB in the beginning and 485.5 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 50.3 GB. * TraceAbstraction took 4132.08 ms. Allocated memory was 545.8 MB in the beginning and 584.1 MB in the end (delta: 38.3 MB). Free memory was 484.7 MB in the beginning and 400.8 MB in the end (delta: 84.0 MB). Peak memory consumption was 122.2 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 1518.39 ms. Allocated memory was 584.1 MB in the beginning and 622.3 MB in the end (delta: 38.3 MB). Free memory was 398.4 MB in the beginning and 563.7 MB in the end (delta: -165.2 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 30]: pointer arithmetic is always legal For all program executions holds that pointer arithmetic is always legal at this location - PositiveResult [Line: 28]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 5 specifications checked. All of them hold - InvariantResult [Line: 16]: Loop Invariant [2020-07-01 11:41:00,666 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:41:00,666 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((nondetString == 0 && unknown-#length-unknown[nondetString] == length) && 1 == \valid[nondetString]) && 1 <= length - InvariantResult [Line: 28]: Loop Invariant [2020-07-01 11:41:00,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:41:00,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:41:00,667 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:41:00,669 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:41:00,669 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:41:00,669 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:41:00,669 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:41:00,669 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:41:00,670 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:41:00,670 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:41:00,670 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:41:00,670 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:41:00,671 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:41:00,671 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:41:00,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:41:00,672 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:41:00,673 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset,QUANTIFIED] [2020-07-01 11:41:00,674 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:41:00,674 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:41:00,674 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:41:00,674 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:41:00,675 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:41:00,675 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:41:00,675 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:41:00,675 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-07-01 11:41:00,675 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:41:00,676 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 11:41:00,676 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((0 == p && nondetString == 0) && 1 == \valid[p]) && length + nondetString <= 1) && s == p) && unknown-#length-unknown[nondetString] == length) && 1 == \valid[nondetString]) && 1 <= length) && 1 <= unknown-#length-unknown[p]) && 0 == unknown-#memory_int-unknown[p][p]) || (((((((((\exists ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset : int :: (ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset <= 0 && 0 == unknown-#memory_int-unknown[p][ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset + unknown-#length-unknown[p] + -1]) && 0 <= ULTIMATE.start___VERIFIER_nondet_String_~nondetString~0.offset) && 0 == p) && nondetString == 0) && 1 == \valid[p]) && s == p) && unknown-#length-unknown[nondetString] == length) && 1 == \valid[nondetString]) && 1 <= length) && 1 <= unknown-#length-unknown[p])) || ((((((((0 == unknown-#memory_int-unknown[p][unknown-#length-unknown[p] + -1] && p + 1 <= unknown-#length-unknown[p]) && nondetString == 0) && 1 == \valid[p]) && 1 <= p) && s == p) && unknown-#length-unknown[nondetString] == length) && 1 == \valid[nondetString]) && 1 <= length) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 5 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.8s, OverallIterations: 11, TraceHistogramMax: 3, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 29 SDtfs, 148 SDslu, 62 SDs, 0 SdLazy, 293 SolverSat, 67 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 7 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 162 HoareAnnotationTreeSize, 2 FomulaSimplifications, 163 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 63 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 104 NumberOfCodeBlocks, 104 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 89 ConstructedInterpolants, 4 QuantifiedInterpolants, 4849 SizeOfPredicates, 33 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 84 ConjunctsInUnsatCore, 15 InterpolantComputations, 8 PerfectInterpolantSequences, 9/31 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 0 deterministic, 1 nondeterministic). One nondeterministic module has affine ranking function -1 * p + unknown-#length-unknown[malloc(length * sizeof(char))] and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 1.4s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 1.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 5 SDtfs, 54 SDslu, 3 SDs, 0 SdLazy, 41 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital123 mio100 ax100 hnf100 lsp95 ukn92 mio100 lsp47 div100 bol100 ite100 ukn100 eq198 hnf88 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 11ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! !SESSION 2020-07-01 11:40:50.948 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_U5SEcl/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 11:41:00.902 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check