/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-8fc6572 [2020-07-10 15:26:14,644 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:14,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:14,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:14,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:14,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:14,669 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:14,679 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:14,683 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:14,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:14,689 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:14,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:14,691 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:14,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:14,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:14,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:14,699 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:14,700 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:14,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:14,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:14,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:14,716 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:14,717 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:14,718 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:14,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:14,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:14,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:14,721 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:14,721 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:14,722 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:14,722 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:14,723 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:14,724 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:14,724 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:14,725 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:14,725 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:14,726 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:14,726 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:14,726 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:14,727 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:14,728 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:14,728 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-10 15:26:14,742 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:14,743 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:14,744 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:14,744 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:14,744 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:14,745 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:14,745 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:14,745 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:14,745 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:14,746 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:14,746 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:14,746 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:14,746 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:14,746 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:14,746 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:14,747 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:14,747 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:14,747 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:14,748 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:14,748 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:14,748 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:14,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:14,749 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:14,749 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:14,749 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:14,749 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:14,749 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:14,750 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:14,750 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:14,750 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:15,057 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:15,068 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:15,072 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:15,074 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:15,074 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:15,075 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-10 15:26:15,140 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f56f927/939407d7ed2546a0a935521050ba98be/FLAG0f2647f41 [2020-07-10 15:26:15,608 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:15,608 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/ifeqn3f.c [2020-07-10 15:26:15,616 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f56f927/939407d7ed2546a0a935521050ba98be/FLAG0f2647f41 [2020-07-10 15:26:15,998 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49f56f927/939407d7ed2546a0a935521050ba98be [2020-07-10 15:26:16,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:16,009 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:16,010 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:16,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:16,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:16,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:15" (1/1) ... [2020-07-10 15:26:16,019 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e787d40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:16, skipping insertion in model container [2020-07-10 15:26:16,019 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:15" (1/1) ... [2020-07-10 15:26:16,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:16,046 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:16,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:16,269 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:16,302 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:16,318 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:16,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:16 WrapperNode [2020-07-10 15:26:16,318 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:16,319 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:16,319 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:16,319 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:16,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:16" (1/1) ... [2020-07-10 15:26:16,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:16" (1/1) ... [2020-07-10 15:26:16,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:16" (1/1) ... [2020-07-10 15:26:16,439 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:16" (1/1) ... [2020-07-10 15:26:16,456 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:16" (1/1) ... [2020-07-10 15:26:16,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:16" (1/1) ... [2020-07-10 15:26:16,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:16" (1/1) ... [2020-07-10 15:26:16,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:16,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:16,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:16,468 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:16,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:16" (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-10 15:26:16,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:16,534 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:16,534 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:16,534 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:16,534 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:16,534 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:16,535 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:16,535 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:16,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:16,535 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:16,535 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:16,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:16,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:16,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:16,539 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:16,955 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:16,956 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:26:16,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:16 BoogieIcfgContainer [2020-07-10 15:26:16,960 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:16,961 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:16,962 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:16,965 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:16,965 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:15" (1/3) ... [2020-07-10 15:26:16,966 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c960303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:16, skipping insertion in model container [2020-07-10 15:26:16,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:16" (2/3) ... [2020-07-10 15:26:16,967 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c960303 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:16, skipping insertion in model container [2020-07-10 15:26:16,967 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:16" (3/3) ... [2020-07-10 15:26:16,972 INFO L109 eAbstractionObserver]: Analyzing ICFG ifeqn3f.c [2020-07-10 15:26:16,995 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:17,004 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:17,015 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:17,038 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:17,038 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:17,038 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:17,038 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:17,038 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:17,039 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:17,039 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:17,039 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:17,063 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2020-07-10 15:26:17,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:26:17,077 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:17,079 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-10 15:26:17,079 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:17,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:17,087 INFO L82 PathProgramCache]: Analyzing trace with hash -294712258, now seen corresponding path program 1 times [2020-07-10 15:26:17,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:17,102 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043163718] [2020-07-10 15:26:17,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:17,405 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-10 15:26:17,406 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 15:26:17,406 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-10 15:26:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:17,422 INFO L280 TraceCheckUtils]: 0: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-10 15:26:17,424 INFO L280 TraceCheckUtils]: 1: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-10 15:26:17,424 INFO L280 TraceCheckUtils]: 2: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-10 15:26:17,425 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-10 15:26:17,427 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-10 15:26:17,428 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-10 15:26:17,428 INFO L280 TraceCheckUtils]: 2: Hoare triple {39#true} assume true; {39#true} is VALID [2020-07-10 15:26:17,428 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {39#true} {39#true} #91#return; {39#true} is VALID [2020-07-10 15:26:17,429 INFO L263 TraceCheckUtils]: 4: Hoare triple {39#true} call #t~ret10 := main(); {39#true} is VALID [2020-07-10 15:26:17,429 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-10 15:26:17,430 INFO L280 TraceCheckUtils]: 6: Hoare triple {39#true} assume !(~N~0 <= 0); {39#true} is VALID [2020-07-10 15:26:17,430 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-10 15:26:17,431 INFO L280 TraceCheckUtils]: 8: Hoare triple {39#true} ~cond := #in~cond; {39#true} is VALID [2020-07-10 15:26:17,432 INFO L280 TraceCheckUtils]: 9: Hoare triple {39#true} assume 0 == ~cond;assume false; {40#false} is VALID [2020-07-10 15:26:17,432 INFO L280 TraceCheckUtils]: 10: Hoare triple {40#false} assume true; {40#false} is VALID [2020-07-10 15:26:17,433 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {40#false} {39#true} #87#return; {40#false} is VALID [2020-07-10 15:26:17,433 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-10 15:26:17,434 INFO L280 TraceCheckUtils]: 13: Hoare triple {40#false} assume !(~i~0 < ~N~0); {40#false} is VALID [2020-07-10 15:26:17,434 INFO L280 TraceCheckUtils]: 14: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-10 15:26:17,435 INFO L280 TraceCheckUtils]: 15: Hoare triple {40#false} assume !true; {40#false} is VALID [2020-07-10 15:26:17,435 INFO L280 TraceCheckUtils]: 16: Hoare triple {40#false} ~i~0 := 0; {40#false} is VALID [2020-07-10 15:26:17,436 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-10 15:26:17,436 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-10 15:26:17,436 INFO L280 TraceCheckUtils]: 19: Hoare triple {40#false} ~cond := #in~cond; {40#false} is VALID [2020-07-10 15:26:17,437 INFO L280 TraceCheckUtils]: 20: Hoare triple {40#false} assume 0 == ~cond; {40#false} is VALID [2020-07-10 15:26:17,437 INFO L280 TraceCheckUtils]: 21: Hoare triple {40#false} assume !false; {40#false} is VALID [2020-07-10 15:26:17,441 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-10 15:26:17,442 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043163718] [2020-07-10 15:26:17,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:17,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:17,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031782225] [2020-07-10 15:26:17,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:26:17,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:17,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:17,515 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-10 15:26:17,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:17,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:17,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:17,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:17,527 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2020-07-10 15:26:17,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:17,749 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2020-07-10 15:26:17,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:17,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:26:17,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:17,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:17,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-10 15:26:17,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:17,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2020-07-10 15:26:17,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2020-07-10 15:26:17,939 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-10 15:26:17,953 INFO L225 Difference]: With dead ends: 62 [2020-07-10 15:26:17,953 INFO L226 Difference]: Without dead ends: 31 [2020-07-10 15:26:17,957 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-10 15:26:17,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-10 15:26:18,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-10 15:26:18,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:18,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 31 states. [2020-07-10 15:26:18,015 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-10 15:26:18,015 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-10 15:26:18,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:18,020 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-10 15:26:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-10 15:26:18,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:18,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:18,022 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 31 states. [2020-07-10 15:26:18,022 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 31 states. [2020-07-10 15:26:18,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:18,027 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-10 15:26:18,027 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-10 15:26:18,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:18,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:18,028 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:18,028 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:18,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-10 15:26:18,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-07-10 15:26:18,033 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2020-07-10 15:26:18,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:18,034 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-07-10 15:26:18,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-07-10 15:26:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:26:18,035 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:18,035 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-10 15:26:18,036 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:18,036 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:18,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:18,037 INFO L82 PathProgramCache]: Analyzing trace with hash -2054124171, now seen corresponding path program 1 times [2020-07-10 15:26:18,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:18,038 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410584804] [2020-07-10 15:26:18,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:18,061 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:18,061 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [58130609] [2020-07-10 15:26:18,062 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-10 15:26:18,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:18,122 INFO L264 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:26:18,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:18,137 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:18,213 INFO L263 TraceCheckUtils]: 0: Hoare triple {233#true} call ULTIMATE.init(); {233#true} is VALID [2020-07-10 15:26:18,214 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-10 15:26:18,214 INFO L280 TraceCheckUtils]: 2: Hoare triple {233#true} assume true; {233#true} is VALID [2020-07-10 15:26:18,214 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {233#true} {233#true} #91#return; {233#true} is VALID [2020-07-10 15:26:18,215 INFO L263 TraceCheckUtils]: 4: Hoare triple {233#true} call #t~ret10 := main(); {233#true} is VALID [2020-07-10 15:26:18,215 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-10 15:26:18,216 INFO L280 TraceCheckUtils]: 6: Hoare triple {233#true} assume !(~N~0 <= 0); {256#(< 0 ~N~0)} is VALID [2020-07-10 15:26:18,217 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-10 15:26:18,218 INFO L280 TraceCheckUtils]: 8: Hoare triple {256#(< 0 ~N~0)} ~cond := #in~cond; {256#(< 0 ~N~0)} is VALID [2020-07-10 15:26:18,219 INFO L280 TraceCheckUtils]: 9: Hoare triple {256#(< 0 ~N~0)} assume !(0 == ~cond); {256#(< 0 ~N~0)} is VALID [2020-07-10 15:26:18,220 INFO L280 TraceCheckUtils]: 10: Hoare triple {256#(< 0 ~N~0)} assume true; {256#(< 0 ~N~0)} is VALID [2020-07-10 15:26:18,221 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {256#(< 0 ~N~0)} {256#(< 0 ~N~0)} #87#return; {256#(< 0 ~N~0)} is VALID [2020-07-10 15:26:18,222 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-10 15:26:18,224 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-10 15:26:18,224 INFO L280 TraceCheckUtils]: 14: Hoare triple {234#false} ~i~0 := 0; {234#false} is VALID [2020-07-10 15:26:18,224 INFO L280 TraceCheckUtils]: 15: Hoare triple {234#false} assume !(~i~0 < ~N~0); {234#false} is VALID [2020-07-10 15:26:18,225 INFO L280 TraceCheckUtils]: 16: Hoare triple {234#false} ~i~0 := 0; {234#false} is VALID [2020-07-10 15:26:18,225 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-10 15:26:18,225 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-10 15:26:18,226 INFO L280 TraceCheckUtils]: 19: Hoare triple {234#false} ~cond := #in~cond; {234#false} is VALID [2020-07-10 15:26:18,226 INFO L280 TraceCheckUtils]: 20: Hoare triple {234#false} assume 0 == ~cond; {234#false} is VALID [2020-07-10 15:26:18,226 INFO L280 TraceCheckUtils]: 21: Hoare triple {234#false} assume !false; {234#false} is VALID [2020-07-10 15:26:18,228 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-10 15:26:18,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410584804] [2020-07-10 15:26:18,229 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:18,229 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58130609] [2020-07-10 15:26:18,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:18,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:26:18,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495463557] [2020-07-10 15:26:18,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 15:26:18,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:18,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:26:18,262 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-10 15:26:18,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:26:18,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:18,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:26:18,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:26:18,263 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 4 states. [2020-07-10 15:26:18,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:18,457 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2020-07-10 15:26:18,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:26:18,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-07-10 15:26:18,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:18,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2020-07-10 15:26:18,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:18,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 67 transitions. [2020-07-10 15:26:18,467 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 67 transitions. [2020-07-10 15:26:18,570 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-10 15:26:18,573 INFO L225 Difference]: With dead ends: 56 [2020-07-10 15:26:18,574 INFO L226 Difference]: Without dead ends: 41 [2020-07-10 15:26:18,575 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-10 15:26:18,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-10 15:26:18,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 33. [2020-07-10 15:26:18,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:18,609 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 33 states. [2020-07-10 15:26:18,609 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 33 states. [2020-07-10 15:26:18,609 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 33 states. [2020-07-10 15:26:18,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:18,615 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-07-10 15:26:18,615 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-07-10 15:26:18,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:18,616 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:18,617 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 41 states. [2020-07-10 15:26:18,617 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 41 states. [2020-07-10 15:26:18,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:18,622 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2020-07-10 15:26:18,622 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2020-07-10 15:26:18,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:18,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:18,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:18,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:18,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 15:26:18,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2020-07-10 15:26:18,626 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 22 [2020-07-10 15:26:18,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:18,627 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2020-07-10 15:26:18,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:26:18,627 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2020-07-10 15:26:18,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:26:18,628 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:18,629 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-10 15:26:18,842 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-10 15:26:18,842 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:18,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:18,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1477618916, now seen corresponding path program 1 times [2020-07-10 15:26:18,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:18,843 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677852360] [2020-07-10 15:26:18,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:18,874 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:18,874 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [29863841] [2020-07-10 15:26:18,875 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-10 15:26:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:18,929 INFO L264 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 15:26:18,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:18,943 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:19,009 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-10 15:26:19,010 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:19,015 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:19,015 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:19,015 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2020-07-10 15:26:19,072 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:19,073 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-10 15:26:19,074 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-10 15:26:19,087 INFO L624 ElimStorePlain]: treesize reduction 9, result has 43.8 percent of original size [2020-07-10 15:26:19,088 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-10 15:26:19,088 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:22, output treesize:7 [2020-07-10 15:26:19,092 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:19,093 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-10 15:26:19,093 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~i~0) (= 1 |main_#t~mem9|)) [2020-07-10 15:26:19,163 INFO L263 TraceCheckUtils]: 0: Hoare triple {505#true} call ULTIMATE.init(); {505#true} is VALID [2020-07-10 15:26:19,163 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-10 15:26:19,164 INFO L280 TraceCheckUtils]: 2: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-10 15:26:19,164 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {505#true} {505#true} #91#return; {505#true} is VALID [2020-07-10 15:26:19,164 INFO L263 TraceCheckUtils]: 4: Hoare triple {505#true} call #t~ret10 := main(); {505#true} is VALID [2020-07-10 15:26:19,165 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-10 15:26:19,165 INFO L280 TraceCheckUtils]: 6: Hoare triple {505#true} assume !(~N~0 <= 0); {505#true} is VALID [2020-07-10 15:26:19,165 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-10 15:26:19,166 INFO L280 TraceCheckUtils]: 8: Hoare triple {505#true} ~cond := #in~cond; {505#true} is VALID [2020-07-10 15:26:19,166 INFO L280 TraceCheckUtils]: 9: Hoare triple {505#true} assume !(0 == ~cond); {505#true} is VALID [2020-07-10 15:26:19,166 INFO L280 TraceCheckUtils]: 10: Hoare triple {505#true} assume true; {505#true} is VALID [2020-07-10 15:26:19,166 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {505#true} {505#true} #87#return; {505#true} is VALID [2020-07-10 15:26:19,167 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-10 15:26:19,167 INFO L280 TraceCheckUtils]: 13: Hoare triple {505#true} assume !!(~i~0 < ~N~0); {505#true} is VALID [2020-07-10 15:26:19,167 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-10 15:26:19,168 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-10 15:26:19,168 INFO L280 TraceCheckUtils]: 16: Hoare triple {505#true} assume !(~i~0 < ~N~0); {505#true} is VALID [2020-07-10 15:26:19,168 INFO L280 TraceCheckUtils]: 17: Hoare triple {505#true} ~i~0 := 0; {505#true} is VALID [2020-07-10 15:26:19,169 INFO L280 TraceCheckUtils]: 18: Hoare triple {505#true} assume !!(~i~0 < ~N~0); {505#true} is VALID [2020-07-10 15:26:19,170 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-10 15:26:19,171 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-10 15:26:19,172 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-10 15:26:19,173 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-10 15:26:19,174 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-10 15:26:19,175 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-10 15:26:19,176 INFO L280 TraceCheckUtils]: 25: Hoare triple {585#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {589#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:26:19,177 INFO L280 TraceCheckUtils]: 26: Hoare triple {589#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {506#false} is VALID [2020-07-10 15:26:19,177 INFO L280 TraceCheckUtils]: 27: Hoare triple {506#false} assume !false; {506#false} is VALID [2020-07-10 15:26:19,179 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-10 15:26:19,179 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677852360] [2020-07-10 15:26:19,180 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:19,180 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [29863841] [2020-07-10 15:26:19,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:19,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 15:26:19,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717113834] [2020-07-10 15:26:19,181 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-10 15:26:19,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:19,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:26:19,218 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-10 15:26:19,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:26:19,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:19,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:26:19,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:26:19,220 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2020-07-10 15:26:19,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:19,637 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2020-07-10 15:26:19,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 15:26:19,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2020-07-10 15:26:19,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:26:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2020-07-10 15:26:19,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:26:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 57 transitions. [2020-07-10 15:26:19,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 57 transitions. [2020-07-10 15:26:19,750 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-10 15:26:19,753 INFO L225 Difference]: With dead ends: 52 [2020-07-10 15:26:19,753 INFO L226 Difference]: Without dead ends: 50 [2020-07-10 15:26:19,754 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-10 15:26:19,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-07-10 15:26:19,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2020-07-10 15:26:19,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:19,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand 43 states. [2020-07-10 15:26:19,813 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand 43 states. [2020-07-10 15:26:19,813 INFO L87 Difference]: Start difference. First operand 50 states. Second operand 43 states. [2020-07-10 15:26:19,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:19,818 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-07-10 15:26:19,818 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2020-07-10 15:26:19,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:19,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:19,820 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 50 states. [2020-07-10 15:26:19,820 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 50 states. [2020-07-10 15:26:19,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:19,828 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2020-07-10 15:26:19,828 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 57 transitions. [2020-07-10 15:26:19,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:19,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:19,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:19,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:19,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2020-07-10 15:26:19,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2020-07-10 15:26:19,834 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 28 [2020-07-10 15:26:19,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:19,834 INFO L479 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2020-07-10 15:26:19,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:26:19,835 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2020-07-10 15:26:19,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:26:19,839 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:19,839 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-10 15:26:20,039 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:20,040 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:20,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:20,041 INFO L82 PathProgramCache]: Analyzing trace with hash -797560546, now seen corresponding path program 1 times [2020-07-10 15:26:20,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:20,042 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718557734] [2020-07-10 15:26:20,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:20,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:20,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:20,147 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-10 15:26:20,147 INFO L280 TraceCheckUtils]: 1: Hoare triple {830#true} assume true; {830#true} is VALID [2020-07-10 15:26:20,148 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {830#true} {830#true} #91#return; {830#true} is VALID [2020-07-10 15:26:20,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:20,153 INFO L280 TraceCheckUtils]: 0: Hoare triple {830#true} ~cond := #in~cond; {830#true} is VALID [2020-07-10 15:26:20,153 INFO L280 TraceCheckUtils]: 1: Hoare triple {830#true} assume !(0 == ~cond); {830#true} is VALID [2020-07-10 15:26:20,154 INFO L280 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2020-07-10 15:26:20,154 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #87#return; {830#true} is VALID [2020-07-10 15:26:20,155 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-10 15:26:20,156 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-10 15:26:20,156 INFO L280 TraceCheckUtils]: 2: Hoare triple {830#true} assume true; {830#true} is VALID [2020-07-10 15:26:20,156 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {830#true} {830#true} #91#return; {830#true} is VALID [2020-07-10 15:26:20,156 INFO L263 TraceCheckUtils]: 4: Hoare triple {830#true} call #t~ret10 := main(); {830#true} is VALID [2020-07-10 15:26:20,157 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-10 15:26:20,157 INFO L280 TraceCheckUtils]: 6: Hoare triple {830#true} assume !(~N~0 <= 0); {830#true} is VALID [2020-07-10 15:26:20,157 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-10 15:26:20,158 INFO L280 TraceCheckUtils]: 8: Hoare triple {830#true} ~cond := #in~cond; {830#true} is VALID [2020-07-10 15:26:20,158 INFO L280 TraceCheckUtils]: 9: Hoare triple {830#true} assume !(0 == ~cond); {830#true} is VALID [2020-07-10 15:26:20,158 INFO L280 TraceCheckUtils]: 10: Hoare triple {830#true} assume true; {830#true} is VALID [2020-07-10 15:26:20,158 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {830#true} {830#true} #87#return; {830#true} is VALID [2020-07-10 15:26:20,159 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-10 15:26:20,159 INFO L280 TraceCheckUtils]: 13: Hoare triple {830#true} assume !!(~i~0 < ~N~0); {830#true} is VALID [2020-07-10 15:26:20,159 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-10 15:26:20,159 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-10 15:26:20,160 INFO L280 TraceCheckUtils]: 16: Hoare triple {830#true} assume !(~i~0 < ~N~0); {830#true} is VALID [2020-07-10 15:26:20,161 INFO L280 TraceCheckUtils]: 17: Hoare triple {830#true} ~i~0 := 0; {839#(= 0 main_~i~0)} is VALID [2020-07-10 15:26:20,161 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-10 15:26:20,162 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-10 15:26:20,163 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-10 15:26:20,163 INFO L280 TraceCheckUtils]: 21: Hoare triple {831#false} assume !(~i~0 < ~N~0); {831#false} is VALID [2020-07-10 15:26:20,163 INFO L280 TraceCheckUtils]: 22: Hoare triple {831#false} ~i~0 := 0; {831#false} is VALID [2020-07-10 15:26:20,164 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-10 15:26:20,164 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-10 15:26:20,164 INFO L280 TraceCheckUtils]: 25: Hoare triple {831#false} ~cond := #in~cond; {831#false} is VALID [2020-07-10 15:26:20,164 INFO L280 TraceCheckUtils]: 26: Hoare triple {831#false} assume 0 == ~cond; {831#false} is VALID [2020-07-10 15:26:20,165 INFO L280 TraceCheckUtils]: 27: Hoare triple {831#false} assume !false; {831#false} is VALID [2020-07-10 15:26:20,166 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-10 15:26:20,166 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718557734] [2020-07-10 15:26:20,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:20,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:26:20,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851994931] [2020-07-10 15:26:20,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-07-10 15:26:20,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:20,168 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:26:20,200 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-10 15:26:20,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:26:20,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:20,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:26:20,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:26:20,202 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 4 states. [2020-07-10 15:26:20,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:20,493 INFO L93 Difference]: Finished difference Result 74 states and 86 transitions. [2020-07-10 15:26:20,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 15:26:20,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2020-07-10 15:26:20,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:20,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:20,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2020-07-10 15:26:20,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:26:20,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2020-07-10 15:26:20,499 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2020-07-10 15:26:20,582 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-10 15:26:20,585 INFO L225 Difference]: With dead ends: 74 [2020-07-10 15:26:20,585 INFO L226 Difference]: Without dead ends: 45 [2020-07-10 15:26:20,586 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-10 15:26:20,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2020-07-10 15:26:20,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2020-07-10 15:26:20,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:20,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 41 states. [2020-07-10 15:26:20,631 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 41 states. [2020-07-10 15:26:20,631 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 41 states. [2020-07-10 15:26:20,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:20,634 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2020-07-10 15:26:20,635 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-10 15:26:20,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:20,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:20,635 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 45 states. [2020-07-10 15:26:20,636 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 45 states. [2020-07-10 15:26:20,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:20,638 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2020-07-10 15:26:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-10 15:26:20,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:20,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:20,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:20,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-10 15:26:20,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2020-07-10 15:26:20,642 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 28 [2020-07-10 15:26:20,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:20,642 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2020-07-10 15:26:20,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:26:20,642 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2020-07-10 15:26:20,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-10 15:26:20,643 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:20,644 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-10 15:26:20,644 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 15:26:20,644 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:20,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:20,645 INFO L82 PathProgramCache]: Analyzing trace with hash -622618382, now seen corresponding path program 1 times [2020-07-10 15:26:20,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:20,645 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406284138] [2020-07-10 15:26:20,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:20,664 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:20,664 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2124647004] [2020-07-10 15:26:20,664 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-10 15:26:20,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:20,731 INFO L264 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:26:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:20,748 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:20,879 INFO L263 TraceCheckUtils]: 0: Hoare triple {1090#true} call ULTIMATE.init(); {1090#true} is VALID [2020-07-10 15:26:20,879 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-10 15:26:20,880 INFO L280 TraceCheckUtils]: 2: Hoare triple {1090#true} assume true; {1090#true} is VALID [2020-07-10 15:26:20,880 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1090#true} {1090#true} #91#return; {1090#true} is VALID [2020-07-10 15:26:20,880 INFO L263 TraceCheckUtils]: 4: Hoare triple {1090#true} call #t~ret10 := main(); {1090#true} is VALID [2020-07-10 15:26:20,880 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-10 15:26:20,881 INFO L280 TraceCheckUtils]: 6: Hoare triple {1090#true} assume !(~N~0 <= 0); {1090#true} is VALID [2020-07-10 15:26:20,881 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-10 15:26:20,881 INFO L280 TraceCheckUtils]: 8: Hoare triple {1090#true} ~cond := #in~cond; {1090#true} is VALID [2020-07-10 15:26:20,881 INFO L280 TraceCheckUtils]: 9: Hoare triple {1090#true} assume !(0 == ~cond); {1090#true} is VALID [2020-07-10 15:26:20,882 INFO L280 TraceCheckUtils]: 10: Hoare triple {1090#true} assume true; {1090#true} is VALID [2020-07-10 15:26:20,882 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1090#true} {1090#true} #87#return; {1090#true} is VALID [2020-07-10 15:26:20,890 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-10 15:26:20,891 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-10 15:26:20,891 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-10 15:26:20,892 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-10 15:26:20,894 INFO L280 TraceCheckUtils]: 16: Hoare triple {1141#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {1145#(<= ~N~0 1)} is VALID [2020-07-10 15:26:20,895 INFO L280 TraceCheckUtils]: 17: Hoare triple {1145#(<= ~N~0 1)} ~i~0 := 0; {1145#(<= ~N~0 1)} is VALID [2020-07-10 15:26:20,895 INFO L280 TraceCheckUtils]: 18: Hoare triple {1145#(<= ~N~0 1)} assume !!(~i~0 < ~N~0); {1145#(<= ~N~0 1)} is VALID [2020-07-10 15:26:20,896 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-10 15:26:20,896 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-10 15:26:20,897 INFO L280 TraceCheckUtils]: 21: Hoare triple {1145#(<= ~N~0 1)} assume !(~i~0 < ~N~0); {1145#(<= ~N~0 1)} is VALID [2020-07-10 15:26:20,898 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-10 15:26:20,898 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-10 15:26:20,909 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-10 15:26:20,910 INFO L280 TraceCheckUtils]: 25: Hoare triple {1145#(<= ~N~0 1)} ~cond := #in~cond; {1145#(<= ~N~0 1)} is VALID [2020-07-10 15:26:20,910 INFO L280 TraceCheckUtils]: 26: Hoare triple {1145#(<= ~N~0 1)} assume !(0 == ~cond); {1145#(<= ~N~0 1)} is VALID [2020-07-10 15:26:20,912 INFO L280 TraceCheckUtils]: 27: Hoare triple {1145#(<= ~N~0 1)} assume true; {1145#(<= ~N~0 1)} is VALID [2020-07-10 15:26:20,913 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-10 15:26:20,914 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-10 15:26:20,915 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-10 15:26:20,916 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-10 15:26:20,916 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-10 15:26:20,916 INFO L280 TraceCheckUtils]: 33: Hoare triple {1091#false} ~cond := #in~cond; {1091#false} is VALID [2020-07-10 15:26:20,916 INFO L280 TraceCheckUtils]: 34: Hoare triple {1091#false} assume 0 == ~cond; {1091#false} is VALID [2020-07-10 15:26:20,917 INFO L280 TraceCheckUtils]: 35: Hoare triple {1091#false} assume !false; {1091#false} is VALID [2020-07-10 15:26:20,919 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-10 15:26:20,919 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406284138] [2020-07-10 15:26:20,919 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:20,920 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124647004] [2020-07-10 15:26:20,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:20,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-10 15:26:20,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654431739] [2020-07-10 15:26:20,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-10 15:26:20,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:20,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 15:26:20,969 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-10 15:26:20,969 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 15:26:20,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:20,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 15:26:20,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:26:20,970 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 7 states. [2020-07-10 15:26:21,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:21,412 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2020-07-10 15:26:21,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 15:26:21,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 36 [2020-07-10 15:26:21,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:26:21,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2020-07-10 15:26:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 15:26:21,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2020-07-10 15:26:21,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2020-07-10 15:26:21,541 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-10 15:26:21,543 INFO L225 Difference]: With dead ends: 91 [2020-07-10 15:26:21,544 INFO L226 Difference]: Without dead ends: 55 [2020-07-10 15:26:21,545 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-10 15:26:21,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2020-07-10 15:26:21,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 45. [2020-07-10 15:26:21,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:21,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand 45 states. [2020-07-10 15:26:21,592 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 45 states. [2020-07-10 15:26:21,592 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 45 states. [2020-07-10 15:26:21,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:21,595 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2020-07-10 15:26:21,595 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2020-07-10 15:26:21,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:21,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:21,597 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 55 states. [2020-07-10 15:26:21,597 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 55 states. [2020-07-10 15:26:21,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:21,601 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2020-07-10 15:26:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2020-07-10 15:26:21,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:21,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:21,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:21,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:21,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-07-10 15:26:21,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2020-07-10 15:26:21,604 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 36 [2020-07-10 15:26:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:21,605 INFO L479 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2020-07-10 15:26:21,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 15:26:21,605 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2020-07-10 15:26:21,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2020-07-10 15:26:21,608 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:21,608 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-10 15:26:21,823 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:21,824 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:21,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:21,825 INFO L82 PathProgramCache]: Analyzing trace with hash 60389999, now seen corresponding path program 1 times [2020-07-10 15:26:21,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:21,826 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167945649] [2020-07-10 15:26:21,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:21,846 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:21,847 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1855216532] [2020-07-10 15:26:21,847 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-10 15:26:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:21,889 INFO L264 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 29 conjunts are in the unsatisfiable core [2020-07-10 15:26:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:21,907 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:21,942 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-10 15:26:21,943 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:21,948 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:21,949 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:21,949 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2020-07-10 15:26:21,977 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-10 15:26:21,978 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:21,986 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:21,986 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:21,986 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-07-10 15:26:22,048 INFO L350 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2020-07-10 15:26:22,049 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-10 15:26:22,052 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:22,059 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:22,060 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:22,060 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:31, output treesize:27 [2020-07-10 15:26:22,145 INFO L350 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2020-07-10 15:26:22,146 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-10 15:26:22,149 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:22,161 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:22,162 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:22,162 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:41, output treesize:37 [2020-07-10 15:26:22,318 INFO L350 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2020-07-10 15:26:22,319 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-10 15:26:22,329 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:22,346 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:22,351 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-10 15:26:22,351 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:57, output treesize:53 [2020-07-10 15:26:27,168 INFO L350 Elim1Store]: treesize reduction 20, result has 57.4 percent of original size [2020-07-10 15:26:27,169 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-10 15:26:27,173 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:27,190 INFO L624 ElimStorePlain]: treesize reduction 23, result has 32.4 percent of original size [2020-07-10 15:26:27,192 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-10 15:26:27,193 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:67, output treesize:7 [2020-07-10 15:26:27,198 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:27,198 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-10 15:26:27,198 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 7 |main_#t~mem9|) (= 1 main_~i~0)) [2020-07-10 15:26:27,290 INFO L263 TraceCheckUtils]: 0: Hoare triple {1507#true} call ULTIMATE.init(); {1507#true} is VALID [2020-07-10 15:26:27,291 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-10 15:26:27,291 INFO L280 TraceCheckUtils]: 2: Hoare triple {1507#true} assume true; {1507#true} is VALID [2020-07-10 15:26:27,292 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1507#true} {1507#true} #91#return; {1507#true} is VALID [2020-07-10 15:26:27,292 INFO L263 TraceCheckUtils]: 4: Hoare triple {1507#true} call #t~ret10 := main(); {1507#true} is VALID [2020-07-10 15:26:27,292 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-10 15:26:27,292 INFO L280 TraceCheckUtils]: 6: Hoare triple {1507#true} assume !(~N~0 <= 0); {1507#true} is VALID [2020-07-10 15:26:27,292 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-10 15:26:27,293 INFO L280 TraceCheckUtils]: 8: Hoare triple {1507#true} ~cond := #in~cond; {1507#true} is VALID [2020-07-10 15:26:27,293 INFO L280 TraceCheckUtils]: 9: Hoare triple {1507#true} assume !(0 == ~cond); {1507#true} is VALID [2020-07-10 15:26:27,293 INFO L280 TraceCheckUtils]: 10: Hoare triple {1507#true} assume true; {1507#true} is VALID [2020-07-10 15:26:27,293 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1507#true} {1507#true} #87#return; {1507#true} is VALID [2020-07-10 15:26:27,294 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-10 15:26:27,295 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-10 15:26:27,296 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-10 15:26:27,299 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-10 15:26:27,301 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-10 15:26:27,303 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-10 15:26:27,308 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-10 15:26:27,310 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-10 15:26:27,311 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-10 15:26:27,312 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-10 15:26:27,314 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-10 15:26:27,317 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-10 15:26:27,318 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-10 15:26:27,324 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-10 15:26:27,325 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-10 15:26:27,326 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-10 15:26:27,327 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-10 15:26:27,328 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-10 15:26:27,336 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-10 15:26:27,337 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-10 15:26:27,338 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-10 15:26:27,339 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-10 15:26:27,340 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-10 15:26:27,341 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-10 15:26:27,342 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-10 15:26:27,344 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-10 15:26:27,345 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-10 15:26:27,346 INFO L280 TraceCheckUtils]: 39: Hoare triple {1638#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1642#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:26:27,346 INFO L280 TraceCheckUtils]: 40: Hoare triple {1642#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1508#false} is VALID [2020-07-10 15:26:27,347 INFO L280 TraceCheckUtils]: 41: Hoare triple {1508#false} assume !false; {1508#false} is VALID [2020-07-10 15:26:27,356 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-10 15:26:27,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167945649] [2020-07-10 15:26:27,357 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:26:27,357 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1855216532] [2020-07-10 15:26:27,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:27,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2020-07-10 15:26:27,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537533456] [2020-07-10 15:26:27,358 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2020-07-10 15:26:27,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:27,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-10 15:26:27,539 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-10 15:26:27,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-10 15:26:27,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:27,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-10 15:26:27,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=194, Unknown=2, NotChecked=0, Total=240 [2020-07-10 15:26:27,540 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 16 states. [2020-07-10 15:26:58,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:58,820 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2020-07-10 15:26:58,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-10 15:26:58,821 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 42 [2020-07-10 15:26:58,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:58,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 15:26:58,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 93 transitions. [2020-07-10 15:26:58,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 15:26:58,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 93 transitions. [2020-07-10 15:26:58,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 93 transitions. [2020-07-10 15:26:59,574 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-10 15:26:59,577 INFO L225 Difference]: With dead ends: 95 [2020-07-10 15:26:59,577 INFO L226 Difference]: Without dead ends: 65 [2020-07-10 15:26:59,578 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=97, Invalid=407, Unknown=2, NotChecked=0, Total=506 [2020-07-10 15:26:59,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2020-07-10 15:26:59,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2020-07-10 15:26:59,717 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:59,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand 55 states. [2020-07-10 15:26:59,717 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand 55 states. [2020-07-10 15:26:59,717 INFO L87 Difference]: Start difference. First operand 65 states. Second operand 55 states. [2020-07-10 15:26:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:59,720 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-10 15:26:59,721 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-10 15:26:59,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:59,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:59,722 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand 65 states. [2020-07-10 15:26:59,722 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 65 states. [2020-07-10 15:26:59,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:59,726 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2020-07-10 15:26:59,726 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2020-07-10 15:26:59,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:59,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:59,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:59,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:59,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-07-10 15:26:59,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2020-07-10 15:26:59,729 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 42 [2020-07-10 15:26:59,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:59,729 INFO L479 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2020-07-10 15:26:59,729 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-10 15:26:59,729 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2020-07-10 15:26:59,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-10 15:26:59,732 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:59,732 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-10 15:26:59,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:59,947 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:59,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:59,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1235795269, now seen corresponding path program 2 times [2020-07-10 15:26:59,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:59,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057916496] [2020-07-10 15:26:59,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:59,971 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:26:59,973 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [77823293] [2020-07-10 15:26:59,974 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-10 15:27:00,022 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:27:00,023 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:00,024 INFO L264 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 15:27:00,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:00,044 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:00,279 INFO L263 TraceCheckUtils]: 0: Hoare triple {1998#true} call ULTIMATE.init(); {1998#true} is VALID [2020-07-10 15:27:00,279 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-10 15:27:00,279 INFO L280 TraceCheckUtils]: 2: Hoare triple {1998#true} assume true; {1998#true} is VALID [2020-07-10 15:27:00,279 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1998#true} {1998#true} #91#return; {1998#true} is VALID [2020-07-10 15:27:00,280 INFO L263 TraceCheckUtils]: 4: Hoare triple {1998#true} call #t~ret10 := main(); {1998#true} is VALID [2020-07-10 15:27:00,280 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-10 15:27:00,280 INFO L280 TraceCheckUtils]: 6: Hoare triple {1998#true} assume !(~N~0 <= 0); {1998#true} is VALID [2020-07-10 15:27:00,280 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-10 15:27:00,280 INFO L280 TraceCheckUtils]: 8: Hoare triple {1998#true} ~cond := #in~cond; {1998#true} is VALID [2020-07-10 15:27:00,280 INFO L280 TraceCheckUtils]: 9: Hoare triple {1998#true} assume !(0 == ~cond); {1998#true} is VALID [2020-07-10 15:27:00,281 INFO L280 TraceCheckUtils]: 10: Hoare triple {1998#true} assume true; {1998#true} is VALID [2020-07-10 15:27:00,281 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {1998#true} {1998#true} #87#return; {1998#true} is VALID [2020-07-10 15:27:00,283 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-10 15:27:00,287 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-10 15:27:00,288 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-10 15:27:00,289 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-10 15:27:00,290 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-10 15:27:00,291 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-10 15:27:00,292 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-10 15:27:00,294 INFO L280 TraceCheckUtils]: 19: Hoare triple {2059#(<= main_~i~0 2)} assume !(~i~0 < ~N~0); {2063#(<= ~N~0 2)} is VALID [2020-07-10 15:27:00,295 INFO L280 TraceCheckUtils]: 20: Hoare triple {2063#(<= ~N~0 2)} ~i~0 := 0; {2063#(<= ~N~0 2)} is VALID [2020-07-10 15:27:00,296 INFO L280 TraceCheckUtils]: 21: Hoare triple {2063#(<= ~N~0 2)} assume !!(~i~0 < ~N~0); {2063#(<= ~N~0 2)} is VALID [2020-07-10 15:27:00,296 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-10 15:27:00,297 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-10 15:27:00,298 INFO L280 TraceCheckUtils]: 24: Hoare triple {2063#(<= ~N~0 2)} assume !!(~i~0 < ~N~0); {2063#(<= ~N~0 2)} is VALID [2020-07-10 15:27:00,299 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-10 15:27:00,299 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-10 15:27:00,300 INFO L280 TraceCheckUtils]: 27: Hoare triple {2063#(<= ~N~0 2)} assume !(~i~0 < ~N~0); {2063#(<= ~N~0 2)} is VALID [2020-07-10 15:27:00,301 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-10 15:27:00,302 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-10 15:27:00,304 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-10 15:27:00,304 INFO L280 TraceCheckUtils]: 31: Hoare triple {2063#(<= ~N~0 2)} ~cond := #in~cond; {2063#(<= ~N~0 2)} is VALID [2020-07-10 15:27:00,305 INFO L280 TraceCheckUtils]: 32: Hoare triple {2063#(<= ~N~0 2)} assume !(0 == ~cond); {2063#(<= ~N~0 2)} is VALID [2020-07-10 15:27:00,306 INFO L280 TraceCheckUtils]: 33: Hoare triple {2063#(<= ~N~0 2)} assume true; {2063#(<= ~N~0 2)} is VALID [2020-07-10 15:27:00,307 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-10 15:27:00,307 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-10 15:27:00,309 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-10 15:27:00,310 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-10 15:27:00,312 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-10 15:27:00,318 INFO L280 TraceCheckUtils]: 39: Hoare triple {2063#(<= ~N~0 2)} ~cond := #in~cond; {2063#(<= ~N~0 2)} is VALID [2020-07-10 15:27:00,319 INFO L280 TraceCheckUtils]: 40: Hoare triple {2063#(<= ~N~0 2)} assume !(0 == ~cond); {2063#(<= ~N~0 2)} is VALID [2020-07-10 15:27:00,320 INFO L280 TraceCheckUtils]: 41: Hoare triple {2063#(<= ~N~0 2)} assume true; {2063#(<= ~N~0 2)} is VALID [2020-07-10 15:27:00,321 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-10 15:27:00,321 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-10 15:27:00,322 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-10 15:27:00,324 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-10 15:27:00,324 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-10 15:27:00,324 INFO L280 TraceCheckUtils]: 47: Hoare triple {1999#false} ~cond := #in~cond; {1999#false} is VALID [2020-07-10 15:27:00,324 INFO L280 TraceCheckUtils]: 48: Hoare triple {1999#false} assume 0 == ~cond; {1999#false} is VALID [2020-07-10 15:27:00,325 INFO L280 TraceCheckUtils]: 49: Hoare triple {1999#false} assume !false; {1999#false} is VALID [2020-07-10 15:27:00,328 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-10 15:27:00,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057916496] [2020-07-10 15:27:00,329 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-10 15:27:00,329 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77823293] [2020-07-10 15:27:00,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:27:00,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2020-07-10 15:27:00,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171390373] [2020-07-10 15:27:00,330 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2020-07-10 15:27:00,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:00,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:27:00,433 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-10 15:27:00,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:27:00,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:00,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:27:00,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:27:00,434 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand 9 states. [2020-07-10 15:27:01,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:01,575 INFO L93 Difference]: Finished difference Result 127 states and 139 transitions. [2020-07-10 15:27:01,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:27:01,575 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 50 [2020-07-10 15:27:01,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:01,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:27:01,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2020-07-10 15:27:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:27:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 113 transitions. [2020-07-10 15:27:01,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 113 transitions. [2020-07-10 15:27:01,816 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-10 15:27:01,819 INFO L225 Difference]: With dead ends: 127 [2020-07-10 15:27:01,819 INFO L226 Difference]: Without dead ends: 69 [2020-07-10 15:27:01,820 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-10 15:27:01,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2020-07-10 15:27:01,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 59. [2020-07-10 15:27:01,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:01,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand 59 states. [2020-07-10 15:27:01,936 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand 59 states. [2020-07-10 15:27:01,936 INFO L87 Difference]: Start difference. First operand 69 states. Second operand 59 states. [2020-07-10 15:27:01,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:01,939 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2020-07-10 15:27:01,940 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2020-07-10 15:27:01,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:01,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:01,940 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand 69 states. [2020-07-10 15:27:01,941 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 69 states. [2020-07-10 15:27:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:01,945 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2020-07-10 15:27:01,946 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2020-07-10 15:27:01,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:01,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:01,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:01,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:01,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2020-07-10 15:27:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2020-07-10 15:27:01,949 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 50 [2020-07-10 15:27:01,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:01,950 INFO L479 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2020-07-10 15:27:01,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:27:01,950 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2020-07-10 15:27:01,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-10 15:27:01,952 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:01,952 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-10 15:27:02,167 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-10 15:27:02,168 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:02,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:02,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1577312680, now seen corresponding path program 3 times [2020-07-10 15:27:02,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:02,170 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935414063] [2020-07-10 15:27:02,170 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:02,203 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-10 15:27:02,203 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410020315] [2020-07-10 15:27:02,203 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-10 15:27:03,043 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-10 15:27:03,043 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2020-07-10 15:27:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:03,148 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:27:03,149 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:27:03,352 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:03,420 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:27:03,420 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:03,420 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:03,420 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:27:03,420 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:27:03,420 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:27:03,420 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:03,420 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:03,421 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:03,421 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:27:03,421 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:27:03,421 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:27:03,421 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:27:03,421 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:03,421 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:03,421 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:03,421 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:03,422 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:27:03,422 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:03,422 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:03,422 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:03,422 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:27:03,422 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:27:03,422 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:27:03,422 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:27:03,423 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:03,423 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:27:03,423 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:03,423 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:27:03,423 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:27:03,423 WARN L170 areAnnotationChecker]: L29-3 has no Hoare annotation [2020-07-10 15:27:03,423 WARN L170 areAnnotationChecker]: L49-1 has no Hoare annotation [2020-07-10 15:27:03,424 WARN L170 areAnnotationChecker]: L29-4 has no Hoare annotation [2020-07-10 15:27:03,424 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:27:03,424 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2020-07-10 15:27:03,424 WARN L170 areAnnotationChecker]: L47-2 has no Hoare annotation [2020-07-10 15:27:03,424 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:27:03,424 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:27:03,424 WARN L170 areAnnotationChecker]: L38-3 has no Hoare annotation [2020-07-10 15:27:03,424 WARN L170 areAnnotationChecker]: L29-2 has no Hoare annotation [2020-07-10 15:27:03,425 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-10 15:27:03,425 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-10 15:27:03,425 WARN L170 areAnnotationChecker]: L47-3 has no Hoare annotation [2020-07-10 15:27:03,425 WARN L170 areAnnotationChecker]: L38-4 has no Hoare annotation [2020-07-10 15:27:03,425 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 15:27:03,425 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2020-07-10 15:27:03,425 WARN L170 areAnnotationChecker]: L47-4 has no Hoare annotation [2020-07-10 15:27:03,425 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:27:03,426 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2020-07-10 15:27:03,426 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2020-07-10 15:27:03,426 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-10 15:27:03,428 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:27:03 BoogieIcfgContainer [2020-07-10 15:27:03,428 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:27:03,431 INFO L168 Benchmark]: Toolchain (without parser) took 47421.77 ms. Allocated memory was 138.9 MB in the beginning and 309.9 MB in the end (delta: 170.9 MB). Free memory was 103.2 MB in the beginning and 104.1 MB in the end (delta: -844.5 kB). Peak memory consumption was 170.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:03,431 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:27:03,432 INFO L168 Benchmark]: CACSL2BoogieTranslator took 308.38 ms. Allocated memory is still 138.9 MB. Free memory was 103.0 MB in the beginning and 92.0 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:03,433 INFO L168 Benchmark]: Boogie Preprocessor took 148.66 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.0 MB in the beginning and 180.3 MB in the end (delta: -88.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:03,433 INFO L168 Benchmark]: RCFGBuilder took 492.40 ms. Allocated memory is still 202.9 MB. Free memory was 180.3 MB in the beginning and 155.0 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:03,434 INFO L168 Benchmark]: TraceAbstraction took 46467.03 ms. Allocated memory was 202.9 MB in the beginning and 309.9 MB in the end (delta: 107.0 MB). Free memory was 154.4 MB in the beginning and 104.1 MB in the end (delta: 50.3 MB). Peak memory consumption was 157.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:03,436 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.22 ms. Allocated memory is still 138.9 MB. Free memory was 122.0 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 308.38 ms. Allocated memory is still 138.9 MB. Free memory was 103.0 MB in the beginning and 92.0 MB in the end (delta: 11.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 148.66 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.0 MB in the beginning and 180.3 MB in the end (delta: -88.3 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 492.40 ms. Allocated memory is still 202.9 MB. Free memory was 180.3 MB in the beginning and 155.0 MB in the end (delta: 25.3 MB). Peak memory consumption was 25.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 46467.03 ms. Allocated memory was 202.9 MB in the beginning and 309.9 MB in the end (delta: 107.0 MB). Free memory was 154.4 MB in the beginning and 104.1 MB in the end (delta: 50.3 MB). Peak memory consumption was 157.2 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)={-2:0}, malloc(sizeof(long long)*N)={-1:0}, N=3] [L29] COND TRUE i