/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-fpi/ifeqn3f.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:49:04,963 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:49:04,967 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:49:04,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:49:04,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:49:04,991 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:49:04,993 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:49:05,004 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:49:05,008 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:49:05,012 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:49:05,014 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:49:05,017 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:49:05,017 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:49:05,018 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:49:05,019 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:49:05,023 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:49:05,024 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:49:05,025 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:49:05,028 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:49:05,033 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:49:05,037 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:49:05,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:49:05,040 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:49:05,041 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:49:05,044 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:49:05,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:49:05,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:49:05,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:49:05,048 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:49:05,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:49:05,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:49:05,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:49:05,053 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:49:05,054 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:49:05,057 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:49:05,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:49:05,060 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:49:05,060 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:49:05,061 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:49:05,062 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:49:05,063 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:49:05,064 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:49:05,108 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:49:05,109 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:49:05,111 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:49:05,113 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:49:05,113 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:49:05,113 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:49:05,113 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:49:05,114 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:49:05,114 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:49:05,114 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:49:05,114 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:49:05,114 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:49:05,115 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:49:05,115 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:49:05,115 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:49:05,115 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:49:05,115 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:49:05,116 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:49:05,116 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:49:05,116 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:49:05,117 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:49:05,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:05,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:49:05,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:49:05,118 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:49:05,119 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:49:05,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:49:05,119 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:49:05,119 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:49:05,119 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:49:05,466 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:49:05,480 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:49:05,484 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:49:05,486 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:49:05,486 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:49:05,487 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/ifeqn3f.c [2020-07-17 22:49:05,581 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5894aea01/4c956a1e5ad64ec991286b618116d3ad/FLAG55d018d0e [2020-07-17 22:49:06,082 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:49:06,083 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ifeqn3f.c [2020-07-17 22:49:06,089 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5894aea01/4c956a1e5ad64ec991286b618116d3ad/FLAG55d018d0e [2020-07-17 22:49:06,437 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5894aea01/4c956a1e5ad64ec991286b618116d3ad [2020-07-17 22:49:06,446 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:49:06,450 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:49:06,451 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:06,451 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:49:06,455 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:49:06,457 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:06" (1/1) ... [2020-07-17 22:49:06,460 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee5026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:06, skipping insertion in model container [2020-07-17 22:49:06,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:49:06" (1/1) ... [2020-07-17 22:49:06,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:49:06,492 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:49:06,720 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:06,733 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:49:06,777 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:49:06,795 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:49:06,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:06 WrapperNode [2020-07-17 22:49:06,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:49:06,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:49:06,797 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:49:06,797 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:49:06,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:06" (1/1) ... [2020-07-17 22:49:06,888 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:06" (1/1) ... [2020-07-17 22:49:06,897 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:06" (1/1) ... [2020-07-17 22:49:06,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:06" (1/1) ... [2020-07-17 22:49:06,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:06" (1/1) ... [2020-07-17 22:49:06,933 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:06" (1/1) ... [2020-07-17 22:49:06,935 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:06" (1/1) ... [2020-07-17 22:49:06,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:49:06,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:49:06,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:49:06,938 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:49:06,939 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:49:06,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:49:06,994 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:49:06,994 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:49:06,994 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:49:06,994 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:49:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:49:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:49:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:49:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:49:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:49:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-17 22:49:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:49:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-17 22:49:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-17 22:49:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-17 22:49:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:49:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:49:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-17 22:49:07,410 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:49:07,410 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-17 22:49:07,415 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:07 BoogieIcfgContainer [2020-07-17 22:49:07,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:49:07,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:49:07,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:49:07,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:49:07,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:49:06" (1/3) ... [2020-07-17 22:49:07,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bee46d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:07, skipping insertion in model container [2020-07-17 22:49:07,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:49:06" (2/3) ... [2020-07-17 22:49:07,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bee46d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:49:07, skipping insertion in model container [2020-07-17 22:49:07,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:49:07" (3/3) ... [2020-07-17 22:49:07,427 INFO L109 eAbstractionObserver]: Analyzing ICFG ifeqn3f.c [2020-07-17 22:49:07,436 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:49:07,442 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:49:07,454 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:49:07,477 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:49:07,477 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:49:07,477 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:49:07,477 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:49:07,478 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:49:07,478 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:49:07,478 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:49:07,478 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:49:07,494 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-17 22:49:07,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:49:07,500 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:07,501 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:07,501 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:07,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:07,508 INFO L82 PathProgramCache]: Analyzing trace with hash -294712258, now seen corresponding path program 1 times [2020-07-17 22:49:07,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:07,518 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647966238] [2020-07-17 22:49:07,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:07,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:07,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:07,753 INFO L280 TraceCheckUtils]: 0: Hoare triple {48#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {39#true} is VALID [2020-07-17 22:49:07,754 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:49:07,754 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-17 22:49:07,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:07,766 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-17 22:49:07,769 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-17 22:49:07,770 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-17 22:49:07,770 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-17 22:49:07,772 INFO L263 TraceCheckUtils]: 0: Hoare triple {39#true} call ULTIMATE.init(); {48#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:07,773 INFO L280 TraceCheckUtils]: 1: Hoare triple {48#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {39#true} is VALID [2020-07-17 22:49:07,773 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-17 22:49:07,773 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-17 22:49:07,774 INFO L263 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret10 := main(); {39#true} is VALID [2020-07-17 22:49:07,774 INFO L280 TraceCheckUtils]: 5: Hoare triple {39#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {39#true} is VALID [2020-07-17 22:49:07,775 INFO L280 TraceCheckUtils]: 6: Hoare triple {39#true} assume !(~N~0 <= 0); {39#true} is VALID [2020-07-17 22:49:07,775 INFO L263 TraceCheckUtils]: 7: Hoare triple {39#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {39#true} is VALID [2020-07-17 22:49:07,776 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-17 22:49:07,777 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-17 22:49:07,777 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-17 22:49:07,778 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-17 22:49:07,778 INFO L280 TraceCheckUtils]: 12: Hoare triple {40#false} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {40#false} is VALID [2020-07-17 22:49:07,778 INFO L280 TraceCheckUtils]: 13: Hoare triple {40#false} assume !(~i~0 < ~N~0); {40#false} is VALID [2020-07-17 22:49:07,779 INFO L280 TraceCheckUtils]: 14: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-17 22:49:07,779 INFO L280 TraceCheckUtils]: 15: Hoare triple {40#false} assume !true; {40#false} is VALID [2020-07-17 22:49:07,780 INFO L280 TraceCheckUtils]: 16: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-17 22:49:07,780 INFO L280 TraceCheckUtils]: 17: Hoare triple {40#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {40#false} is VALID [2020-07-17 22:49:07,781 INFO L263 TraceCheckUtils]: 18: Hoare triple {40#false} call __VERIFIER_assert((if #t~mem9 == 1 + (3 * ~i~0 * ~i~0 + 3 * ~i~0) then 1 else 0)); {40#false} is VALID [2020-07-17 22:49:07,781 INFO L280 TraceCheckUtils]: 19: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2020-07-17 22:49:07,781 INFO L280 TraceCheckUtils]: 20: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2020-07-17 22:49:07,782 INFO L280 TraceCheckUtils]: 21: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-17 22:49:07,785 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-17 22:49:07,786 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647966238] [2020-07-17 22:49:07,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:07,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-17 22:49:07,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953469728] [2020-07-17 22:49:07,796 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:49:07,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:07,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-17 22:49:07,862 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:07,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-17 22:49:07,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:07,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-17 22:49:07,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-17 22:49:07,876 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2020-07-17 22:49:08,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:08,099 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2020-07-17 22:49:08,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-17 22:49:08,100 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-17 22:49:08,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:08,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:08,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-17 22:49:08,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-17 22:49:08,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-17 22:49:08,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2020-07-17 22:49:08,301 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:08,314 INFO L225 Difference]: With dead ends: 62 [2020-07-17 22:49:08,314 INFO L226 Difference]: Without dead ends: 31 [2020-07-17 22:49:08,318 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-17 22:49:08,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-17 22:49:08,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-17 22:49:08,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:08,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-17 22:49:08,373 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-17 22:49:08,373 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-17 22:49:08,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:08,379 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-17 22:49:08,379 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-17 22:49:08,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:08,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:08,380 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-17 22:49:08,380 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-17 22:49:08,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:08,385 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-17 22:49:08,385 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-17 22:49:08,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:08,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:08,386 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:08,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:08,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-17 22:49:08,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-17 22:49:08,392 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2020-07-17 22:49:08,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:08,392 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-17 22:49:08,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-17 22:49:08,393 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-17 22:49:08,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-17 22:49:08,394 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:08,394 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:08,394 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:49:08,395 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:08,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:08,395 INFO L82 PathProgramCache]: Analyzing trace with hash -2054124171, now seen corresponding path program 1 times [2020-07-17 22:49:08,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:08,396 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393490396] [2020-07-17 22:49:08,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:08,420 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:08,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [53752331] [2020-07-17 22:49:08,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-17 22:49:08,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:08,493 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-17 22:49:08,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:08,509 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:08,592 INFO L263 TraceCheckUtils]: 0: Hoare triple {233#true} call ULTIMATE.init(); {233#true} is VALID [2020-07-17 22:49:08,592 INFO L280 TraceCheckUtils]: 1: Hoare triple {233#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {233#true} is VALID [2020-07-17 22:49:08,592 INFO L280 TraceCheckUtils]: 2: Hoare triple {233#true} assume true; {233#true} is VALID [2020-07-17 22:49:08,593 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {233#true} {233#true} #91#return; {233#true} is VALID [2020-07-17 22:49:08,593 INFO L263 TraceCheckUtils]: 4: Hoare triple {233#true} call #t~ret10 := main(); {233#true} is VALID [2020-07-17 22:49:08,593 INFO L280 TraceCheckUtils]: 5: Hoare triple {233#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {233#true} is VALID [2020-07-17 22:49:08,594 INFO L280 TraceCheckUtils]: 6: Hoare triple {233#true} assume !(~N~0 <= 0); {256#(< 0 ~N~0)} is VALID [2020-07-17 22:49:08,596 INFO L263 TraceCheckUtils]: 7: Hoare triple {256#(< 0 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {256#(< 0 ~N~0)} is VALID [2020-07-17 22:49:08,596 INFO L280 TraceCheckUtils]: 8: Hoare triple {256#(< 0 ~N~0)} ~cond := #in~cond; {256#(< 0 ~N~0)} is VALID [2020-07-17 22:49:08,597 INFO L280 TraceCheckUtils]: 9: Hoare triple {256#(< 0 ~N~0)} assume !(0 == ~cond); {256#(< 0 ~N~0)} is VALID [2020-07-17 22:49:08,598 INFO L280 TraceCheckUtils]: 10: Hoare triple {256#(< 0 ~N~0)} assume true; {256#(< 0 ~N~0)} is VALID [2020-07-17 22:49:08,599 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {256#(< 0 ~N~0)} {256#(< 0 ~N~0)} #87#return; {256#(< 0 ~N~0)} is VALID [2020-07-17 22:49:08,601 INFO L280 TraceCheckUtils]: 12: Hoare triple {256#(< 0 ~N~0)} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {275#(and (<= main_~i~0 0) (< 0 ~N~0))} is VALID [2020-07-17 22:49:08,602 INFO L280 TraceCheckUtils]: 13: Hoare triple {275#(and (<= main_~i~0 0) (< 0 ~N~0))} assume !(~i~0 < ~N~0); {234#false} is VALID [2020-07-17 22:49:08,602 INFO L280 TraceCheckUtils]: 14: Hoare triple {234#false} ~i~0 := 0; {234#false} is VALID [2020-07-17 22:49:08,603 INFO L280 TraceCheckUtils]: 15: Hoare triple {234#false} assume !(~i~0 < ~N~0); {234#false} is VALID [2020-07-17 22:49:08,603 INFO L280 TraceCheckUtils]: 16: Hoare triple {234#false} ~i~0 := 0; {234#false} is VALID [2020-07-17 22:49:08,603 INFO L280 TraceCheckUtils]: 17: Hoare triple {234#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {234#false} is VALID [2020-07-17 22:49:08,604 INFO L263 TraceCheckUtils]: 18: Hoare triple {234#false} call __VERIFIER_assert((if #t~mem9 == 1 + (3 * ~i~0 * ~i~0 + 3 * ~i~0) then 1 else 0)); {234#false} is VALID [2020-07-17 22:49:08,604 INFO L280 TraceCheckUtils]: 19: Hoare triple {234#false} ~cond := #in~cond; {234#false} is VALID [2020-07-17 22:49:08,604 INFO L280 TraceCheckUtils]: 20: Hoare triple {234#false} assume 0 == ~cond; {234#false} is VALID [2020-07-17 22:49:08,605 INFO L280 TraceCheckUtils]: 21: Hoare triple {234#false} assume !false; {234#false} is VALID [2020-07-17 22:49:08,607 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-17 22:49:08,607 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393490396] [2020-07-17 22:49:08,607 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:08,608 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53752331] [2020-07-17 22:49:08,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:08,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:49:08,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012135613] [2020-07-17 22:49:08,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-17 22:49:08,611 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:08,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:49:08,640 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:08,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:49:08,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:08,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:49:08,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:49:08,642 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2020-07-17 22:49:08,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:08,851 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2020-07-17 22:49:08,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:49:08,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-17 22:49:08,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:08,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:49:08,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2020-07-17 22:49:08,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:49:08,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2020-07-17 22:49:08,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2020-07-17 22:49:08,949 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:08,952 INFO L225 Difference]: With dead ends: 56 [2020-07-17 22:49:08,952 INFO L226 Difference]: Without dead ends: 41 [2020-07-17 22:49:08,953 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 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-17 22:49:08,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-17 22:49:08,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2020-07-17 22:49:08,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:08,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 33 states. [2020-07-17 22:49:08,984 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 33 states. [2020-07-17 22:49:08,984 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 33 states. [2020-07-17 22:49:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:08,989 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-07-17 22:49:08,990 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-07-17 22:49:08,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:08,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:08,991 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 41 states. [2020-07-17 22:49:08,991 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 41 states. [2020-07-17 22:49:08,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:08,995 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-07-17 22:49:08,996 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-07-17 22:49:08,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:08,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:08,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:08,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:08,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-17 22:49:09,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-17 22:49:09,001 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2020-07-17 22:49:09,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:09,001 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-17 22:49:09,001 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:49:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-17 22:49:09,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:49:09,002 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:09,003 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:09,216 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:49:09,217 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:09,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:09,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1477618916, now seen corresponding path program 1 times [2020-07-17 22:49:09,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:09,219 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687123339] [2020-07-17 22:49:09,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:09,252 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:09,253 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [714686811] [2020-07-17 22:49:09,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-17 22:49:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:09,309 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:49:09,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:09,329 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:09,406 INFO L384 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 11 treesize of output 7 [2020-07-17 22:49:09,407 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:09,412 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:09,412 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:09,413 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-07-17 22:49:09,480 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:09,481 INFO L384 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-17 22:49:09,483 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-17 22:49:09,497 INFO L624 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2020-07-17 22:49:09,498 INFO L544 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:09,498 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2020-07-17 22:49:09,502 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:09,503 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~b~0.base, main_~b~0.offset]. (let ((.cse0 (select |#memory_int| main_~b~0.base))) (and (= (select .cse0 main_~b~0.offset) 1) (= (select .cse0 (+ main_~b~0.offset (* main_~i~0 8))) |main_#t~mem9|) (= 0 main_~i~0))) [2020-07-17 22:49:09,503 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~i~0) (= 1 |main_#t~mem9|)) [2020-07-17 22:49:09,572 INFO L263 TraceCheckUtils]: 0: Hoare triple {505#true} call ULTIMATE.init(); {505#true} is VALID [2020-07-17 22:49:09,573 INFO L280 TraceCheckUtils]: 1: Hoare triple {505#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {505#true} is VALID [2020-07-17 22:49:09,573 INFO L280 TraceCheckUtils]: 2: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-17 22:49:09,573 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {505#true} {505#true} #91#return; {505#true} is VALID [2020-07-17 22:49:09,574 INFO L263 TraceCheckUtils]: 4: Hoare triple {505#true} call #t~ret10 := main(); {505#true} is VALID [2020-07-17 22:49:09,574 INFO L280 TraceCheckUtils]: 5: Hoare triple {505#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {505#true} is VALID [2020-07-17 22:49:09,574 INFO L280 TraceCheckUtils]: 6: Hoare triple {505#true} assume !(~N~0 <= 0); {505#true} is VALID [2020-07-17 22:49:09,575 INFO L263 TraceCheckUtils]: 7: Hoare triple {505#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {505#true} is VALID [2020-07-17 22:49:09,575 INFO L280 TraceCheckUtils]: 8: Hoare triple {505#true} ~cond := #in~cond; {505#true} is VALID [2020-07-17 22:49:09,575 INFO L280 TraceCheckUtils]: 9: Hoare triple {505#true} assume !(0 == ~cond); {505#true} is VALID [2020-07-17 22:49:09,575 INFO L280 TraceCheckUtils]: 10: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-17 22:49:09,576 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {505#true} {505#true} #87#return; {505#true} is VALID [2020-07-17 22:49:09,576 INFO L280 TraceCheckUtils]: 12: Hoare triple {505#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {505#true} is VALID [2020-07-17 22:49:09,576 INFO L280 TraceCheckUtils]: 13: Hoare triple {505#true} assume !!(~i~0 < ~N~0); {505#true} is VALID [2020-07-17 22:49:09,577 INFO L280 TraceCheckUtils]: 14: Hoare triple {505#true} assume 0 == ~i~0;call write~int(6, ~a~0.base, ~a~0.offset, 8); {505#true} is VALID [2020-07-17 22:49:09,577 INFO L280 TraceCheckUtils]: 15: Hoare triple {505#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {505#true} is VALID [2020-07-17 22:49:09,577 INFO L280 TraceCheckUtils]: 16: Hoare triple {505#true} assume !(~i~0 < ~N~0); {505#true} is VALID [2020-07-17 22:49:09,577 INFO L280 TraceCheckUtils]: 17: Hoare triple {505#true} ~i~0 := 0; {505#true} is VALID [2020-07-17 22:49:09,578 INFO L280 TraceCheckUtils]: 18: Hoare triple {505#true} assume !!(~i~0 < ~N~0); {505#true} is VALID [2020-07-17 22:49:09,580 INFO L280 TraceCheckUtils]: 19: Hoare triple {505#true} assume 0 == ~i~0;call write~int(1, ~b~0.base, ~b~0.offset, 8); {567#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} is VALID [2020-07-17 22:49:09,582 INFO L280 TraceCheckUtils]: 20: Hoare triple {567#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {567#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} is VALID [2020-07-17 22:49:09,584 INFO L280 TraceCheckUtils]: 21: Hoare triple {567#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} assume !(~i~0 < ~N~0); {567#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} is VALID [2020-07-17 22:49:09,585 INFO L280 TraceCheckUtils]: 22: Hoare triple {567#(= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1)} ~i~0 := 0; {577#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0))} is VALID [2020-07-17 22:49:09,586 INFO L280 TraceCheckUtils]: 23: Hoare triple {577#(and (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {581#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} is VALID [2020-07-17 22:49:09,587 INFO L263 TraceCheckUtils]: 24: Hoare triple {581#(and (= 0 main_~i~0) (= 1 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 == 1 + (3 * ~i~0 * ~i~0 + 3 * ~i~0) then 1 else 0)); {585#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:49:09,588 INFO L280 TraceCheckUtils]: 25: Hoare triple {585#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {589#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:49:09,589 INFO L280 TraceCheckUtils]: 26: Hoare triple {589#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {506#false} is VALID [2020-07-17 22:49:09,590 INFO L280 TraceCheckUtils]: 27: Hoare triple {506#false} assume !false; {506#false} is VALID [2020-07-17 22:49:09,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:49:09,592 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687123339] [2020-07-17 22:49:09,592 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:09,592 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [714686811] [2020-07-17 22:49:09,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:09,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:49:09,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004993227] [2020-07-17 22:49:09,594 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-17 22:49:09,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:09,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:49:09,636 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:09,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:49:09,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:09,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:49:09,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:49:09,637 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2020-07-17 22:49:10,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:10,154 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-07-17 22:49:10,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:49:10,155 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-17 22:49:10,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:49:10,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2020-07-17 22:49:10,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:49:10,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2020-07-17 22:49:10,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 57 transitions. [2020-07-17 22:49:10,279 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:10,284 INFO L225 Difference]: With dead ends: 52 [2020-07-17 22:49:10,284 INFO L226 Difference]: Without dead ends: 50 [2020-07-17 22:49:10,285 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:49:10,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-17 22:49:10,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2020-07-17 22:49:10,337 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:10,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 43 states. [2020-07-17 22:49:10,337 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 43 states. [2020-07-17 22:49:10,338 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 43 states. [2020-07-17 22:49:10,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:10,342 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-07-17 22:49:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2020-07-17 22:49:10,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:10,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:10,343 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 50 states. [2020-07-17 22:49:10,343 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 50 states. [2020-07-17 22:49:10,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:10,347 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-07-17 22:49:10,347 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2020-07-17 22:49:10,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:10,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:10,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:10,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:10,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-17 22:49:10,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2020-07-17 22:49:10,352 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 28 [2020-07-17 22:49:10,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:10,352 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2020-07-17 22:49:10,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:49:10,353 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-17 22:49:10,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:49:10,354 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:10,354 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:10,562 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:10,564 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:10,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:10,564 INFO L82 PathProgramCache]: Analyzing trace with hash -797560546, now seen corresponding path program 1 times [2020-07-17 22:49:10,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:10,565 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114438562] [2020-07-17 22:49:10,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:10,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:10,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:10,658 INFO L280 TraceCheckUtils]: 0: Hoare triple {840#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {830#true} is VALID [2020-07-17 22:49:10,658 INFO L280 TraceCheckUtils]: 1: Hoare triple {830#true} assume true; {830#true} is VALID [2020-07-17 22:49:10,659 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {830#true} {830#true} #91#return; {830#true} is VALID [2020-07-17 22:49:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:10,665 INFO L280 TraceCheckUtils]: 0: Hoare triple {830#true} ~cond := #in~cond; {830#true} is VALID [2020-07-17 22:49:10,665 INFO L280 TraceCheckUtils]: 1: Hoare triple {830#true} assume !(0 == ~cond); {830#true} is VALID [2020-07-17 22:49:10,666 INFO L280 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2020-07-17 22:49:10,666 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #87#return; {830#true} is VALID [2020-07-17 22:49:10,667 INFO L263 TraceCheckUtils]: 0: Hoare triple {830#true} call ULTIMATE.init(); {840#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-17 22:49:10,668 INFO L280 TraceCheckUtils]: 1: Hoare triple {840#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {830#true} is VALID [2020-07-17 22:49:10,668 INFO L280 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2020-07-17 22:49:10,669 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #91#return; {830#true} is VALID [2020-07-17 22:49:10,669 INFO L263 TraceCheckUtils]: 4: Hoare triple {830#true} call #t~ret10 := main(); {830#true} is VALID [2020-07-17 22:49:10,669 INFO L280 TraceCheckUtils]: 5: Hoare triple {830#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {830#true} is VALID [2020-07-17 22:49:10,669 INFO L280 TraceCheckUtils]: 6: Hoare triple {830#true} assume !(~N~0 <= 0); {830#true} is VALID [2020-07-17 22:49:10,670 INFO L263 TraceCheckUtils]: 7: Hoare triple {830#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {830#true} is VALID [2020-07-17 22:49:10,670 INFO L280 TraceCheckUtils]: 8: Hoare triple {830#true} ~cond := #in~cond; {830#true} is VALID [2020-07-17 22:49:10,670 INFO L280 TraceCheckUtils]: 9: Hoare triple {830#true} assume !(0 == ~cond); {830#true} is VALID [2020-07-17 22:49:10,671 INFO L280 TraceCheckUtils]: 10: Hoare triple {830#true} assume true; {830#true} is VALID [2020-07-17 22:49:10,671 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {830#true} {830#true} #87#return; {830#true} is VALID [2020-07-17 22:49:10,671 INFO L280 TraceCheckUtils]: 12: Hoare triple {830#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {830#true} is VALID [2020-07-17 22:49:10,672 INFO L280 TraceCheckUtils]: 13: Hoare triple {830#true} assume !!(~i~0 < ~N~0); {830#true} is VALID [2020-07-17 22:49:10,672 INFO L280 TraceCheckUtils]: 14: Hoare triple {830#true} assume 0 == ~i~0;call write~int(6, ~a~0.base, ~a~0.offset, 8); {830#true} is VALID [2020-07-17 22:49:10,672 INFO L280 TraceCheckUtils]: 15: Hoare triple {830#true} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {830#true} is VALID [2020-07-17 22:49:10,672 INFO L280 TraceCheckUtils]: 16: Hoare triple {830#true} assume !(~i~0 < ~N~0); {830#true} is VALID [2020-07-17 22:49:10,673 INFO L280 TraceCheckUtils]: 17: Hoare triple {830#true} ~i~0 := 0; {839#(= 0 main_~i~0)} is VALID [2020-07-17 22:49:10,674 INFO L280 TraceCheckUtils]: 18: Hoare triple {839#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0); {839#(= 0 main_~i~0)} is VALID [2020-07-17 22:49:10,675 INFO L280 TraceCheckUtils]: 19: Hoare triple {839#(= 0 main_~i~0)} assume !(0 == ~i~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {831#false} is VALID [2020-07-17 22:49:10,675 INFO L280 TraceCheckUtils]: 20: Hoare triple {831#false} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {831#false} is VALID [2020-07-17 22:49:10,676 INFO L280 TraceCheckUtils]: 21: Hoare triple {831#false} assume !(~i~0 < ~N~0); {831#false} is VALID [2020-07-17 22:49:10,676 INFO L280 TraceCheckUtils]: 22: Hoare triple {831#false} ~i~0 := 0; {831#false} is VALID [2020-07-17 22:49:10,676 INFO L280 TraceCheckUtils]: 23: Hoare triple {831#false} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {831#false} is VALID [2020-07-17 22:49:10,677 INFO L263 TraceCheckUtils]: 24: Hoare triple {831#false} call __VERIFIER_assert((if #t~mem9 == 1 + (3 * ~i~0 * ~i~0 + 3 * ~i~0) then 1 else 0)); {831#false} is VALID [2020-07-17 22:49:10,677 INFO L280 TraceCheckUtils]: 25: Hoare triple {831#false} ~cond := #in~cond; {831#false} is VALID [2020-07-17 22:49:10,677 INFO L280 TraceCheckUtils]: 26: Hoare triple {831#false} assume 0 == ~cond; {831#false} is VALID [2020-07-17 22:49:10,677 INFO L280 TraceCheckUtils]: 27: Hoare triple {831#false} assume !false; {831#false} is VALID [2020-07-17 22:49:10,679 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:49:10,679 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114438562] [2020-07-17 22:49:10,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:49:10,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-17 22:49:10,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996161246] [2020-07-17 22:49:10,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-07-17 22:49:10,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:10,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-17 22:49:10,715 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:10,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-17 22:49:10,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:10,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-17 22:49:10,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:49:10,716 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 4 states. [2020-07-17 22:49:11,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:11,032 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2020-07-17 22:49:11,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-17 22:49:11,032 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-07-17 22:49:11,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:11,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:49:11,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2020-07-17 22:49:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-17 22:49:11,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2020-07-17 22:49:11,044 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2020-07-17 22:49:11,135 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:11,138 INFO L225 Difference]: With dead ends: 74 [2020-07-17 22:49:11,138 INFO L226 Difference]: Without dead ends: 45 [2020-07-17 22:49:11,139 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-17 22:49:11,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-17 22:49:11,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2020-07-17 22:49:11,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:11,183 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 41 states. [2020-07-17 22:49:11,183 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 41 states. [2020-07-17 22:49:11,183 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 41 states. [2020-07-17 22:49:11,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:11,187 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2020-07-17 22:49:11,187 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-17 22:49:11,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:11,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:11,188 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 45 states. [2020-07-17 22:49:11,188 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 45 states. [2020-07-17 22:49:11,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:11,191 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2020-07-17 22:49:11,191 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-17 22:49:11,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:11,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:11,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:11,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-17 22:49:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-07-17 22:49:11,195 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 28 [2020-07-17 22:49:11,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:11,195 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-07-17 22:49:11,196 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-17 22:49:11,196 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-07-17 22:49:11,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-17 22:49:11,197 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:11,197 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:11,198 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-17 22:49:11,198 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:11,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:11,198 INFO L82 PathProgramCache]: Analyzing trace with hash -622618382, now seen corresponding path program 1 times [2020-07-17 22:49:11,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:11,199 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724723055] [2020-07-17 22:49:11,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:11,231 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:11,233 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [106099073] [2020-07-17 22:49:11,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-17 22:49:11,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:11,287 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:49:11,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:11,298 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:11,439 INFO L263 TraceCheckUtils]: 0: Hoare triple {1090#true} call ULTIMATE.init(); {1090#true} is VALID [2020-07-17 22:49:11,440 INFO L280 TraceCheckUtils]: 1: Hoare triple {1090#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1090#true} is VALID [2020-07-17 22:49:11,440 INFO L280 TraceCheckUtils]: 2: Hoare triple {1090#true} assume true; {1090#true} is VALID [2020-07-17 22:49:11,441 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1090#true} {1090#true} #91#return; {1090#true} is VALID [2020-07-17 22:49:11,441 INFO L263 TraceCheckUtils]: 4: Hoare triple {1090#true} call #t~ret10 := main(); {1090#true} is VALID [2020-07-17 22:49:11,441 INFO L280 TraceCheckUtils]: 5: Hoare triple {1090#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {1090#true} is VALID [2020-07-17 22:49:11,442 INFO L280 TraceCheckUtils]: 6: Hoare triple {1090#true} assume !(~N~0 <= 0); {1090#true} is VALID [2020-07-17 22:49:11,442 INFO L263 TraceCheckUtils]: 7: Hoare triple {1090#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1090#true} is VALID [2020-07-17 22:49:11,442 INFO L280 TraceCheckUtils]: 8: Hoare triple {1090#true} ~cond := #in~cond; {1090#true} is VALID [2020-07-17 22:49:11,442 INFO L280 TraceCheckUtils]: 9: Hoare triple {1090#true} assume !(0 == ~cond); {1090#true} is VALID [2020-07-17 22:49:11,443 INFO L280 TraceCheckUtils]: 10: Hoare triple {1090#true} assume true; {1090#true} is VALID [2020-07-17 22:49:11,443 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1090#true} {1090#true} #87#return; {1090#true} is VALID [2020-07-17 22:49:11,445 INFO L280 TraceCheckUtils]: 12: Hoare triple {1090#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1131#(<= main_~i~0 0)} is VALID [2020-07-17 22:49:11,463 INFO L280 TraceCheckUtils]: 13: Hoare triple {1131#(<= main_~i~0 0)} assume !!(~i~0 < ~N~0); {1131#(<= main_~i~0 0)} is VALID [2020-07-17 22:49:11,470 INFO L280 TraceCheckUtils]: 14: Hoare triple {1131#(<= main_~i~0 0)} assume 0 == ~i~0;call write~int(6, ~a~0.base, ~a~0.offset, 8); {1131#(<= main_~i~0 0)} is VALID [2020-07-17 22:49:11,471 INFO L280 TraceCheckUtils]: 15: Hoare triple {1131#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1141#(<= main_~i~0 1)} is VALID [2020-07-17 22:49:11,472 INFO L280 TraceCheckUtils]: 16: Hoare triple {1141#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,473 INFO L280 TraceCheckUtils]: 17: Hoare triple {1145#(<= ~N~0 1)} ~i~0 := 0; {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,474 INFO L280 TraceCheckUtils]: 18: Hoare triple {1145#(<= ~N~0 1)} assume !!(~i~0 < ~N~0); {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,474 INFO L280 TraceCheckUtils]: 19: Hoare triple {1145#(<= ~N~0 1)} assume 0 == ~i~0;call write~int(1, ~b~0.base, ~b~0.offset, 8); {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,475 INFO L280 TraceCheckUtils]: 20: Hoare triple {1145#(<= ~N~0 1)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,475 INFO L280 TraceCheckUtils]: 21: Hoare triple {1145#(<= ~N~0 1)} assume !(~i~0 < ~N~0); {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,476 INFO L280 TraceCheckUtils]: 22: Hoare triple {1145#(<= ~N~0 1)} ~i~0 := 0; {1164#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-17 22:49:11,477 INFO L280 TraceCheckUtils]: 23: Hoare triple {1164#(and (<= 0 main_~i~0) (<= ~N~0 1))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {1164#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-17 22:49:11,478 INFO L263 TraceCheckUtils]: 24: Hoare triple {1164#(and (<= 0 main_~i~0) (<= ~N~0 1))} call __VERIFIER_assert((if #t~mem9 == 1 + (3 * ~i~0 * ~i~0 + 3 * ~i~0) then 1 else 0)); {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,478 INFO L280 TraceCheckUtils]: 25: Hoare triple {1145#(<= ~N~0 1)} ~cond := #in~cond; {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,479 INFO L280 TraceCheckUtils]: 26: Hoare triple {1145#(<= ~N~0 1)} assume !(0 == ~cond); {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,480 INFO L280 TraceCheckUtils]: 27: Hoare triple {1145#(<= ~N~0 1)} assume true; {1145#(<= ~N~0 1)} is VALID [2020-07-17 22:49:11,481 INFO L275 TraceCheckUtils]: 28: Hoare quadruple {1145#(<= ~N~0 1)} {1164#(and (<= 0 main_~i~0) (<= ~N~0 1))} #89#return; {1164#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-17 22:49:11,482 INFO L280 TraceCheckUtils]: 29: Hoare triple {1164#(and (<= 0 main_~i~0) (<= ~N~0 1))} havoc #t~mem9; {1164#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-17 22:49:11,483 INFO L280 TraceCheckUtils]: 30: Hoare triple {1164#(and (<= 0 main_~i~0) (<= ~N~0 1))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1189#(and (<= ~N~0 1) (<= 1 main_~i~0))} is VALID [2020-07-17 22:49:11,484 INFO L280 TraceCheckUtils]: 31: Hoare triple {1189#(and (<= ~N~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {1091#false} is VALID [2020-07-17 22:49:11,484 INFO L263 TraceCheckUtils]: 32: Hoare triple {1091#false} call __VERIFIER_assert((if #t~mem9 == 1 + (3 * ~i~0 * ~i~0 + 3 * ~i~0) then 1 else 0)); {1091#false} is VALID [2020-07-17 22:49:11,484 INFO L280 TraceCheckUtils]: 33: Hoare triple {1091#false} ~cond := #in~cond; {1091#false} is VALID [2020-07-17 22:49:11,485 INFO L280 TraceCheckUtils]: 34: Hoare triple {1091#false} assume 0 == ~cond; {1091#false} is VALID [2020-07-17 22:49:11,485 INFO L280 TraceCheckUtils]: 35: Hoare triple {1091#false} assume !false; {1091#false} is VALID [2020-07-17 22:49:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:49:11,487 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724723055] [2020-07-17 22:49:11,487 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:11,488 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106099073] [2020-07-17 22:49:11,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:49:11,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 22:49:11,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200651271] [2020-07-17 22:49:11,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-17 22:49:11,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:11,492 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:49:11,539 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:11,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:49:11,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:11,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:49:11,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:49:11,541 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2020-07-17 22:49:12,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:12,018 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2020-07-17 22:49:12,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:49:12,018 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-17 22:49:12,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:12,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:49:12,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2020-07-17 22:49:12,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:49:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2020-07-17 22:49:12,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2020-07-17 22:49:12,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:12,153 INFO L225 Difference]: With dead ends: 91 [2020-07-17 22:49:12,154 INFO L226 Difference]: Without dead ends: 55 [2020-07-17 22:49:12,155 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:49:12,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-17 22:49:12,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2020-07-17 22:49:12,200 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:12,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 45 states. [2020-07-17 22:49:12,200 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 45 states. [2020-07-17 22:49:12,200 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 45 states. [2020-07-17 22:49:12,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:12,205 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2020-07-17 22:49:12,205 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2020-07-17 22:49:12,206 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:12,206 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:12,206 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 55 states. [2020-07-17 22:49:12,206 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 55 states. [2020-07-17 22:49:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:12,210 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2020-07-17 22:49:12,210 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2020-07-17 22:49:12,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:12,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:12,211 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:12,211 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:12,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-17 22:49:12,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-07-17 22:49:12,213 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 36 [2020-07-17 22:49:12,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:12,214 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-07-17 22:49:12,214 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:49:12,214 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-17 22:49:12,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-17 22:49:12,215 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:12,216 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:12,430 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:12,431 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:12,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:12,432 INFO L82 PathProgramCache]: Analyzing trace with hash 60389999, now seen corresponding path program 1 times [2020-07-17 22:49:12,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:12,433 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762799856] [2020-07-17 22:49:12,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:12,466 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:12,469 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [910290803] [2020-07-17 22:49:12,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-17 22:49:12,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:12,517 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 29 conjunts are in the unsatisfiable core [2020-07-17 22:49:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:12,543 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:12,592 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-07-17 22:49:12,593 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:12,600 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:12,601 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:12,601 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2020-07-17 22:49:12,637 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-17 22:49:12,638 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:12,648 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:12,648 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:12,649 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-07-17 22:49:12,723 INFO L350 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2020-07-17 22:49:12,724 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2020-07-17 22:49:12,727 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:12,737 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:12,737 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:12,737 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2020-07-17 22:49:12,830 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-17 22:49:12,830 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 32 [2020-07-17 22:49:12,834 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:12,846 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:12,847 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:12,847 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2020-07-17 22:49:12,968 INFO L350 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2020-07-17 22:49:12,969 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 53 treesize of output 46 [2020-07-17 22:49:12,978 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:12,993 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-17 22:49:12,997 INFO L544 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-17 22:49:12,997 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:53 [2020-07-17 22:49:15,982 INFO L350 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2020-07-17 22:49:15,983 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 46 [2020-07-17 22:49:15,988 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-17 22:49:16,004 INFO L624 ElimStorePlain]: treesize reduction 23, result has 32.4 percent of original size [2020-07-17 22:49:16,006 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-17 22:49:16,006 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:7 [2020-07-17 22:49:16,014 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-17 22:49:16,015 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~b~0.base, main_~b~0.offset, main_~a~0.base, main_~a~0.offset]. (let ((.cse0 (select |#memory_int| main_~a~0.base))) (let ((.cse1 (select .cse0 (+ main_~a~0.offset 8))) (.cse2 (select |#memory_int| main_~b~0.base))) (and (= (+ (select .cse0 main_~a~0.offset) 3) .cse1) (= (+ (select .cse2 (+ main_~b~0.offset 8)) 2) .cse1) (= 9 .cse1) (= (select .cse2 main_~b~0.offset) 1) (= 1 main_~i~0) (= (select .cse2 (+ main_~b~0.offset (* main_~i~0 8))) |main_#t~mem9|) (not (= main_~a~0.base main_~b~0.base))))) [2020-07-17 22:49:16,015 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 7 |main_#t~mem9|) (= 1 main_~i~0)) [2020-07-17 22:49:16,110 INFO L263 TraceCheckUtils]: 0: Hoare triple {1507#true} call ULTIMATE.init(); {1507#true} is VALID [2020-07-17 22:49:16,111 INFO L280 TraceCheckUtils]: 1: Hoare triple {1507#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1507#true} is VALID [2020-07-17 22:49:16,111 INFO L280 TraceCheckUtils]: 2: Hoare triple {1507#true} assume true; {1507#true} is VALID [2020-07-17 22:49:16,111 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1507#true} {1507#true} #91#return; {1507#true} is VALID [2020-07-17 22:49:16,111 INFO L263 TraceCheckUtils]: 4: Hoare triple {1507#true} call #t~ret10 := main(); {1507#true} is VALID [2020-07-17 22:49:16,112 INFO L280 TraceCheckUtils]: 5: Hoare triple {1507#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {1507#true} is VALID [2020-07-17 22:49:16,112 INFO L280 TraceCheckUtils]: 6: Hoare triple {1507#true} assume !(~N~0 <= 0); {1507#true} is VALID [2020-07-17 22:49:16,112 INFO L263 TraceCheckUtils]: 7: Hoare triple {1507#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1507#true} is VALID [2020-07-17 22:49:16,112 INFO L280 TraceCheckUtils]: 8: Hoare triple {1507#true} ~cond := #in~cond; {1507#true} is VALID [2020-07-17 22:49:16,112 INFO L280 TraceCheckUtils]: 9: Hoare triple {1507#true} assume !(0 == ~cond); {1507#true} is VALID [2020-07-17 22:49:16,113 INFO L280 TraceCheckUtils]: 10: Hoare triple {1507#true} assume true; {1507#true} is VALID [2020-07-17 22:49:16,113 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1507#true} {1507#true} #87#return; {1507#true} is VALID [2020-07-17 22:49:16,114 INFO L280 TraceCheckUtils]: 12: Hoare triple {1507#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {1548#(and (= 0 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,115 INFO L280 TraceCheckUtils]: 13: Hoare triple {1548#(and (= 0 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} assume !!(~i~0 < ~N~0); {1548#(and (= 0 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,116 INFO L280 TraceCheckUtils]: 14: Hoare triple {1548#(and (= 0 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} assume 0 == ~i~0;call write~int(6, ~a~0.base, ~a~0.offset, 8); {1555#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,117 INFO L280 TraceCheckUtils]: 15: Hoare triple {1555#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 0 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1559#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,117 INFO L280 TraceCheckUtils]: 16: Hoare triple {1559#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} assume !!(~i~0 < ~N~0); {1559#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,119 INFO L280 TraceCheckUtils]: 17: Hoare triple {1559#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= 1 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} assume !(0 == ~i~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(3 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {1566#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,120 INFO L280 TraceCheckUtils]: 18: Hoare triple {1566#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1566#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,121 INFO L280 TraceCheckUtils]: 19: Hoare triple {1566#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))} assume !(~i~0 < ~N~0); {1566#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,121 INFO L280 TraceCheckUtils]: 20: Hoare triple {1566#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))} ~i~0 := 0; {1576#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 0 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,122 INFO L280 TraceCheckUtils]: 21: Hoare triple {1576#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 0 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} assume !!(~i~0 < ~N~0); {1576#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 0 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,124 INFO L280 TraceCheckUtils]: 22: Hoare triple {1576#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 0 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} assume 0 == ~i~0;call write~int(1, ~b~0.base, ~b~0.offset, 8); {1583#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,125 INFO L280 TraceCheckUtils]: 23: Hoare triple {1583#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1587#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,126 INFO L280 TraceCheckUtils]: 24: Hoare triple {1587#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} assume !!(~i~0 < ~N~0); {1587#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} is VALID [2020-07-17 22:49:16,130 INFO L280 TraceCheckUtils]: 25: Hoare triple {1587#(and (= 6 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)) (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0) (not (= main_~a~0.base main_~b~0.base)))} assume !(0 == ~i~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {1594#(and (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) 2) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1))} is VALID [2020-07-17 22:49:16,132 INFO L280 TraceCheckUtils]: 26: Hoare triple {1594#(and (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) 2) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1))} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {1594#(and (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) 2) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1))} is VALID [2020-07-17 22:49:16,133 INFO L280 TraceCheckUtils]: 27: Hoare triple {1594#(and (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) 2) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1))} assume !(~i~0 < ~N~0); {1594#(and (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) 2) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1))} is VALID [2020-07-17 22:49:16,134 INFO L280 TraceCheckUtils]: 28: Hoare triple {1594#(and (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) 2) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1))} ~i~0 := 0; {1604#(and (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) 2) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0))} is VALID [2020-07-17 22:49:16,136 INFO L280 TraceCheckUtils]: 29: Hoare triple {1604#(and (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) 2) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {1604#(and (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) 2) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0))} is VALID [2020-07-17 22:49:16,145 INFO L263 TraceCheckUtils]: 30: Hoare triple {1604#(and (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) 2) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0))} call __VERIFIER_assert((if #t~mem9 == 1 + (3 * ~i~0 * ~i~0 + 3 * ~i~0) then 1 else 0)); {1611#(exists ((v_main_~b~0.offset_BEFORE_CALL_1 Int) (v_main_~b~0.base_BEFORE_CALL_1 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8)) (+ (select (select |#memory_int| v_main_~b~0.base_BEFORE_CALL_1) (+ v_main_~b~0.offset_BEFORE_CALL_1 8)) 2)) (not (= main_~a~0.base v_main_~b~0.base_BEFORE_CALL_1)) (= 1 (select (select |#memory_int| v_main_~b~0.base_BEFORE_CALL_1) v_main_~b~0.offset_BEFORE_CALL_1))))} is VALID [2020-07-17 22:49:16,146 INFO L280 TraceCheckUtils]: 31: Hoare triple {1611#(exists ((v_main_~b~0.offset_BEFORE_CALL_1 Int) (v_main_~b~0.base_BEFORE_CALL_1 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8)) (+ (select (select |#memory_int| v_main_~b~0.base_BEFORE_CALL_1) (+ v_main_~b~0.offset_BEFORE_CALL_1 8)) 2)) (not (= main_~a~0.base v_main_~b~0.base_BEFORE_CALL_1)) (= 1 (select (select |#memory_int| v_main_~b~0.base_BEFORE_CALL_1) v_main_~b~0.offset_BEFORE_CALL_1))))} ~cond := #in~cond; {1611#(exists ((v_main_~b~0.offset_BEFORE_CALL_1 Int) (v_main_~b~0.base_BEFORE_CALL_1 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8)) (+ (select (select |#memory_int| v_main_~b~0.base_BEFORE_CALL_1) (+ v_main_~b~0.offset_BEFORE_CALL_1 8)) 2)) (not (= main_~a~0.base v_main_~b~0.base_BEFORE_CALL_1)) (= 1 (select (select |#memory_int| v_main_~b~0.base_BEFORE_CALL_1) v_main_~b~0.offset_BEFORE_CALL_1))))} is VALID [2020-07-17 22:49:16,146 INFO L280 TraceCheckUtils]: 32: Hoare triple {1611#(exists ((v_main_~b~0.offset_BEFORE_CALL_1 Int) (v_main_~b~0.base_BEFORE_CALL_1 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8)) (+ (select (select |#memory_int| v_main_~b~0.base_BEFORE_CALL_1) (+ v_main_~b~0.offset_BEFORE_CALL_1 8)) 2)) (not (= main_~a~0.base v_main_~b~0.base_BEFORE_CALL_1)) (= 1 (select (select |#memory_int| v_main_~b~0.base_BEFORE_CALL_1) v_main_~b~0.offset_BEFORE_CALL_1))))} assume !(0 == ~cond); {1611#(exists ((v_main_~b~0.offset_BEFORE_CALL_1 Int) (v_main_~b~0.base_BEFORE_CALL_1 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8)) (+ (select (select |#memory_int| v_main_~b~0.base_BEFORE_CALL_1) (+ v_main_~b~0.offset_BEFORE_CALL_1 8)) 2)) (not (= main_~a~0.base v_main_~b~0.base_BEFORE_CALL_1)) (= 1 (select (select |#memory_int| v_main_~b~0.base_BEFORE_CALL_1) v_main_~b~0.offset_BEFORE_CALL_1))))} is VALID [2020-07-17 22:49:16,147 INFO L280 TraceCheckUtils]: 33: Hoare triple {1611#(exists ((v_main_~b~0.offset_BEFORE_CALL_1 Int) (v_main_~b~0.base_BEFORE_CALL_1 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8)) (+ (select (select |#memory_int| v_main_~b~0.base_BEFORE_CALL_1) (+ v_main_~b~0.offset_BEFORE_CALL_1 8)) 2)) (not (= main_~a~0.base v_main_~b~0.base_BEFORE_CALL_1)) (= 1 (select (select |#memory_int| v_main_~b~0.base_BEFORE_CALL_1) v_main_~b~0.offset_BEFORE_CALL_1))))} assume true; {1611#(exists ((v_main_~b~0.offset_BEFORE_CALL_1 Int) (v_main_~b~0.base_BEFORE_CALL_1 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8)) (+ (select (select |#memory_int| v_main_~b~0.base_BEFORE_CALL_1) (+ v_main_~b~0.offset_BEFORE_CALL_1 8)) 2)) (not (= main_~a~0.base v_main_~b~0.base_BEFORE_CALL_1)) (= 1 (select (select |#memory_int| v_main_~b~0.base_BEFORE_CALL_1) v_main_~b~0.offset_BEFORE_CALL_1))))} is VALID [2020-07-17 22:49:16,148 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {1611#(exists ((v_main_~b~0.offset_BEFORE_CALL_1 Int) (v_main_~b~0.base_BEFORE_CALL_1 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8)) (+ (select (select |#memory_int| v_main_~b~0.base_BEFORE_CALL_1) (+ v_main_~b~0.offset_BEFORE_CALL_1 8)) 2)) (not (= main_~a~0.base v_main_~b~0.base_BEFORE_CALL_1)) (= 1 (select (select |#memory_int| v_main_~b~0.base_BEFORE_CALL_1) v_main_~b~0.offset_BEFORE_CALL_1))))} {1604#(and (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) 2) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0))} #89#return; {1604#(and (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) 2) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0))} is VALID [2020-07-17 22:49:16,149 INFO L280 TraceCheckUtils]: 35: Hoare triple {1604#(and (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) 2) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0))} havoc #t~mem9; {1604#(and (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) 2) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0))} is VALID [2020-07-17 22:49:16,150 INFO L280 TraceCheckUtils]: 36: Hoare triple {1604#(and (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) 2) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 0 main_~i~0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {1630#(and (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) 2) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0))} is VALID [2020-07-17 22:49:16,153 INFO L280 TraceCheckUtils]: 37: Hoare triple {1630#(and (exists ((main_~a~0.offset Int) (main_~a~0.base Int)) (and (= (+ (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= (+ (select (select |#memory_int| main_~b~0.base) (+ main_~b~0.offset 8)) 2) (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (= 9 (select (select |#memory_int| main_~a~0.base) (+ main_~a~0.offset 8))) (not (= main_~a~0.base main_~b~0.base)))) (= (select (select |#memory_int| main_~b~0.base) main_~b~0.offset) 1) (= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {1634#(and (= 7 |main_#t~mem9|) (= 1 main_~i~0))} is VALID [2020-07-17 22:49:16,154 INFO L263 TraceCheckUtils]: 38: Hoare triple {1634#(and (= 7 |main_#t~mem9|) (= 1 main_~i~0))} call __VERIFIER_assert((if #t~mem9 == 1 + (3 * ~i~0 * ~i~0 + 3 * ~i~0) then 1 else 0)); {1638#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:49:16,155 INFO L280 TraceCheckUtils]: 39: Hoare triple {1638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:49:16,155 INFO L280 TraceCheckUtils]: 40: Hoare triple {1642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1508#false} is VALID [2020-07-17 22:49:16,156 INFO L280 TraceCheckUtils]: 41: Hoare triple {1508#false} assume !false; {1508#false} is VALID [2020-07-17 22:49:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:49:16,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762799856] [2020-07-17 22:49:16,166 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:16,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [910290803] [2020-07-17 22:49:16,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:49:16,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-17 22:49:16,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656836790] [2020-07-17 22:49:16,167 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2020-07-17 22:49:16,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:16,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-17 22:49:16,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:16,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 22:49:16,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:16,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 22:49:16,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:49:16,314 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 16 states. [2020-07-17 22:49:44,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:44,723 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2020-07-17 22:49:44,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-17 22:49:44,723 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2020-07-17 22:49:44,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:44,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:49:44,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 93 transitions. [2020-07-17 22:49:44,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:49:44,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 93 transitions. [2020-07-17 22:49:44,729 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 93 transitions. [2020-07-17 22:49:45,333 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:45,336 INFO L225 Difference]: With dead ends: 95 [2020-07-17 22:49:45,336 INFO L226 Difference]: Without dead ends: 65 [2020-07-17 22:49:45,337 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=97, Invalid=409, Unknown=0, NotChecked=0, Total=506 [2020-07-17 22:49:45,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-17 22:49:45,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2020-07-17 22:49:45,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:45,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 55 states. [2020-07-17 22:49:45,435 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 55 states. [2020-07-17 22:49:45,435 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 55 states. [2020-07-17 22:49:45,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:45,438 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-17 22:49:45,438 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-17 22:49:45,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:45,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:45,439 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 65 states. [2020-07-17 22:49:45,439 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 65 states. [2020-07-17 22:49:45,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:45,442 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-17 22:49:45,442 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-17 22:49:45,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:45,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:45,443 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:45,443 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:45,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-17 22:49:45,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2020-07-17 22:49:45,446 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 42 [2020-07-17 22:49:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:45,446 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-07-17 22:49:45,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 22:49:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-17 22:49:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-17 22:49:45,447 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:45,448 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:45,648 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:45,649 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:45,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:45,649 INFO L82 PathProgramCache]: Analyzing trace with hash 1235795269, now seen corresponding path program 2 times [2020-07-17 22:49:45,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:45,650 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513085970] [2020-07-17 22:49:45,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:45,690 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:45,690 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [396809390] [2020-07-17 22:49:45,691 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:45,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:49:45,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:49:45,733 INFO L264 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:49:45,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:49:45,749 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:49:45,971 INFO L263 TraceCheckUtils]: 0: Hoare triple {1998#true} call ULTIMATE.init(); {1998#true} is VALID [2020-07-17 22:49:45,972 INFO L280 TraceCheckUtils]: 1: Hoare triple {1998#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {1998#true} is VALID [2020-07-17 22:49:45,972 INFO L280 TraceCheckUtils]: 2: Hoare triple {1998#true} assume true; {1998#true} is VALID [2020-07-17 22:49:45,972 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1998#true} {1998#true} #91#return; {1998#true} is VALID [2020-07-17 22:49:45,972 INFO L263 TraceCheckUtils]: 4: Hoare triple {1998#true} call #t~ret10 := main(); {1998#true} is VALID [2020-07-17 22:49:45,973 INFO L280 TraceCheckUtils]: 5: Hoare triple {1998#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {1998#true} is VALID [2020-07-17 22:49:45,973 INFO L280 TraceCheckUtils]: 6: Hoare triple {1998#true} assume !(~N~0 <= 0); {1998#true} is VALID [2020-07-17 22:49:45,973 INFO L263 TraceCheckUtils]: 7: Hoare triple {1998#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {1998#true} is VALID [2020-07-17 22:49:45,973 INFO L280 TraceCheckUtils]: 8: Hoare triple {1998#true} ~cond := #in~cond; {1998#true} is VALID [2020-07-17 22:49:45,974 INFO L280 TraceCheckUtils]: 9: Hoare triple {1998#true} assume !(0 == ~cond); {1998#true} is VALID [2020-07-17 22:49:45,974 INFO L280 TraceCheckUtils]: 10: Hoare triple {1998#true} assume true; {1998#true} is VALID [2020-07-17 22:49:45,974 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1998#true} {1998#true} #87#return; {1998#true} is VALID [2020-07-17 22:49:45,978 INFO L280 TraceCheckUtils]: 12: Hoare triple {1998#true} havoc ~i~0;call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(8 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.allocOnHeap(8 * ~N~0);~b~0.base, ~b~0.offset := #t~malloc2.base, #t~malloc2.offset;~i~0 := 0; {2039#(<= main_~i~0 0)} is VALID [2020-07-17 22:49:45,979 INFO L280 TraceCheckUtils]: 13: Hoare triple {2039#(<= main_~i~0 0)} assume !!(~i~0 < ~N~0); {2039#(<= main_~i~0 0)} is VALID [2020-07-17 22:49:45,984 INFO L280 TraceCheckUtils]: 14: Hoare triple {2039#(<= main_~i~0 0)} assume 0 == ~i~0;call write~int(6, ~a~0.base, ~a~0.offset, 8); {2039#(<= main_~i~0 0)} is VALID [2020-07-17 22:49:45,986 INFO L280 TraceCheckUtils]: 15: Hoare triple {2039#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2049#(<= main_~i~0 1)} is VALID [2020-07-17 22:49:45,987 INFO L280 TraceCheckUtils]: 16: Hoare triple {2049#(<= main_~i~0 1)} assume !!(~i~0 < ~N~0); {2049#(<= main_~i~0 1)} is VALID [2020-07-17 22:49:45,987 INFO L280 TraceCheckUtils]: 17: Hoare triple {2049#(<= main_~i~0 1)} assume !(0 == ~i~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(3 + #t~mem4, ~a~0.base, ~a~0.offset + 8 * ~i~0, 8);havoc #t~mem4; {2049#(<= main_~i~0 1)} is VALID [2020-07-17 22:49:45,988 INFO L280 TraceCheckUtils]: 18: Hoare triple {2049#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2059#(<= main_~i~0 2)} is VALID [2020-07-17 22:49:45,989 INFO L280 TraceCheckUtils]: 19: Hoare triple {2059#(<= main_~i~0 2)} assume !(~i~0 < ~N~0); {2063#(<= ~N~0 2)} is VALID [2020-07-17 22:49:45,990 INFO L280 TraceCheckUtils]: 20: Hoare triple {2063#(<= ~N~0 2)} ~i~0 := 0; {2063#(<= ~N~0 2)} is VALID [2020-07-17 22:49:45,991 INFO L280 TraceCheckUtils]: 21: Hoare triple {2063#(<= ~N~0 2)} assume !!(~i~0 < ~N~0); {2063#(<= ~N~0 2)} is VALID [2020-07-17 22:49:45,992 INFO L280 TraceCheckUtils]: 22: Hoare triple {2063#(<= ~N~0 2)} assume 0 == ~i~0;call write~int(1, ~b~0.base, ~b~0.offset, 8); {2063#(<= ~N~0 2)} is VALID [2020-07-17 22:49:45,992 INFO L280 TraceCheckUtils]: 23: Hoare triple {2063#(<= ~N~0 2)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2063#(<= ~N~0 2)} is VALID [2020-07-17 22:49:45,993 INFO L280 TraceCheckUtils]: 24: Hoare triple {2063#(<= ~N~0 2)} assume !!(~i~0 < ~N~0); {2063#(<= ~N~0 2)} is VALID [2020-07-17 22:49:45,993 INFO L280 TraceCheckUtils]: 25: Hoare triple {2063#(<= ~N~0 2)} assume !(0 == ~i~0);call #t~mem6 := read~int(~b~0.base, ~b~0.offset + 8 * (~i~0 - 1), 8);call #t~mem7 := read~int(~a~0.base, ~a~0.offset + 8 * (~i~0 - 1), 8);call write~int(#t~mem6 + #t~mem7, ~b~0.base, ~b~0.offset + 8 * ~i~0, 8);havoc #t~mem7;havoc #t~mem6; {2063#(<= ~N~0 2)} is VALID [2020-07-17 22:49:45,994 INFO L280 TraceCheckUtils]: 26: Hoare triple {2063#(<= ~N~0 2)} #t~post5 := ~i~0;~i~0 := 1 + #t~post5;havoc #t~post5; {2063#(<= ~N~0 2)} is VALID [2020-07-17 22:49:45,994 INFO L280 TraceCheckUtils]: 27: Hoare triple {2063#(<= ~N~0 2)} assume !(~i~0 < ~N~0); {2063#(<= ~N~0 2)} is VALID [2020-07-17 22:49:45,995 INFO L280 TraceCheckUtils]: 28: Hoare triple {2063#(<= ~N~0 2)} ~i~0 := 0; {2091#(and (<= ~N~0 2) (<= 0 main_~i~0))} is VALID [2020-07-17 22:49:45,996 INFO L280 TraceCheckUtils]: 29: Hoare triple {2091#(and (<= ~N~0 2) (<= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {2091#(and (<= ~N~0 2) (<= 0 main_~i~0))} is VALID [2020-07-17 22:49:45,997 INFO L263 TraceCheckUtils]: 30: Hoare triple {2091#(and (<= ~N~0 2) (<= 0 main_~i~0))} call __VERIFIER_assert((if #t~mem9 == 1 + (3 * ~i~0 * ~i~0 + 3 * ~i~0) then 1 else 0)); {2063#(<= ~N~0 2)} is VALID [2020-07-17 22:49:45,998 INFO L280 TraceCheckUtils]: 31: Hoare triple {2063#(<= ~N~0 2)} ~cond := #in~cond; {2063#(<= ~N~0 2)} is VALID [2020-07-17 22:49:45,998 INFO L280 TraceCheckUtils]: 32: Hoare triple {2063#(<= ~N~0 2)} assume !(0 == ~cond); {2063#(<= ~N~0 2)} is VALID [2020-07-17 22:49:45,999 INFO L280 TraceCheckUtils]: 33: Hoare triple {2063#(<= ~N~0 2)} assume true; {2063#(<= ~N~0 2)} is VALID [2020-07-17 22:49:46,000 INFO L275 TraceCheckUtils]: 34: Hoare quadruple {2063#(<= ~N~0 2)} {2091#(and (<= ~N~0 2) (<= 0 main_~i~0))} #89#return; {2091#(and (<= ~N~0 2) (<= 0 main_~i~0))} is VALID [2020-07-17 22:49:46,000 INFO L280 TraceCheckUtils]: 35: Hoare triple {2091#(and (<= ~N~0 2) (<= 0 main_~i~0))} havoc #t~mem9; {2091#(and (<= ~N~0 2) (<= 0 main_~i~0))} is VALID [2020-07-17 22:49:46,002 INFO L280 TraceCheckUtils]: 36: Hoare triple {2091#(and (<= ~N~0 2) (<= 0 main_~i~0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2116#(and (<= ~N~0 2) (<= 1 main_~i~0))} is VALID [2020-07-17 22:49:46,003 INFO L280 TraceCheckUtils]: 37: Hoare triple {2116#(and (<= ~N~0 2) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {2116#(and (<= ~N~0 2) (<= 1 main_~i~0))} is VALID [2020-07-17 22:49:46,003 INFO L263 TraceCheckUtils]: 38: Hoare triple {2116#(and (<= ~N~0 2) (<= 1 main_~i~0))} call __VERIFIER_assert((if #t~mem9 == 1 + (3 * ~i~0 * ~i~0 + 3 * ~i~0) then 1 else 0)); {2063#(<= ~N~0 2)} is VALID [2020-07-17 22:49:46,004 INFO L280 TraceCheckUtils]: 39: Hoare triple {2063#(<= ~N~0 2)} ~cond := #in~cond; {2063#(<= ~N~0 2)} is VALID [2020-07-17 22:49:46,005 INFO L280 TraceCheckUtils]: 40: Hoare triple {2063#(<= ~N~0 2)} assume !(0 == ~cond); {2063#(<= ~N~0 2)} is VALID [2020-07-17 22:49:46,006 INFO L280 TraceCheckUtils]: 41: Hoare triple {2063#(<= ~N~0 2)} assume true; {2063#(<= ~N~0 2)} is VALID [2020-07-17 22:49:46,007 INFO L275 TraceCheckUtils]: 42: Hoare quadruple {2063#(<= ~N~0 2)} {2116#(and (<= ~N~0 2) (<= 1 main_~i~0))} #89#return; {2116#(and (<= ~N~0 2) (<= 1 main_~i~0))} is VALID [2020-07-17 22:49:46,008 INFO L280 TraceCheckUtils]: 43: Hoare triple {2116#(and (<= ~N~0 2) (<= 1 main_~i~0))} havoc #t~mem9; {2116#(and (<= ~N~0 2) (<= 1 main_~i~0))} is VALID [2020-07-17 22:49:46,009 INFO L280 TraceCheckUtils]: 44: Hoare triple {2116#(and (<= ~N~0 2) (<= 1 main_~i~0))} #t~post8 := ~i~0;~i~0 := 1 + #t~post8;havoc #t~post8; {2141#(and (<= ~N~0 2) (<= 2 main_~i~0))} is VALID [2020-07-17 22:49:46,010 INFO L280 TraceCheckUtils]: 45: Hoare triple {2141#(and (<= ~N~0 2) (<= 2 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem9 := read~int(~b~0.base, ~b~0.offset + 8 * ~i~0, 8); {1999#false} is VALID [2020-07-17 22:49:46,010 INFO L263 TraceCheckUtils]: 46: Hoare triple {1999#false} call __VERIFIER_assert((if #t~mem9 == 1 + (3 * ~i~0 * ~i~0 + 3 * ~i~0) then 1 else 0)); {1999#false} is VALID [2020-07-17 22:49:46,011 INFO L280 TraceCheckUtils]: 47: Hoare triple {1999#false} ~cond := #in~cond; {1999#false} is VALID [2020-07-17 22:49:46,011 INFO L280 TraceCheckUtils]: 48: Hoare triple {1999#false} assume 0 == ~cond; {1999#false} is VALID [2020-07-17 22:49:46,011 INFO L280 TraceCheckUtils]: 49: Hoare triple {1999#false} assume !false; {1999#false} is VALID [2020-07-17 22:49:46,014 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-07-17 22:49:46,015 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513085970] [2020-07-17 22:49:46,015 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:49:46,015 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396809390] [2020-07-17 22:49:46,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:49:46,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-17 22:49:46,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856350596] [2020-07-17 22:49:46,016 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2020-07-17 22:49:46,016 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:49:46,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:49:46,107 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:46,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:49:46,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:49:46,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:49:46,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:49:46,108 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 9 states. [2020-07-17 22:49:47,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:47,388 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2020-07-17 22:49:47,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:49:47,389 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2020-07-17 22:49:47,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:49:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:49:47,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2020-07-17 22:49:47,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:49:47,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2020-07-17 22:49:47,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 113 transitions. [2020-07-17 22:49:47,675 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:49:47,677 INFO L225 Difference]: With dead ends: 127 [2020-07-17 22:49:47,677 INFO L226 Difference]: Without dead ends: 69 [2020-07-17 22:49:47,679 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:49:47,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-17 22:49:47,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2020-07-17 22:49:47,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:49:47,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 59 states. [2020-07-17 22:49:47,821 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 59 states. [2020-07-17 22:49:47,821 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 59 states. [2020-07-17 22:49:47,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:47,825 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2020-07-17 22:49:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2020-07-17 22:49:47,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:47,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:47,826 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 69 states. [2020-07-17 22:49:47,826 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 69 states. [2020-07-17 22:49:47,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:49:47,829 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2020-07-17 22:49:47,829 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2020-07-17 22:49:47,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:49:47,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:49:47,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:49:47,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:49:47,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-17 22:49:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2020-07-17 22:49:47,832 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 50 [2020-07-17 22:49:47,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:49:47,832 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2020-07-17 22:49:47,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:49:47,833 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-07-17 22:49:47,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-17 22:49:47,833 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:49:47,834 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:49:48,047 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-17 22:49:48,048 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:49:48,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:49:48,049 INFO L82 PathProgramCache]: Analyzing trace with hash 1577312680, now seen corresponding path program 3 times [2020-07-17 22:49:48,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:49:48,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987159809] [2020-07-17 22:49:48,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:49:48,069 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:49:48,069 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1123585876] [2020-07-17 22:49:48,070 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:49,030 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-17 22:49:49,030 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-17 22:49:49,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:49:49,121 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:49:49,121 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:49:49,335 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:49:49,400 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-17 22:49:49,401 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:49,401 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:49:49,401 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:49:49,401 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:49:49,401 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:49:49,401 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:49:49,401 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:49,402 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:49:49,402 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:49,402 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-17 22:49:49,402 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:49,402 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-17 22:49:49,402 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:49,402 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:49:49,402 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:49:49,402 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:49:49,402 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-17 22:49:49,403 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:49:49,403 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:49,403 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-17 22:49:49,403 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:49,403 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:49:49,403 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:49:49,403 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-17 22:49:49,403 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:49:49,403 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-17 22:49:49,404 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:49:49,404 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-17 22:49:49,404 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-17 22:49:49,404 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-17 22:49:49,404 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-17 22:49:49,404 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2020-07-17 22:49:49,404 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-17 22:49:49,404 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-17 22:49:49,404 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-17 22:49:49,405 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-17 22:49:49,405 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-17 22:49:49,405 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-17 22:49:49,405 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-17 22:49:49,405 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-17 22:49:49,405 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-17 22:49:49,405 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-17 22:49:49,405 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-17 22:49:49,405 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-17 22:49:49,406 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-17 22:49:49,406 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2020-07-17 22:49:49,406 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-17 22:49:49,406 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-17 22:49:49,406 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-17 22:49:49,406 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:49:49,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:49:49 BoogieIcfgContainer [2020-07-17 22:49:49,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:49:49,412 INFO L168 Benchmark]: Toolchain (without parser) took 42963.87 ms. Allocated memory was 138.4 MB in the beginning and 323.0 MB in the end (delta: 184.5 MB). Free memory was 101.8 MB in the beginning and 167.6 MB in the end (delta: -65.7 MB). Peak memory consumption was 118.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:49,412 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2020-07-17 22:49:49,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.34 ms. Allocated memory is still 138.4 MB. Free memory was 101.4 MB in the beginning and 90.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:49,414 INFO L168 Benchmark]: Boogie Preprocessor took 140.57 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 90.4 MB in the beginning and 179.9 MB in the end (delta: -89.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:49,414 INFO L168 Benchmark]: RCFGBuilder took 477.72 ms. Allocated memory is still 202.4 MB. Free memory was 179.9 MB in the beginning and 154.6 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:49,415 INFO L168 Benchmark]: TraceAbstraction took 41991.85 ms. Allocated memory was 202.4 MB in the beginning and 323.0 MB in the end (delta: 120.6 MB). Free memory was 154.0 MB in the beginning and 167.6 MB in the end (delta: -13.6 MB). Peak memory consumption was 107.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:49:49,417 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 345.34 ms. Allocated memory is still 138.4 MB. Free memory was 101.4 MB in the beginning and 90.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 140.57 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 90.4 MB in the beginning and 179.9 MB in the end (delta: -89.5 MB). Peak memory consumption was 13.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 477.72 ms. Allocated memory is still 202.4 MB. Free memory was 179.9 MB in the beginning and 154.6 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41991.85 ms. Allocated memory was 202.4 MB in the beginning and 323.0 MB in the end (delta: 120.6 MB). Free memory was 154.0 MB in the beginning and 167.6 MB in the end (delta: -13.6 MB). Peak memory consumption was 107.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int N; VAL [\old(N)=5, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=3] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=3] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=3] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=3] [L25] int i; [L26] long long *a = malloc(sizeof(long long)*N); [L27] long long *b = malloc(sizeof(long long)*N); [L29] i=0 VAL [\old(N)=0, a={-1:0}, b={-2:0}, i=0, malloc(sizeof(long long)*N)={-1:0}, malloc(sizeof(long long)*N)={-2:0}, N=3] [L29] COND TRUE i