/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/s4iff.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:45:10,640 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:45:10,642 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:45:10,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:45:10,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:45:10,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:45:10,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:45:10,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:45:10,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:45:10,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:45:10,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:45:10,665 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:45:10,665 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:45:10,666 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:45:10,668 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:45:10,670 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:45:10,671 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:45:10,672 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:45:10,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:45:10,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:45:10,677 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:45:10,678 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:45:10,679 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:45:10,680 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:45:10,683 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:45:10,683 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:45:10,683 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:45:10,685 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:45:10,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:45:10,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:45:10,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:45:10,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:45:10,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:45:10,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:45:10,691 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:45:10,691 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:45:10,692 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:45:10,692 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:45:10,692 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:45:10,693 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:45:10,694 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:45:10,696 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-08 12:45:10,720 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:45:10,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:45:10,724 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:45:10,724 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:45:10,724 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:45:10,725 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:45:10,725 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:45:10,725 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:45:10,725 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:45:10,725 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:45:10,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:45:10,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:45:10,727 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:45:10,728 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:45:10,728 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:45:10,728 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:45:10,728 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:45:10,729 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:45:10,729 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:45:10,729 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:45:10,730 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:45:10,730 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:45:10,730 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:45:10,730 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:45:10,730 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:45:10,731 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:45:10,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:45:10,731 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:45:10,731 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:45:10,731 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:45:11,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:45:11,061 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:45:11,065 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:45:11,067 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:45:11,068 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:45:11,069 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-fpi/s4iff.c [2020-07-08 12:45:11,164 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e870b9d30/6c7bf2b7c14e4e0ba848aecc47132015/FLAGc00238fe9 [2020-07-08 12:45:11,674 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:45:11,675 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s4iff.c [2020-07-08 12:45:11,683 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e870b9d30/6c7bf2b7c14e4e0ba848aecc47132015/FLAGc00238fe9 [2020-07-08 12:45:12,062 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e870b9d30/6c7bf2b7c14e4e0ba848aecc47132015 [2020-07-08 12:45:12,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:45:12,074 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:45:12,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:45:12,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:45:12,079 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:45:12,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:45:12" (1/1) ... [2020-07-08 12:45:12,085 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b42804f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:12, skipping insertion in model container [2020-07-08 12:45:12,085 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:45:12" (1/1) ... [2020-07-08 12:45:12,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:45:12,120 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:45:12,345 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:45:12,355 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:45:12,380 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:45:12,482 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:45:12,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:12 WrapperNode [2020-07-08 12:45:12,483 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:45:12,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:45:12,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:45:12,484 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:45:12,499 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:12" (1/1) ... [2020-07-08 12:45:12,499 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:12" (1/1) ... [2020-07-08 12:45:12,509 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:12" (1/1) ... [2020-07-08 12:45:12,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:12" (1/1) ... [2020-07-08 12:45:12,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:12" (1/1) ... [2020-07-08 12:45:12,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:12" (1/1) ... [2020-07-08 12:45:12,529 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:12" (1/1) ... [2020-07-08 12:45:12,531 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:45:12,532 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:45:12,532 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:45:12,532 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:45:12,533 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:12" (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-08 12:45:12,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:45:12,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:45:12,604 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-08 12:45:12,604 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:45:12,604 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:45:12,604 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:45:12,605 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-08 12:45:12,605 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-08 12:45:12,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:45:12,605 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 12:45:12,605 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-08 12:45:12,605 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:45:12,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 12:45:12,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-08 12:45:12,606 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 12:45:12,606 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 12:45:12,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 12:45:12,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:45:12,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:45:13,041 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:45:13,042 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-08 12:45:13,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:13 BoogieIcfgContainer [2020-07-08 12:45:13,048 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:45:13,049 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:45:13,049 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:45:13,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:45:13,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:45:12" (1/3) ... [2020-07-08 12:45:13,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3f2f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:13, skipping insertion in model container [2020-07-08 12:45:13,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:12" (2/3) ... [2020-07-08 12:45:13,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b3f2f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:13, skipping insertion in model container [2020-07-08 12:45:13,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:13" (3/3) ... [2020-07-08 12:45:13,056 INFO L109 eAbstractionObserver]: Analyzing ICFG s4iff.c [2020-07-08 12:45:13,067 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:45:13,076 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:45:13,089 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:45:13,115 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:45:13,115 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:45:13,115 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:45:13,115 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:45:13,116 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:45:13,116 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:45:13,116 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:45:13,116 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:45:13,134 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2020-07-08 12:45:13,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:45:13,141 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:13,142 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] [2020-07-08 12:45:13,142 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:13,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:13,147 INFO L82 PathProgramCache]: Analyzing trace with hash -432131487, now seen corresponding path program 1 times [2020-07-08 12:45:13,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:13,156 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509175565] [2020-07-08 12:45:13,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:13,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:13,372 INFO L280 TraceCheckUtils]: 0: Hoare triple {44#(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; {35#true} is VALID [2020-07-08 12:45:13,372 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-08 12:45:13,373 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #72#return; {35#true} is VALID [2020-07-08 12:45:13,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:13,388 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2020-07-08 12:45:13,389 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2020-07-08 12:45:13,389 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2020-07-08 12:45:13,390 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #68#return; {36#false} is VALID [2020-07-08 12:45:13,392 INFO L263 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {44#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:45:13,392 INFO L280 TraceCheckUtils]: 1: Hoare triple {44#(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; {35#true} is VALID [2020-07-08 12:45:13,393 INFO L280 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-08 12:45:13,393 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #72#return; {35#true} is VALID [2020-07-08 12:45:13,393 INFO L263 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret10 := main(); {35#true} is VALID [2020-07-08 12:45:13,394 INFO L280 TraceCheckUtils]: 5: Hoare triple {35#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {35#true} is VALID [2020-07-08 12:45:13,394 INFO L280 TraceCheckUtils]: 6: Hoare triple {35#true} assume !(~N~0 <= 0); {35#true} is VALID [2020-07-08 12:45:13,395 INFO L263 TraceCheckUtils]: 7: Hoare triple {35#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {35#true} is VALID [2020-07-08 12:45:13,395 INFO L280 TraceCheckUtils]: 8: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2020-07-08 12:45:13,396 INFO L280 TraceCheckUtils]: 9: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2020-07-08 12:45:13,397 INFO L280 TraceCheckUtils]: 10: Hoare triple {36#false} assume true; {36#false} is VALID [2020-07-08 12:45:13,397 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {36#false} {35#true} #68#return; {36#false} is VALID [2020-07-08 12:45:13,398 INFO L280 TraceCheckUtils]: 12: Hoare triple {36#false} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {36#false} is VALID [2020-07-08 12:45:13,398 INFO L280 TraceCheckUtils]: 13: Hoare triple {36#false} assume !(~i~0 < ~N~0); {36#false} is VALID [2020-07-08 12:45:13,398 INFO L280 TraceCheckUtils]: 14: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2020-07-08 12:45:13,399 INFO L280 TraceCheckUtils]: 15: Hoare triple {36#false} assume !(~i~0 < ~N~0); {36#false} is VALID [2020-07-08 12:45:13,399 INFO L280 TraceCheckUtils]: 16: Hoare triple {36#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {36#false} is VALID [2020-07-08 12:45:13,400 INFO L263 TraceCheckUtils]: 17: Hoare triple {36#false} call __VERIFIER_assert((if #t~mem9 == 5 * ~N~0 then 1 else 0)); {36#false} is VALID [2020-07-08 12:45:13,400 INFO L280 TraceCheckUtils]: 18: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2020-07-08 12:45:13,400 INFO L280 TraceCheckUtils]: 19: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2020-07-08 12:45:13,401 INFO L280 TraceCheckUtils]: 20: Hoare triple {36#false} assume !false; {36#false} is VALID [2020-07-08 12:45:13,404 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-08 12:45:13,405 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509175565] [2020-07-08 12:45:13,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:13,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:45:13,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312977079] [2020-07-08 12:45:13,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:45:13,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:13,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:45:13,473 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:13,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:45:13,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:13,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:45:13,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:45:13,487 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2020-07-08 12:45:13,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:13,686 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2020-07-08 12:45:13,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:45:13,686 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-08 12:45:13,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:13,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:45:13,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2020-07-08 12:45:13,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:45:13,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2020-07-08 12:45:13,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 67 transitions. [2020-07-08 12:45:13,823 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-08 12:45:13,835 INFO L225 Difference]: With dead ends: 54 [2020-07-08 12:45:13,836 INFO L226 Difference]: Without dead ends: 25 [2020-07-08 12:45:13,839 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-08 12:45:13,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-08 12:45:13,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-08 12:45:13,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:13,897 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-08 12:45:13,898 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-08 12:45:13,898 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-08 12:45:13,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:13,902 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-08 12:45:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-08 12:45:13,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:13,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:13,904 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-08 12:45:13,904 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-08 12:45:13,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:13,922 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-08 12:45:13,922 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-08 12:45:13,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:13,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:13,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:13,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:13,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-08 12:45:13,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-08 12:45:13,929 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2020-07-08 12:45:13,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:13,929 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-08 12:45:13,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:45:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-08 12:45:13,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-08 12:45:13,931 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:13,931 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] [2020-07-08 12:45:13,932 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:45:13,932 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:13,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:13,933 INFO L82 PathProgramCache]: Analyzing trace with hash -173966049, now seen corresponding path program 1 times [2020-07-08 12:45:13,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:13,933 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451926464] [2020-07-08 12:45:13,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:13,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:14,067 INFO L280 TraceCheckUtils]: 0: Hoare triple {211#(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; {200#true} is VALID [2020-07-08 12:45:14,068 INFO L280 TraceCheckUtils]: 1: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-08 12:45:14,068 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {200#true} {200#true} #72#return; {200#true} is VALID [2020-07-08 12:45:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:14,078 INFO L280 TraceCheckUtils]: 0: Hoare triple {200#true} ~cond := #in~cond; {200#true} is VALID [2020-07-08 12:45:14,079 INFO L280 TraceCheckUtils]: 1: Hoare triple {200#true} assume !(0 == ~cond); {200#true} is VALID [2020-07-08 12:45:14,079 INFO L280 TraceCheckUtils]: 2: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-08 12:45:14,080 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {200#true} {205#(<= 1 ~N~0)} #68#return; {205#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:14,082 INFO L263 TraceCheckUtils]: 0: Hoare triple {200#true} call ULTIMATE.init(); {211#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:45:14,082 INFO L280 TraceCheckUtils]: 1: Hoare triple {211#(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; {200#true} is VALID [2020-07-08 12:45:14,082 INFO L280 TraceCheckUtils]: 2: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-08 12:45:14,083 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {200#true} {200#true} #72#return; {200#true} is VALID [2020-07-08 12:45:14,083 INFO L263 TraceCheckUtils]: 4: Hoare triple {200#true} call #t~ret10 := main(); {200#true} is VALID [2020-07-08 12:45:14,083 INFO L280 TraceCheckUtils]: 5: Hoare triple {200#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {200#true} is VALID [2020-07-08 12:45:14,085 INFO L280 TraceCheckUtils]: 6: Hoare triple {200#true} assume !(~N~0 <= 0); {205#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:14,085 INFO L263 TraceCheckUtils]: 7: Hoare triple {205#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {200#true} is VALID [2020-07-08 12:45:14,085 INFO L280 TraceCheckUtils]: 8: Hoare triple {200#true} ~cond := #in~cond; {200#true} is VALID [2020-07-08 12:45:14,086 INFO L280 TraceCheckUtils]: 9: Hoare triple {200#true} assume !(0 == ~cond); {200#true} is VALID [2020-07-08 12:45:14,086 INFO L280 TraceCheckUtils]: 10: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-08 12:45:14,087 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {200#true} {205#(<= 1 ~N~0)} #68#return; {205#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:14,088 INFO L280 TraceCheckUtils]: 12: Hoare triple {205#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {210#(and (= 0 main_~i~0) (<= 1 ~N~0))} is VALID [2020-07-08 12:45:14,090 INFO L280 TraceCheckUtils]: 13: Hoare triple {210#(and (= 0 main_~i~0) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {201#false} is VALID [2020-07-08 12:45:14,090 INFO L280 TraceCheckUtils]: 14: Hoare triple {201#false} ~i~0 := 0; {201#false} is VALID [2020-07-08 12:45:14,091 INFO L280 TraceCheckUtils]: 15: Hoare triple {201#false} assume !(~i~0 < ~N~0); {201#false} is VALID [2020-07-08 12:45:14,091 INFO L280 TraceCheckUtils]: 16: Hoare triple {201#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {201#false} is VALID [2020-07-08 12:45:14,091 INFO L263 TraceCheckUtils]: 17: Hoare triple {201#false} call __VERIFIER_assert((if #t~mem9 == 5 * ~N~0 then 1 else 0)); {201#false} is VALID [2020-07-08 12:45:14,091 INFO L280 TraceCheckUtils]: 18: Hoare triple {201#false} ~cond := #in~cond; {201#false} is VALID [2020-07-08 12:45:14,092 INFO L280 TraceCheckUtils]: 19: Hoare triple {201#false} assume 0 == ~cond; {201#false} is VALID [2020-07-08 12:45:14,092 INFO L280 TraceCheckUtils]: 20: Hoare triple {201#false} assume !false; {201#false} is VALID [2020-07-08 12:45:14,093 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-08 12:45:14,094 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451926464] [2020-07-08 12:45:14,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:14,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:45:14,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990277549] [2020-07-08 12:45:14,096 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-08 12:45:14,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:14,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:45:14,126 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:14,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:45:14,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:14,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:45:14,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:45:14,128 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2020-07-08 12:45:14,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:14,365 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-08 12:45:14,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 12:45:14,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-08 12:45:14,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:14,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:45:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2020-07-08 12:45:14,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:45:14,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2020-07-08 12:45:14,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2020-07-08 12:45:14,442 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:14,444 INFO L225 Difference]: With dead ends: 40 [2020-07-08 12:45:14,444 INFO L226 Difference]: Without dead ends: 30 [2020-07-08 12:45:14,445 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:45:14,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-08 12:45:14,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2020-07-08 12:45:14,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:14,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 27 states. [2020-07-08 12:45:14,469 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 27 states. [2020-07-08 12:45:14,469 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 27 states. [2020-07-08 12:45:14,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:14,473 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-08 12:45:14,473 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-08 12:45:14,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:14,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:14,476 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 30 states. [2020-07-08 12:45:14,476 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 30 states. [2020-07-08 12:45:14,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:14,480 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-08 12:45:14,481 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-08 12:45:14,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:14,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:14,481 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:14,482 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:14,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-08 12:45:14,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-08 12:45:14,492 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 21 [2020-07-08 12:45:14,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:14,492 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-08 12:45:14,492 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:45:14,492 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-08 12:45:14,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 12:45:14,493 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:14,494 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] [2020-07-08 12:45:14,494 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:45:14,494 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:14,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:14,495 INFO L82 PathProgramCache]: Analyzing trace with hash -445719797, now seen corresponding path program 1 times [2020-07-08 12:45:14,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:14,496 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077441725] [2020-07-08 12:45:14,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:15,410 INFO L280 TraceCheckUtils]: 0: Hoare triple {390#(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; {371#true} is VALID [2020-07-08 12:45:15,410 INFO L280 TraceCheckUtils]: 1: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-08 12:45:15,410 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {371#true} {371#true} #72#return; {371#true} is VALID [2020-07-08 12:45:15,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:15,418 INFO L280 TraceCheckUtils]: 0: Hoare triple {371#true} ~cond := #in~cond; {371#true} is VALID [2020-07-08 12:45:15,419 INFO L280 TraceCheckUtils]: 1: Hoare triple {371#true} assume !(0 == ~cond); {371#true} is VALID [2020-07-08 12:45:15,420 INFO L280 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-08 12:45:15,420 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {371#true} {376#(<= 1 ~N~0)} #68#return; {376#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:15,421 INFO L263 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {390#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:45:15,422 INFO L280 TraceCheckUtils]: 1: Hoare triple {390#(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; {371#true} is VALID [2020-07-08 12:45:15,422 INFO L280 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-08 12:45:15,422 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #72#return; {371#true} is VALID [2020-07-08 12:45:15,423 INFO L263 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret10 := main(); {371#true} is VALID [2020-07-08 12:45:15,423 INFO L280 TraceCheckUtils]: 5: Hoare triple {371#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {371#true} is VALID [2020-07-08 12:45:15,424 INFO L280 TraceCheckUtils]: 6: Hoare triple {371#true} assume !(~N~0 <= 0); {376#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:15,424 INFO L263 TraceCheckUtils]: 7: Hoare triple {376#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {371#true} is VALID [2020-07-08 12:45:15,425 INFO L280 TraceCheckUtils]: 8: Hoare triple {371#true} ~cond := #in~cond; {371#true} is VALID [2020-07-08 12:45:15,425 INFO L280 TraceCheckUtils]: 9: Hoare triple {371#true} assume !(0 == ~cond); {371#true} is VALID [2020-07-08 12:45:15,425 INFO L280 TraceCheckUtils]: 10: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-08 12:45:15,427 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {371#true} {376#(<= 1 ~N~0)} #68#return; {376#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:15,429 INFO L280 TraceCheckUtils]: 12: Hoare triple {376#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {381#(and (= 0 main_~i~0) (or (< 536870911 ~N~0) (and (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 4)) |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))))} is VALID [2020-07-08 12:45:15,431 INFO L280 TraceCheckUtils]: 13: Hoare triple {381#(and (= 0 main_~i~0) (or (< 536870911 ~N~0) (and (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 4)) |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))))} assume !!(~i~0 < ~N~0);call write~int(4, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {381#(and (= 0 main_~i~0) (or (< 536870911 ~N~0) (and (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 4)) |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))))} is VALID [2020-07-08 12:45:15,433 INFO L280 TraceCheckUtils]: 14: Hoare triple {381#(and (= 0 main_~i~0) (or (< 536870911 ~N~0) (and (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select (store |#memory_int| main_~a~0.base (store (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset) 4)) |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {382#(and (or (< 536870911 ~N~0) (and (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))) (or (<= (+ main_~i~0 536870911) ~N~0) (<= ~N~0 536870911)))} is VALID [2020-07-08 12:45:15,434 INFO L280 TraceCheckUtils]: 15: Hoare triple {382#(and (or (< 536870911 ~N~0) (and (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (<= main_~i~0 1) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))) (or (<= (+ main_~i~0 536870911) ~N~0) (<= ~N~0 536870911)))} assume !(~i~0 < ~N~0); {383#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-08 12:45:15,436 INFO L280 TraceCheckUtils]: 16: Hoare triple {383#(and (<= ~N~0 1) (<= 1 ~N~0) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} ~i~0 := 0; {384#(and (or (not (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)) (* 5 ~N~0))) (<= ~N~0 536870911) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-08 12:45:15,438 INFO L280 TraceCheckUtils]: 17: Hoare triple {384#(and (or (not (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)) (* 5 ~N~0))) (<= ~N~0 536870911) (not (= main_~a~0.base |main_~#sum~0.base|)) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {385#(and (or (not (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)) (* 5 ~N~0))) (<= ~N~0 536870911) (not (= main_~a~0.base |main_~#sum~0.base|)) (or (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= |main_#t~mem4| (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} is VALID [2020-07-08 12:45:15,439 INFO L280 TraceCheckUtils]: 18: Hoare triple {385#(and (or (not (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)))) (= (+ (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)) (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)) (* 5 ~N~0))) (<= ~N~0 536870911) (not (= main_~a~0.base |main_~#sum~0.base|)) (or (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (= |main_#t~mem4| (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset)))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1))} assume 4 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem5;havoc #t~mem6; {386#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0)) (<= ~N~0 536870911))} is VALID [2020-07-08 12:45:15,440 INFO L280 TraceCheckUtils]: 19: Hoare triple {386#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0)) (<= ~N~0 536870911))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {386#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0)) (<= ~N~0 536870911))} is VALID [2020-07-08 12:45:15,441 INFO L280 TraceCheckUtils]: 20: Hoare triple {386#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0)) (<= ~N~0 536870911))} assume !(~i~0 < ~N~0); {386#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0)) (<= ~N~0 536870911))} is VALID [2020-07-08 12:45:15,442 INFO L280 TraceCheckUtils]: 21: Hoare triple {386#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0)) (<= ~N~0 536870911))} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {387#(and (= |main_#t~mem9| (* 5 ~N~0)) (<= ~N~0 536870911))} is VALID [2020-07-08 12:45:15,443 INFO L263 TraceCheckUtils]: 22: Hoare triple {387#(and (= |main_#t~mem9| (* 5 ~N~0)) (<= ~N~0 536870911))} call __VERIFIER_assert((if #t~mem9 == 5 * ~N~0 then 1 else 0)); {388#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:45:15,444 INFO L280 TraceCheckUtils]: 23: Hoare triple {388#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {389#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:45:15,445 INFO L280 TraceCheckUtils]: 24: Hoare triple {389#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {372#false} is VALID [2020-07-08 12:45:15,445 INFO L280 TraceCheckUtils]: 25: Hoare triple {372#false} assume !false; {372#false} is VALID [2020-07-08 12:45:15,449 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:15,449 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077441725] [2020-07-08 12:45:15,450 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1290553535] [2020-07-08 12:45:15,450 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-08 12:45:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:15,501 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-08 12:45:15,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:15,522 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:45:15,630 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-08 12:45:15,631 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:45:15,645 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:45:15,646 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:45:15,646 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2020-07-08 12:45:15,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:45:15,736 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 0 case distinctions, treesize of input 23 treesize of output 22 [2020-07-08 12:45:15,740 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:45:15,757 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:45:15,758 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:45:15,758 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2020-07-08 12:45:16,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:45:16,264 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:45:16,265 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 1 case distinctions, treesize of input 55 treesize of output 57 [2020-07-08 12:45:16,288 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:45:16,328 INFO L624 ElimStorePlain]: treesize reduction 24, result has 65.7 percent of original size [2020-07-08 12:45:16,349 INFO L544 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-07-08 12:45:16,350 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:71, output treesize:46 [2020-07-08 12:45:16,364 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:45:16,365 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_15|, main_~a~0.base, main_~i~0, main_~a~0.offset, v_main_~i~0_15]. (let ((.cse0 (select |v_#memory_int_15| main_~a~0.base)) (.cse3 (select |v_#memory_int_15| |main_~#sum~0.base|))) (let ((.cse2 (select .cse3 |main_~#sum~0.offset|)) (.cse1 (select .cse0 (+ (* main_~i~0 4) main_~a~0.offset)))) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 4 (select .cse0 (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= v_main_~i~0_15 0) (= 4 .cse1) (<= 1 ~N~0) (= 1 .cse2) (= (store |v_#memory_int_15| |main_~#sum~0.base| (store .cse3 |main_~#sum~0.offset| (+ .cse2 .cse1))) |#memory_int|) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|)))) [2020-07-08 12:45:16,365 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [main_~a~0.base, main_~i~0, main_~a~0.offset, v_main_~i~0_15]. (let ((.cse0 (select |#memory_int| main_~a~0.base))) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 4 (select .cse0 (+ (* main_~i~0 4) main_~a~0.offset))) (<= v_main_~i~0_15 0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 5) (<= 1 ~N~0) (= 4 (select .cse0 (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) [2020-07-08 12:45:16,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-08 12:45:16,704 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:45:16,705 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 29 [2020-07-08 12:45:16,708 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-08 12:45:16,718 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-08 12:45:16,725 INFO L544 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-08 12:45:16,725 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:53, output treesize:10 [2020-07-08 12:45:16,730 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-08 12:45:16,730 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~a~0.base, main_~i~0, main_~a~0.offset, v_main_~i~0_15, |main_~#sum~0.base|, |main_~#sum~0.offset|]. (let ((.cse1 (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|)) (.cse0 (select |#memory_int| main_~a~0.base))) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 4 (select .cse0 (+ (* main_~i~0 4) main_~a~0.offset))) (<= v_main_~i~0_15 0) (= .cse1 5) (= .cse1 |main_#t~mem9|) (<= 1 ~N~0) (= 4 (select .cse0 (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) [2020-07-08 12:45:16,731 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= ~N~0 1) (<= 1 ~N~0) (= 5 |main_#t~mem9|)) [2020-07-08 12:45:16,776 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:45:16,846 INFO L263 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {371#true} is VALID [2020-07-08 12:45:16,847 INFO L280 TraceCheckUtils]: 1: Hoare triple {371#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {371#true} is VALID [2020-07-08 12:45:16,847 INFO L280 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-08 12:45:16,848 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #72#return; {371#true} is VALID [2020-07-08 12:45:16,848 INFO L263 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret10 := main(); {371#true} is VALID [2020-07-08 12:45:16,848 INFO L280 TraceCheckUtils]: 5: Hoare triple {371#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {371#true} is VALID [2020-07-08 12:45:16,853 INFO L280 TraceCheckUtils]: 6: Hoare triple {371#true} assume !(~N~0 <= 0); {376#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:16,854 INFO L263 TraceCheckUtils]: 7: Hoare triple {376#(<= 1 ~N~0)} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {376#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:16,855 INFO L280 TraceCheckUtils]: 8: Hoare triple {376#(<= 1 ~N~0)} ~cond := #in~cond; {376#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:16,856 INFO L280 TraceCheckUtils]: 9: Hoare triple {376#(<= 1 ~N~0)} assume !(0 == ~cond); {376#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:16,857 INFO L280 TraceCheckUtils]: 10: Hoare triple {376#(<= 1 ~N~0)} assume true; {376#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:16,862 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {376#(<= 1 ~N~0)} {376#(<= 1 ~N~0)} #68#return; {376#(<= 1 ~N~0)} is VALID [2020-07-08 12:45:16,864 INFO L280 TraceCheckUtils]: 12: Hoare triple {376#(<= 1 ~N~0)} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {430#(and (<= main_~i~0 0) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-08 12:45:16,865 INFO L280 TraceCheckUtils]: 13: Hoare triple {430#(and (<= main_~i~0 0) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !!(~i~0 < ~N~0);call write~int(4, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {434#(and (<= main_~i~0 0) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-08 12:45:16,874 INFO L280 TraceCheckUtils]: 14: Hoare triple {434#(and (<= main_~i~0 0) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {438#(and (<= 1 ~N~0) (exists ((v_main_~i~0_15 Int)) (and (<= main_~i~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-08 12:45:16,876 INFO L280 TraceCheckUtils]: 15: Hoare triple {438#(and (<= 1 ~N~0) (exists ((v_main_~i~0_15 Int)) (and (<= main_~i~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))))) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !(~i~0 < ~N~0); {442#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (exists ((v_main_~i~0_15 Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-08 12:45:16,878 INFO L280 TraceCheckUtils]: 16: Hoare triple {442#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (exists ((v_main_~i~0_15 Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} ~i~0 := 0; {442#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (exists ((v_main_~i~0_15 Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-08 12:45:16,879 INFO L280 TraceCheckUtils]: 17: Hoare triple {442#(and (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (exists ((v_main_~i~0_15 Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {449#(and (= |main_#t~mem4| (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (exists ((v_main_~i~0_15 Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} is VALID [2020-07-08 12:45:16,890 INFO L280 TraceCheckUtils]: 18: Hoare triple {449#(and (= |main_#t~mem4| (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= 1 ~N~0) (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 1) (exists ((v_main_~i~0_15 Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (<= v_main_~i~0_15 0) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))} assume 4 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem5;havoc #t~mem6; {453#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 5) (exists ((main_~i~0 Int) (v_main_~i~0_15 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= v_main_~i~0_15 0) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (<= 1 ~N~0))} is VALID [2020-07-08 12:45:16,892 INFO L280 TraceCheckUtils]: 19: Hoare triple {453#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 5) (exists ((main_~i~0 Int) (v_main_~i~0_15 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= v_main_~i~0_15 0) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (<= 1 ~N~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {453#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 5) (exists ((main_~i~0 Int) (v_main_~i~0_15 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= v_main_~i~0_15 0) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (<= 1 ~N~0))} is VALID [2020-07-08 12:45:16,893 INFO L280 TraceCheckUtils]: 20: Hoare triple {453#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 5) (exists ((main_~i~0 Int) (v_main_~i~0_15 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= v_main_~i~0_15 0) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (<= 1 ~N~0))} assume !(~i~0 < ~N~0); {453#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 5) (exists ((main_~i~0 Int) (v_main_~i~0_15 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= v_main_~i~0_15 0) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (<= 1 ~N~0))} is VALID [2020-07-08 12:45:16,895 INFO L280 TraceCheckUtils]: 21: Hoare triple {453#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) 5) (exists ((main_~i~0 Int) (v_main_~i~0_15 Int) (main_~a~0.offset Int) (main_~a~0.base Int)) (and (<= ~N~0 (+ v_main_~i~0_15 1)) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* main_~i~0 4) main_~a~0.offset))) (<= v_main_~i~0_15 0) (= 4 (select (select |#memory_int| main_~a~0.base) (+ (* v_main_~i~0_15 4) main_~a~0.offset))) (<= (+ main_~a~0.base 2) |main_~#sum~0.base|))) (<= 1 ~N~0))} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {463#(and (<= ~N~0 1) (<= 1 ~N~0) (= 5 |main_#t~mem9|))} is VALID [2020-07-08 12:45:16,896 INFO L263 TraceCheckUtils]: 22: Hoare triple {463#(and (<= ~N~0 1) (<= 1 ~N~0) (= 5 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 == 5 * ~N~0 then 1 else 0)); {467#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:45:16,897 INFO L280 TraceCheckUtils]: 23: Hoare triple {467#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {471#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:45:16,897 INFO L280 TraceCheckUtils]: 24: Hoare triple {471#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {372#false} is VALID [2020-07-08 12:45:16,897 INFO L280 TraceCheckUtils]: 25: Hoare triple {372#false} assume !false; {372#false} is VALID [2020-07-08 12:45:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:16,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:45:16,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 22 [2020-07-08 12:45:16,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36601025] [2020-07-08 12:45:16,903 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2020-07-08 12:45:16,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:16,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states. [2020-07-08 12:45:17,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:17,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2020-07-08 12:45:17,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:17,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2020-07-08 12:45:17,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=393, Unknown=0, NotChecked=0, Total=462 [2020-07-08 12:45:17,463 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 22 states. [2020-07-08 12:45:20,991 WARN L193 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2020-07-08 12:45:21,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:21,393 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2020-07-08 12:45:21,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-08 12:45:21,393 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 26 [2020-07-08 12:45:21,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-08 12:45:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 55 transitions. [2020-07-08 12:45:21,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-08 12:45:21,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 55 transitions. [2020-07-08 12:45:21,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 55 transitions. [2020-07-08 12:45:24,734 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 54 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:24,738 INFO L225 Difference]: With dead ends: 49 [2020-07-08 12:45:24,739 INFO L226 Difference]: Without dead ends: 36 [2020-07-08 12:45:24,740 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2020-07-08 12:45:24,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-08 12:45:24,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2020-07-08 12:45:24,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:24,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 33 states. [2020-07-08 12:45:24,794 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 33 states. [2020-07-08 12:45:24,794 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 33 states. [2020-07-08 12:45:24,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:24,799 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-08 12:45:24,800 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-08 12:45:24,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:24,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:24,801 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 36 states. [2020-07-08 12:45:24,801 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 36 states. [2020-07-08 12:45:24,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:24,804 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-08 12:45:24,805 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-08 12:45:24,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:24,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:24,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:24,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:24,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-08 12:45:24,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2020-07-08 12:45:24,809 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 26 [2020-07-08 12:45:24,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:24,810 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2020-07-08 12:45:24,810 INFO L480 AbstractCegarLoop]: Interpolant automaton has 22 states. [2020-07-08 12:45:24,810 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2020-07-08 12:45:24,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-08 12:45:24,812 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:24,812 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-07-08 12:45:25,036 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-08 12:45:25,037 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:25,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:25,038 INFO L82 PathProgramCache]: Analyzing trace with hash 531279049, now seen corresponding path program 2 times [2020-07-08 12:45:25,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:25,039 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922282726] [2020-07-08 12:45:25,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:25,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:25,226 INFO L280 TraceCheckUtils]: 0: Hoare triple {698#(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; {684#true} is VALID [2020-07-08 12:45:25,227 INFO L280 TraceCheckUtils]: 1: Hoare triple {684#true} assume true; {684#true} is VALID [2020-07-08 12:45:25,227 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {684#true} {684#true} #72#return; {684#true} is VALID [2020-07-08 12:45:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:25,239 INFO L280 TraceCheckUtils]: 0: Hoare triple {684#true} ~cond := #in~cond; {684#true} is VALID [2020-07-08 12:45:25,240 INFO L280 TraceCheckUtils]: 1: Hoare triple {684#true} assume !(0 == ~cond); {684#true} is VALID [2020-07-08 12:45:25,241 INFO L280 TraceCheckUtils]: 2: Hoare triple {684#true} assume true; {684#true} is VALID [2020-07-08 12:45:25,241 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {684#true} {684#true} #68#return; {684#true} is VALID [2020-07-08 12:45:25,243 INFO L263 TraceCheckUtils]: 0: Hoare triple {684#true} call ULTIMATE.init(); {698#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:45:25,243 INFO L280 TraceCheckUtils]: 1: Hoare triple {698#(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; {684#true} is VALID [2020-07-08 12:45:25,243 INFO L280 TraceCheckUtils]: 2: Hoare triple {684#true} assume true; {684#true} is VALID [2020-07-08 12:45:25,244 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {684#true} {684#true} #72#return; {684#true} is VALID [2020-07-08 12:45:25,244 INFO L263 TraceCheckUtils]: 4: Hoare triple {684#true} call #t~ret10 := main(); {684#true} is VALID [2020-07-08 12:45:25,244 INFO L280 TraceCheckUtils]: 5: Hoare triple {684#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {684#true} is VALID [2020-07-08 12:45:25,245 INFO L280 TraceCheckUtils]: 6: Hoare triple {684#true} assume !(~N~0 <= 0); {684#true} is VALID [2020-07-08 12:45:25,245 INFO L263 TraceCheckUtils]: 7: Hoare triple {684#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {684#true} is VALID [2020-07-08 12:45:25,245 INFO L280 TraceCheckUtils]: 8: Hoare triple {684#true} ~cond := #in~cond; {684#true} is VALID [2020-07-08 12:45:25,245 INFO L280 TraceCheckUtils]: 9: Hoare triple {684#true} assume !(0 == ~cond); {684#true} is VALID [2020-07-08 12:45:25,246 INFO L280 TraceCheckUtils]: 10: Hoare triple {684#true} assume true; {684#true} is VALID [2020-07-08 12:45:25,246 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {684#true} {684#true} #68#return; {684#true} is VALID [2020-07-08 12:45:25,248 INFO L280 TraceCheckUtils]: 12: Hoare triple {684#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {693#(= 0 main_~i~0)} is VALID [2020-07-08 12:45:25,268 INFO L280 TraceCheckUtils]: 13: Hoare triple {693#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(4, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {693#(= 0 main_~i~0)} is VALID [2020-07-08 12:45:25,271 INFO L280 TraceCheckUtils]: 14: Hoare triple {693#(= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {694#(<= 1 main_~i~0)} is VALID [2020-07-08 12:45:25,273 INFO L280 TraceCheckUtils]: 15: Hoare triple {694#(<= 1 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(4, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {695#(<= 2 ~N~0)} is VALID [2020-07-08 12:45:25,274 INFO L280 TraceCheckUtils]: 16: Hoare triple {695#(<= 2 ~N~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {695#(<= 2 ~N~0)} is VALID [2020-07-08 12:45:25,274 INFO L280 TraceCheckUtils]: 17: Hoare triple {695#(<= 2 ~N~0)} assume !(~i~0 < ~N~0); {695#(<= 2 ~N~0)} is VALID [2020-07-08 12:45:25,275 INFO L280 TraceCheckUtils]: 18: Hoare triple {695#(<= 2 ~N~0)} ~i~0 := 0; {696#(and (<= 2 ~N~0) (= 0 main_~i~0))} is VALID [2020-07-08 12:45:25,276 INFO L280 TraceCheckUtils]: 19: Hoare triple {696#(and (<= 2 ~N~0) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {696#(and (<= 2 ~N~0) (= 0 main_~i~0))} is VALID [2020-07-08 12:45:25,277 INFO L280 TraceCheckUtils]: 20: Hoare triple {696#(and (<= 2 ~N~0) (= 0 main_~i~0))} assume 4 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem5;havoc #t~mem6; {696#(and (<= 2 ~N~0) (= 0 main_~i~0))} is VALID [2020-07-08 12:45:25,278 INFO L280 TraceCheckUtils]: 21: Hoare triple {696#(and (<= 2 ~N~0) (= 0 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {697#(<= (+ main_~i~0 1) ~N~0)} is VALID [2020-07-08 12:45:25,279 INFO L280 TraceCheckUtils]: 22: Hoare triple {697#(<= (+ main_~i~0 1) ~N~0)} assume !(~i~0 < ~N~0); {685#false} is VALID [2020-07-08 12:45:25,280 INFO L280 TraceCheckUtils]: 23: Hoare triple {685#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {685#false} is VALID [2020-07-08 12:45:25,280 INFO L263 TraceCheckUtils]: 24: Hoare triple {685#false} call __VERIFIER_assert((if #t~mem9 == 5 * ~N~0 then 1 else 0)); {685#false} is VALID [2020-07-08 12:45:25,280 INFO L280 TraceCheckUtils]: 25: Hoare triple {685#false} ~cond := #in~cond; {685#false} is VALID [2020-07-08 12:45:25,280 INFO L280 TraceCheckUtils]: 26: Hoare triple {685#false} assume 0 == ~cond; {685#false} is VALID [2020-07-08 12:45:25,281 INFO L280 TraceCheckUtils]: 27: Hoare triple {685#false} assume !false; {685#false} is VALID [2020-07-08 12:45:25,282 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:25,283 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922282726] [2020-07-08 12:45:25,283 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607577035] [2020-07-08 12:45:25,283 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 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-08 12:45:25,330 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:45:25,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:45:25,332 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-08 12:45:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:25,346 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:45:25,474 INFO L263 TraceCheckUtils]: 0: Hoare triple {684#true} call ULTIMATE.init(); {684#true} is VALID [2020-07-08 12:45:25,475 INFO L280 TraceCheckUtils]: 1: Hoare triple {684#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {684#true} is VALID [2020-07-08 12:45:25,475 INFO L280 TraceCheckUtils]: 2: Hoare triple {684#true} assume true; {684#true} is VALID [2020-07-08 12:45:25,475 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {684#true} {684#true} #72#return; {684#true} is VALID [2020-07-08 12:45:25,475 INFO L263 TraceCheckUtils]: 4: Hoare triple {684#true} call #t~ret10 := main(); {684#true} is VALID [2020-07-08 12:45:25,476 INFO L280 TraceCheckUtils]: 5: Hoare triple {684#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {684#true} is VALID [2020-07-08 12:45:25,476 INFO L280 TraceCheckUtils]: 6: Hoare triple {684#true} assume !(~N~0 <= 0); {684#true} is VALID [2020-07-08 12:45:25,476 INFO L263 TraceCheckUtils]: 7: Hoare triple {684#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {684#true} is VALID [2020-07-08 12:45:25,476 INFO L280 TraceCheckUtils]: 8: Hoare triple {684#true} ~cond := #in~cond; {684#true} is VALID [2020-07-08 12:45:25,477 INFO L280 TraceCheckUtils]: 9: Hoare triple {684#true} assume !(0 == ~cond); {684#true} is VALID [2020-07-08 12:45:25,477 INFO L280 TraceCheckUtils]: 10: Hoare triple {684#true} assume true; {684#true} is VALID [2020-07-08 12:45:25,477 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {684#true} {684#true} #68#return; {684#true} is VALID [2020-07-08 12:45:25,479 INFO L280 TraceCheckUtils]: 12: Hoare triple {684#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {738#(<= 0 main_~i~0)} is VALID [2020-07-08 12:45:25,480 INFO L280 TraceCheckUtils]: 13: Hoare triple {738#(<= 0 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(4, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {738#(<= 0 main_~i~0)} is VALID [2020-07-08 12:45:25,482 INFO L280 TraceCheckUtils]: 14: Hoare triple {738#(<= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {694#(<= 1 main_~i~0)} is VALID [2020-07-08 12:45:25,484 INFO L280 TraceCheckUtils]: 15: Hoare triple {694#(<= 1 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(4, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {695#(<= 2 ~N~0)} is VALID [2020-07-08 12:45:25,486 INFO L280 TraceCheckUtils]: 16: Hoare triple {695#(<= 2 ~N~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {695#(<= 2 ~N~0)} is VALID [2020-07-08 12:45:25,486 INFO L280 TraceCheckUtils]: 17: Hoare triple {695#(<= 2 ~N~0)} assume !(~i~0 < ~N~0); {695#(<= 2 ~N~0)} is VALID [2020-07-08 12:45:25,487 INFO L280 TraceCheckUtils]: 18: Hoare triple {695#(<= 2 ~N~0)} ~i~0 := 0; {757#(and (<= main_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-08 12:45:25,488 INFO L280 TraceCheckUtils]: 19: Hoare triple {757#(and (<= main_~i~0 0) (<= 2 ~N~0))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {757#(and (<= main_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-08 12:45:25,489 INFO L280 TraceCheckUtils]: 20: Hoare triple {757#(and (<= main_~i~0 0) (<= 2 ~N~0))} assume 4 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem5;havoc #t~mem6; {757#(and (<= main_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-08 12:45:25,490 INFO L280 TraceCheckUtils]: 21: Hoare triple {757#(and (<= main_~i~0 0) (<= 2 ~N~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {767#(and (<= 2 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-08 12:45:25,491 INFO L280 TraceCheckUtils]: 22: Hoare triple {767#(and (<= 2 ~N~0) (<= main_~i~0 1))} assume !(~i~0 < ~N~0); {685#false} is VALID [2020-07-08 12:45:25,492 INFO L280 TraceCheckUtils]: 23: Hoare triple {685#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {685#false} is VALID [2020-07-08 12:45:25,492 INFO L263 TraceCheckUtils]: 24: Hoare triple {685#false} call __VERIFIER_assert((if #t~mem9 == 5 * ~N~0 then 1 else 0)); {685#false} is VALID [2020-07-08 12:45:25,492 INFO L280 TraceCheckUtils]: 25: Hoare triple {685#false} ~cond := #in~cond; {685#false} is VALID [2020-07-08 12:45:25,492 INFO L280 TraceCheckUtils]: 26: Hoare triple {685#false} assume 0 == ~cond; {685#false} is VALID [2020-07-08 12:45:25,492 INFO L280 TraceCheckUtils]: 27: Hoare triple {685#false} assume !false; {685#false} is VALID [2020-07-08 12:45:25,493 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:25,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:45:25,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-08 12:45:25,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355675549] [2020-07-08 12:45:25,495 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-08 12:45:25,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:25,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:45:25,558 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:25,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:45:25,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:25,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:45:25,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:45:25,560 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 11 states. [2020-07-08 12:45:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:26,371 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-07-08 12:45:26,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 12:45:26,371 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-08 12:45:26,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:26,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:45:26,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2020-07-08 12:45:26,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:45:26,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2020-07-08 12:45:26,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2020-07-08 12:45:26,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:26,467 INFO L225 Difference]: With dead ends: 45 [2020-07-08 12:45:26,467 INFO L226 Difference]: Without dead ends: 39 [2020-07-08 12:45:26,469 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=177, Unknown=0, NotChecked=0, Total=240 [2020-07-08 12:45:26,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-08 12:45:26,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2020-07-08 12:45:26,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:26,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 35 states. [2020-07-08 12:45:26,516 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 35 states. [2020-07-08 12:45:26,517 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 35 states. [2020-07-08 12:45:26,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:26,519 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-08 12:45:26,520 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-08 12:45:26,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:26,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:26,521 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 39 states. [2020-07-08 12:45:26,521 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 39 states. [2020-07-08 12:45:26,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:26,524 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-08 12:45:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-08 12:45:26,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:26,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:26,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:26,526 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-08 12:45:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-08 12:45:26,528 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2020-07-08 12:45:26,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:26,528 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-08 12:45:26,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:45:26,529 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-08 12:45:26,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-08 12:45:26,530 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:26,531 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] [2020-07-08 12:45:26,743 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:26,745 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:26,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:26,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1018004383, now seen corresponding path program 3 times [2020-07-08 12:45:26,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:26,747 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494538183] [2020-07-08 12:45:26,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:26,903 INFO L280 TraceCheckUtils]: 0: Hoare triple {1000#(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; {986#true} is VALID [2020-07-08 12:45:26,904 INFO L280 TraceCheckUtils]: 1: Hoare triple {986#true} assume true; {986#true} is VALID [2020-07-08 12:45:26,904 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {986#true} {986#true} #72#return; {986#true} is VALID [2020-07-08 12:45:26,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:26,910 INFO L280 TraceCheckUtils]: 0: Hoare triple {986#true} ~cond := #in~cond; {986#true} is VALID [2020-07-08 12:45:26,910 INFO L280 TraceCheckUtils]: 1: Hoare triple {986#true} assume !(0 == ~cond); {986#true} is VALID [2020-07-08 12:45:26,910 INFO L280 TraceCheckUtils]: 2: Hoare triple {986#true} assume true; {986#true} is VALID [2020-07-08 12:45:26,911 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {986#true} {986#true} #68#return; {986#true} is VALID [2020-07-08 12:45:26,912 INFO L263 TraceCheckUtils]: 0: Hoare triple {986#true} call ULTIMATE.init(); {1000#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 12:45:26,913 INFO L280 TraceCheckUtils]: 1: Hoare triple {1000#(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; {986#true} is VALID [2020-07-08 12:45:26,913 INFO L280 TraceCheckUtils]: 2: Hoare triple {986#true} assume true; {986#true} is VALID [2020-07-08 12:45:26,913 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {986#true} {986#true} #72#return; {986#true} is VALID [2020-07-08 12:45:26,913 INFO L263 TraceCheckUtils]: 4: Hoare triple {986#true} call #t~ret10 := main(); {986#true} is VALID [2020-07-08 12:45:26,914 INFO L280 TraceCheckUtils]: 5: Hoare triple {986#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {986#true} is VALID [2020-07-08 12:45:26,914 INFO L280 TraceCheckUtils]: 6: Hoare triple {986#true} assume !(~N~0 <= 0); {986#true} is VALID [2020-07-08 12:45:26,914 INFO L263 TraceCheckUtils]: 7: Hoare triple {986#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {986#true} is VALID [2020-07-08 12:45:26,915 INFO L280 TraceCheckUtils]: 8: Hoare triple {986#true} ~cond := #in~cond; {986#true} is VALID [2020-07-08 12:45:26,915 INFO L280 TraceCheckUtils]: 9: Hoare triple {986#true} assume !(0 == ~cond); {986#true} is VALID [2020-07-08 12:45:26,915 INFO L280 TraceCheckUtils]: 10: Hoare triple {986#true} assume true; {986#true} is VALID [2020-07-08 12:45:26,915 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {986#true} {986#true} #68#return; {986#true} is VALID [2020-07-08 12:45:26,917 INFO L280 TraceCheckUtils]: 12: Hoare triple {986#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {995#(= 0 main_~i~0)} is VALID [2020-07-08 12:45:26,918 INFO L280 TraceCheckUtils]: 13: Hoare triple {995#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(4, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {995#(= 0 main_~i~0)} is VALID [2020-07-08 12:45:26,919 INFO L280 TraceCheckUtils]: 14: Hoare triple {995#(= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {996#(<= main_~i~0 1)} is VALID [2020-07-08 12:45:26,920 INFO L280 TraceCheckUtils]: 15: Hoare triple {996#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {997#(<= ~N~0 1)} is VALID [2020-07-08 12:45:26,922 INFO L280 TraceCheckUtils]: 16: Hoare triple {997#(<= ~N~0 1)} ~i~0 := 0; {998#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-08 12:45:26,923 INFO L280 TraceCheckUtils]: 17: Hoare triple {998#(and (<= ~N~0 1) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {998#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-08 12:45:26,924 INFO L280 TraceCheckUtils]: 18: Hoare triple {998#(and (<= ~N~0 1) (= 0 main_~i~0))} assume 4 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem5;havoc #t~mem6; {998#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-08 12:45:26,926 INFO L280 TraceCheckUtils]: 19: Hoare triple {998#(and (<= ~N~0 1) (= 0 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {999#(<= ~N~0 main_~i~0)} is VALID [2020-07-08 12:45:26,926 INFO L280 TraceCheckUtils]: 20: Hoare triple {999#(<= ~N~0 main_~i~0)} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {987#false} is VALID [2020-07-08 12:45:26,927 INFO L280 TraceCheckUtils]: 21: Hoare triple {987#false} assume 4 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem5;havoc #t~mem6; {987#false} is VALID [2020-07-08 12:45:26,927 INFO L280 TraceCheckUtils]: 22: Hoare triple {987#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {987#false} is VALID [2020-07-08 12:45:26,927 INFO L280 TraceCheckUtils]: 23: Hoare triple {987#false} assume !(~i~0 < ~N~0); {987#false} is VALID [2020-07-08 12:45:26,928 INFO L280 TraceCheckUtils]: 24: Hoare triple {987#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {987#false} is VALID [2020-07-08 12:45:26,928 INFO L263 TraceCheckUtils]: 25: Hoare triple {987#false} call __VERIFIER_assert((if #t~mem9 == 5 * ~N~0 then 1 else 0)); {987#false} is VALID [2020-07-08 12:45:26,928 INFO L280 TraceCheckUtils]: 26: Hoare triple {987#false} ~cond := #in~cond; {987#false} is VALID [2020-07-08 12:45:26,928 INFO L280 TraceCheckUtils]: 27: Hoare triple {987#false} assume 0 == ~cond; {987#false} is VALID [2020-07-08 12:45:26,929 INFO L280 TraceCheckUtils]: 28: Hoare triple {987#false} assume !false; {987#false} is VALID [2020-07-08 12:45:26,930 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:26,930 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494538183] [2020-07-08 12:45:26,931 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2022350937] [2020-07-08 12:45:26,931 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 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-08 12:45:26,977 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-08 12:45:26,978 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:45:26,979 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-08 12:45:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:26,996 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:45:27,111 INFO L263 TraceCheckUtils]: 0: Hoare triple {986#true} call ULTIMATE.init(); {986#true} is VALID [2020-07-08 12:45:27,113 INFO L280 TraceCheckUtils]: 1: Hoare triple {986#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {986#true} is VALID [2020-07-08 12:45:27,113 INFO L280 TraceCheckUtils]: 2: Hoare triple {986#true} assume true; {986#true} is VALID [2020-07-08 12:45:27,113 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {986#true} {986#true} #72#return; {986#true} is VALID [2020-07-08 12:45:27,114 INFO L263 TraceCheckUtils]: 4: Hoare triple {986#true} call #t~ret10 := main(); {986#true} is VALID [2020-07-08 12:45:27,114 INFO L280 TraceCheckUtils]: 5: Hoare triple {986#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {986#true} is VALID [2020-07-08 12:45:27,114 INFO L280 TraceCheckUtils]: 6: Hoare triple {986#true} assume !(~N~0 <= 0); {986#true} is VALID [2020-07-08 12:45:27,115 INFO L263 TraceCheckUtils]: 7: Hoare triple {986#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {986#true} is VALID [2020-07-08 12:45:27,115 INFO L280 TraceCheckUtils]: 8: Hoare triple {986#true} ~cond := #in~cond; {986#true} is VALID [2020-07-08 12:45:27,115 INFO L280 TraceCheckUtils]: 9: Hoare triple {986#true} assume !(0 == ~cond); {986#true} is VALID [2020-07-08 12:45:27,116 INFO L280 TraceCheckUtils]: 10: Hoare triple {986#true} assume true; {986#true} is VALID [2020-07-08 12:45:27,116 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {986#true} {986#true} #68#return; {986#true} is VALID [2020-07-08 12:45:27,118 INFO L280 TraceCheckUtils]: 12: Hoare triple {986#true} havoc ~i~0;call ~#sum~0.base, ~#sum~0.offset := #Ultimate.allocOnStack(8);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4 * ~N~0);~a~0.base, ~a~0.offset := #t~malloc1.base, #t~malloc1.offset;call write~int(1, ~#sum~0.base, ~#sum~0.offset, 8);~i~0 := 0; {1040#(<= main_~i~0 0)} is VALID [2020-07-08 12:45:27,119 INFO L280 TraceCheckUtils]: 13: Hoare triple {1040#(<= main_~i~0 0)} assume !!(~i~0 < ~N~0);call write~int(4, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {1040#(<= main_~i~0 0)} is VALID [2020-07-08 12:45:27,122 INFO L280 TraceCheckUtils]: 14: Hoare triple {1040#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {996#(<= main_~i~0 1)} is VALID [2020-07-08 12:45:27,123 INFO L280 TraceCheckUtils]: 15: Hoare triple {996#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {997#(<= ~N~0 1)} is VALID [2020-07-08 12:45:27,124 INFO L280 TraceCheckUtils]: 16: Hoare triple {997#(<= ~N~0 1)} ~i~0 := 0; {1053#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-08 12:45:27,125 INFO L280 TraceCheckUtils]: 17: Hoare triple {1053#(and (<= 0 main_~i~0) (<= ~N~0 1))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {1053#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-08 12:45:27,126 INFO L280 TraceCheckUtils]: 18: Hoare triple {1053#(and (<= 0 main_~i~0) (<= ~N~0 1))} assume 4 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem5;havoc #t~mem6; {1053#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-08 12:45:27,128 INFO L280 TraceCheckUtils]: 19: Hoare triple {1053#(and (<= 0 main_~i~0) (<= ~N~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1063#(and (<= ~N~0 1) (<= 1 main_~i~0))} is VALID [2020-07-08 12:45:27,129 INFO L280 TraceCheckUtils]: 20: Hoare triple {1063#(and (<= ~N~0 1) (<= 1 main_~i~0))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {987#false} is VALID [2020-07-08 12:45:27,129 INFO L280 TraceCheckUtils]: 21: Hoare triple {987#false} assume 4 == #t~mem4;havoc #t~mem4;call #t~mem5 := read~int(~#sum~0.base, ~#sum~0.offset, 8);call #t~mem6 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4);call write~int(#t~mem5 + #t~mem6, ~#sum~0.base, ~#sum~0.offset, 8);havoc #t~mem5;havoc #t~mem6; {987#false} is VALID [2020-07-08 12:45:27,130 INFO L280 TraceCheckUtils]: 22: Hoare triple {987#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {987#false} is VALID [2020-07-08 12:45:27,130 INFO L280 TraceCheckUtils]: 23: Hoare triple {987#false} assume !(~i~0 < ~N~0); {987#false} is VALID [2020-07-08 12:45:27,130 INFO L280 TraceCheckUtils]: 24: Hoare triple {987#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {987#false} is VALID [2020-07-08 12:45:27,130 INFO L263 TraceCheckUtils]: 25: Hoare triple {987#false} call __VERIFIER_assert((if #t~mem9 == 5 * ~N~0 then 1 else 0)); {987#false} is VALID [2020-07-08 12:45:27,131 INFO L280 TraceCheckUtils]: 26: Hoare triple {987#false} ~cond := #in~cond; {987#false} is VALID [2020-07-08 12:45:27,131 INFO L280 TraceCheckUtils]: 27: Hoare triple {987#false} assume 0 == ~cond; {987#false} is VALID [2020-07-08 12:45:27,131 INFO L280 TraceCheckUtils]: 28: Hoare triple {987#false} assume !false; {987#false} is VALID [2020-07-08 12:45:27,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:27,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:45:27,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-08 12:45:27,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330882293] [2020-07-08 12:45:27,134 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-07-08 12:45:27,134 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:27,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 12:45:27,187 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:27,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 12:45:27,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:27,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 12:45:27,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-08 12:45:27,189 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 11 states. [2020-07-08 12:45:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:27,727 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-08 12:45:27,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-08 12:45:27,727 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-07-08 12:45:27,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:27,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:45:27,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2020-07-08 12:45:27,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 12:45:27,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2020-07-08 12:45:27,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 55 transitions. [2020-07-08 12:45:27,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:27,824 INFO L225 Difference]: With dead ends: 49 [2020-07-08 12:45:27,824 INFO L226 Difference]: Without dead ends: 35 [2020-07-08 12:45:27,826 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2020-07-08 12:45:27,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-08 12:45:27,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-07-08 12:45:27,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:27,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2020-07-08 12:45:27,873 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2020-07-08 12:45:27,873 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2020-07-08 12:45:27,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:27,877 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-08 12:45:27,877 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-08 12:45:27,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:27,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:27,882 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2020-07-08 12:45:27,883 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2020-07-08 12:45:27,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:27,890 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-08 12:45:27,891 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-08 12:45:27,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:27,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:27,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:27,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:27,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 12:45:27,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-08 12:45:27,897 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2020-07-08 12:45:27,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:27,897 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-08 12:45:27,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 12:45:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-08 12:45:27,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-08 12:45:27,901 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:27,902 INFO L422 BasicCegarLoop]: trace histogram [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-08 12:45:28,119 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:28,119 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:28,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:28,120 INFO L82 PathProgramCache]: Analyzing trace with hash 2056219107, now seen corresponding path program 4 times [2020-07-08 12:45:28,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:28,121 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689190052] [2020-07-08 12:45:28,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:45:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:45:28,241 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:45:28,242 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:45:28,242 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 12:45:28,334 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-08 12:45:28,335 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:45:28,335 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:45:28,335 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-08 12:45:28,335 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:45:28,335 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 12:45:28,335 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:45:28,336 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:45:28,336 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:45:28,336 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:45:28,336 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-08 12:45:28,336 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:45:28,336 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-08 12:45:28,336 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:45:28,337 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-08 12:45:28,337 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:45:28,337 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:45:28,337 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-08 12:45:28,337 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:45:28,337 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:45:28,337 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-08 12:45:28,338 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:45:28,338 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-08 12:45:28,338 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 12:45:28,338 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-08 12:45:28,338 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:45:28,339 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-08 12:45:28,339 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:45:28,339 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 12:45:28,339 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 12:45:28,339 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-08 12:45:28,339 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-08 12:45:28,339 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-08 12:45:28,339 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-08 12:45:28,339 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 12:45:28,340 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 12:45:28,340 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-08 12:45:28,340 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-08 12:45:28,340 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 12:45:28,340 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-08 12:45:28,340 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-08 12:45:28,340 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-08 12:45:28,340 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-08 12:45:28,341 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-08 12:45:28,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:45:28 BoogieIcfgContainer [2020-07-08 12:45:28,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:45:28,349 INFO L168 Benchmark]: Toolchain (without parser) took 16274.29 ms. Allocated memory was 136.3 MB in the beginning and 318.8 MB in the end (delta: 182.5 MB). Free memory was 100.7 MB in the beginning and 128.2 MB in the end (delta: -27.6 MB). Peak memory consumption was 154.9 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:28,350 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-08 12:45:28,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.60 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 100.5 MB in the beginning and 178.4 MB in the end (delta: -77.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:28,351 INFO L168 Benchmark]: Boogie Preprocessor took 47.72 ms. Allocated memory is still 199.8 MB. Free memory was 178.4 MB in the beginning and 175.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:28,352 INFO L168 Benchmark]: RCFGBuilder took 516.21 ms. Allocated memory is still 199.8 MB. Free memory was 175.8 MB in the beginning and 151.7 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:28,355 INFO L168 Benchmark]: TraceAbstraction took 15295.91 ms. Allocated memory was 199.8 MB in the beginning and 318.8 MB in the end (delta: 119.0 MB). Free memory was 151.0 MB in the beginning and 128.2 MB in the end (delta: 22.8 MB). Peak memory consumption was 141.8 MB. Max. memory is 7.1 GB. [2020-07-08 12:45:28,362 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.25 ms. Allocated memory is still 136.3 MB. Free memory was 119.4 MB in the beginning and 119.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 407.60 ms. Allocated memory was 136.3 MB in the beginning and 199.8 MB in the end (delta: 63.4 MB). Free memory was 100.5 MB in the beginning and 178.4 MB in the end (delta: -77.9 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.72 ms. Allocated memory is still 199.8 MB. Free memory was 178.4 MB in the beginning and 175.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 516.21 ms. Allocated memory is still 199.8 MB. Free memory was 175.8 MB in the beginning and 151.7 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 15295.91 ms. Allocated memory was 199.8 MB in the beginning and 318.8 MB in the end (delta: 119.0 MB). Free memory was 151.0 MB in the beginning and 128.2 MB in the end (delta: 22.8 MB). Peak memory consumption was 141.8 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)=12, N=0] [L21] N = __VERIFIER_nondet_int() [L22] COND FALSE !(N <= 0) VAL [\old(N)=0, N=2] [L23] CALL assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(cond)=1, \old(N)=0, N=2] [L11] COND FALSE !(!cond) VAL [\old(cond)=1, \old(N)=0, cond=1, N=2] [L23] RET assume_abort_if_not(N <= 2147483647/sizeof(int)) VAL [\old(N)=0, N=2] [L25] int i; [L26] long long sum[1]; [L27] int *a = malloc(sizeof(int)*N); [L29] sum[0] = 1 [L30] i=0 VAL [\old(N)=0, a={-1:0}, i=0, malloc(sizeof(int)*N)={-1:0}, N=2, sum={2:0}] [L30] COND TRUE i