/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-8fc6572 [2020-07-10 15:26:54,667 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:26:54,670 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:26:54,682 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:26:54,683 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:26:54,684 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:26:54,685 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:26:54,687 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:26:54,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:26:54,689 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:26:54,690 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:26:54,691 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:26:54,692 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:26:54,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:26:54,694 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:26:54,695 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:26:54,696 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:26:54,697 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:26:54,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:26:54,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:26:54,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:26:54,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:26:54,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:26:54,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:26:54,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:26:54,708 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:26:54,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:26:54,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:26:54,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:26:54,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:26:54,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:26:54,711 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:26:54,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:26:54,717 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:26:54,718 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:26:54,718 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:26:54,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:26:54,719 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:26:54,719 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:26:54,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:26:54,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:26:54,721 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 15:26:54,737 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:26:54,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:26:54,738 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:26:54,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:26:54,739 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:26:54,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:26:54,739 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:26:54,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:26:54,740 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:26:54,740 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:26:54,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:26:54,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:26:54,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:26:54,741 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:26:54,741 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:26:54,741 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:26:54,741 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:26:54,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:26:54,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:26:54,742 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:26:54,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:26:54,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:54,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:26:54,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:26:54,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:26:54,743 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:26:54,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:26:54,744 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:26:54,744 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:26:54,744 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:26:55,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:26:55,075 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:26:55,079 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:26:55,081 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:26:55,081 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:26:55,082 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-10 15:26:55,163 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffe860a8e/2f70539bf59c4c5096be8e9b512caddb/FLAG39bfb9ab4 [2020-07-10 15:26:55,642 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:26:55,643 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-fpi/s4iff.c [2020-07-10 15:26:55,649 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffe860a8e/2f70539bf59c4c5096be8e9b512caddb/FLAG39bfb9ab4 [2020-07-10 15:26:56,031 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ffe860a8e/2f70539bf59c4c5096be8e9b512caddb [2020-07-10 15:26:56,041 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:26:56,043 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:26:56,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:56,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:26:56,048 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:26:56,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:56" (1/1) ... [2020-07-10 15:26:56,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@342470ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:56, skipping insertion in model container [2020-07-10 15:26:56,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:26:56" (1/1) ... [2020-07-10 15:26:56,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:26:56,081 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:26:56,275 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:56,287 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:26:56,312 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:26:56,332 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:26:56,332 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:56 WrapperNode [2020-07-10 15:26:56,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:26:56,334 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:26:56,334 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:26:56,334 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:26:56,424 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:56" (1/1) ... [2020-07-10 15:26:56,424 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:56" (1/1) ... [2020-07-10 15:26:56,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:56" (1/1) ... [2020-07-10 15:26:56,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:56" (1/1) ... [2020-07-10 15:26:56,466 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:56" (1/1) ... [2020-07-10 15:26:56,477 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:56" (1/1) ... [2020-07-10 15:26:56,479 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:56" (1/1) ... [2020-07-10 15:26:56,481 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:26:56,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:26:56,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:26:56,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:26:56,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:26:56,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:26:56,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:26:56,542 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 15:26:56,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:26:56,542 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:26:56,542 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:26:56,542 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 15:26:56,542 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 15:26:56,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:26:56,543 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 15:26:56,543 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:26:56,543 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:26:56,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:26:56,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:26:56,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 15:26:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 15:26:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:26:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:26:56,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:26:56,930 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:26:56,930 INFO L295 CfgBuilder]: Removed 2 assume(true) statements. [2020-07-10 15:26:56,934 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:56 BoogieIcfgContainer [2020-07-10 15:26:56,934 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:26:56,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:26:56,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:26:56,941 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:26:56,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:26:56" (1/3) ... [2020-07-10 15:26:56,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcd2dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:56, skipping insertion in model container [2020-07-10 15:26:56,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:26:56" (2/3) ... [2020-07-10 15:26:56,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcd2dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:26:56, skipping insertion in model container [2020-07-10 15:26:56,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:26:56" (3/3) ... [2020-07-10 15:26:56,946 INFO L109 eAbstractionObserver]: Analyzing ICFG s4iff.c [2020-07-10 15:26:56,961 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:26:56,971 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:26:56,988 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:26:57,014 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:26:57,015 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:26:57,015 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:26:57,015 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:26:57,015 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:26:57,015 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:26:57,016 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:26:57,016 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:26:57,042 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2020-07-10 15:26:57,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:26:57,051 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:57,052 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-10 15:26:57,053 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:57,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:57,058 INFO L82 PathProgramCache]: Analyzing trace with hash -432131487, now seen corresponding path program 1 times [2020-07-10 15:26:57,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:57,068 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85328654] [2020-07-10 15:26:57,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:57,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:57,371 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-10 15:26:57,372 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-10 15:26:57,373 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #72#return; {35#true} is VALID [2020-07-10 15:26:57,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:57,406 INFO L280 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2020-07-10 15:26:57,409 INFO L280 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2020-07-10 15:26:57,410 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2020-07-10 15:26:57,411 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #68#return; {36#false} is VALID [2020-07-10 15:26:57,413 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-10 15:26:57,414 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-10 15:26:57,414 INFO L280 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2020-07-10 15:26:57,415 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #72#return; {35#true} is VALID [2020-07-10 15:26:57,416 INFO L263 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret10 := main(); {35#true} is VALID [2020-07-10 15:26:57,416 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-10 15:26:57,417 INFO L280 TraceCheckUtils]: 6: Hoare triple {35#true} assume !(~N~0 <= 0); {35#true} is VALID [2020-07-10 15:26:57,417 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-10 15:26:57,418 INFO L280 TraceCheckUtils]: 8: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2020-07-10 15:26:57,419 INFO L280 TraceCheckUtils]: 9: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2020-07-10 15:26:57,420 INFO L280 TraceCheckUtils]: 10: Hoare triple {36#false} assume true; {36#false} is VALID [2020-07-10 15:26:57,422 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {36#false} {35#true} #68#return; {36#false} is VALID [2020-07-10 15:26:57,424 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-10 15:26:57,424 INFO L280 TraceCheckUtils]: 13: Hoare triple {36#false} assume !(~i~0 < ~N~0); {36#false} is VALID [2020-07-10 15:26:57,425 INFO L280 TraceCheckUtils]: 14: Hoare triple {36#false} ~i~0 := 0; {36#false} is VALID [2020-07-10 15:26:57,427 INFO L280 TraceCheckUtils]: 15: Hoare triple {36#false} assume !(~i~0 < ~N~0); {36#false} is VALID [2020-07-10 15:26:57,428 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-10 15:26:57,428 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-10 15:26:57,429 INFO L280 TraceCheckUtils]: 18: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2020-07-10 15:26:57,429 INFO L280 TraceCheckUtils]: 19: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2020-07-10 15:26:57,429 INFO L280 TraceCheckUtils]: 20: Hoare triple {36#false} assume !false; {36#false} is VALID [2020-07-10 15:26:57,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:57,439 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85328654] [2020-07-10 15:26:57,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:57,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 15:26:57,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687618957] [2020-07-10 15:26:57,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:26:57,458 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:57,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:57,530 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-10 15:26:57,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:57,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:57,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:57,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:57,545 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 3 states. [2020-07-10 15:26:57,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:57,768 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2020-07-10 15:26:57,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:57,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2020-07-10 15:26:57,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:57,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:57,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2020-07-10 15:26:57,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:57,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2020-07-10 15:26:57,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 67 transitions. [2020-07-10 15:26:57,911 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:57,924 INFO L225 Difference]: With dead ends: 54 [2020-07-10 15:26:57,925 INFO L226 Difference]: Without dead ends: 25 [2020-07-10 15:26:57,929 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 15:26:57,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-10 15:26:57,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2020-07-10 15:26:57,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:57,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 25 states. [2020-07-10 15:26:57,987 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 15:26:57,987 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 15:26:57,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:57,992 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-10 15:26:57,993 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-10 15:26:58,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:58,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:58,007 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 25 states. [2020-07-10 15:26:58,007 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 25 states. [2020-07-10 15:26:58,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:58,011 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-10 15:26:58,012 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-10 15:26:58,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:58,012 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:58,013 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:58,013 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:58,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 15:26:58,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-10 15:26:58,025 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 21 [2020-07-10 15:26:58,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:58,025 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-10 15:26:58,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:58,025 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-10 15:26:58,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 15:26:58,026 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:58,027 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-10 15:26:58,027 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:26:58,027 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:58,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:58,028 INFO L82 PathProgramCache]: Analyzing trace with hash -173966049, now seen corresponding path program 1 times [2020-07-10 15:26:58,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:58,029 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538732642] [2020-07-10 15:26:58,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:58,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:58,192 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-10 15:26:58,193 INFO L280 TraceCheckUtils]: 1: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-10 15:26:58,193 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {200#true} {200#true} #72#return; {200#true} is VALID [2020-07-10 15:26:58,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:58,203 INFO L280 TraceCheckUtils]: 0: Hoare triple {200#true} ~cond := #in~cond; {200#true} is VALID [2020-07-10 15:26:58,203 INFO L280 TraceCheckUtils]: 1: Hoare triple {200#true} assume !(0 == ~cond); {200#true} is VALID [2020-07-10 15:26:58,204 INFO L280 TraceCheckUtils]: 2: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-10 15:26:58,205 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {200#true} {205#(<= 1 ~N~0)} #68#return; {205#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:58,206 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-10 15:26:58,207 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-10 15:26:58,207 INFO L280 TraceCheckUtils]: 2: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-10 15:26:58,207 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {200#true} {200#true} #72#return; {200#true} is VALID [2020-07-10 15:26:58,208 INFO L263 TraceCheckUtils]: 4: Hoare triple {200#true} call #t~ret10 := main(); {200#true} is VALID [2020-07-10 15:26:58,208 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-10 15:26:58,209 INFO L280 TraceCheckUtils]: 6: Hoare triple {200#true} assume !(~N~0 <= 0); {205#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:58,210 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-10 15:26:58,210 INFO L280 TraceCheckUtils]: 8: Hoare triple {200#true} ~cond := #in~cond; {200#true} is VALID [2020-07-10 15:26:58,210 INFO L280 TraceCheckUtils]: 9: Hoare triple {200#true} assume !(0 == ~cond); {200#true} is VALID [2020-07-10 15:26:58,211 INFO L280 TraceCheckUtils]: 10: Hoare triple {200#true} assume true; {200#true} is VALID [2020-07-10 15:26:58,212 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {200#true} {205#(<= 1 ~N~0)} #68#return; {205#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:58,214 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-10 15:26:58,215 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-10 15:26:58,216 INFO L280 TraceCheckUtils]: 14: Hoare triple {201#false} ~i~0 := 0; {201#false} is VALID [2020-07-10 15:26:58,216 INFO L280 TraceCheckUtils]: 15: Hoare triple {201#false} assume !(~i~0 < ~N~0); {201#false} is VALID [2020-07-10 15:26:58,216 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-10 15:26:58,217 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-10 15:26:58,217 INFO L280 TraceCheckUtils]: 18: Hoare triple {201#false} ~cond := #in~cond; {201#false} is VALID [2020-07-10 15:26:58,217 INFO L280 TraceCheckUtils]: 19: Hoare triple {201#false} assume 0 == ~cond; {201#false} is VALID [2020-07-10 15:26:58,218 INFO L280 TraceCheckUtils]: 20: Hoare triple {201#false} assume !false; {201#false} is VALID [2020-07-10 15:26:58,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:26:58,220 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538732642] [2020-07-10 15:26:58,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:26:58,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 15:26:58,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077695423] [2020-07-10 15:26:58,222 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-10 15:26:58,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:58,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 15:26:58,255 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-10 15:26:58,255 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 15:26:58,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:58,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 15:26:58,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:26:58,256 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 5 states. [2020-07-10 15:26:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:58,513 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-10 15:26:58,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:26:58,513 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2020-07-10 15:26:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:58,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:58,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2020-07-10 15:26:58,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 15:26:58,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2020-07-10 15:26:58,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2020-07-10 15:26:58,590 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-10 15:26:58,592 INFO L225 Difference]: With dead ends: 40 [2020-07-10 15:26:58,592 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 15:26:58,593 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-10 15:26:58,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 15:26:58,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2020-07-10 15:26:58,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:58,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 27 states. [2020-07-10 15:26:58,617 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 27 states. [2020-07-10 15:26:58,618 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 27 states. [2020-07-10 15:26:58,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:58,620 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-10 15:26:58,621 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:26:58,621 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:58,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:58,622 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 30 states. [2020-07-10 15:26:58,622 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 30 states. [2020-07-10 15:26:58,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:58,625 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-10 15:26:58,625 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:26:58,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:58,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:58,626 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:58,626 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:58,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 15:26:58,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-10 15:26:58,628 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 21 [2020-07-10 15:26:58,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:58,629 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-10 15:26:58,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 15:26:58,629 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-10 15:26:58,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 15:26:58,630 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:58,631 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-10 15:26:58,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:26:58,631 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:58,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:58,632 INFO L82 PathProgramCache]: Analyzing trace with hash -445719797, now seen corresponding path program 1 times [2020-07-10 15:26:58,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:58,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592305533] [2020-07-10 15:26:58,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:58,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:59,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:59,275 INFO L280 TraceCheckUtils]: 0: Hoare triple {389#(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-10 15:26:59,275 INFO L280 TraceCheckUtils]: 1: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-10 15:26:59,276 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {371#true} {371#true} #72#return; {371#true} is VALID [2020-07-10 15:26:59,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:59,283 INFO L280 TraceCheckUtils]: 0: Hoare triple {371#true} ~cond := #in~cond; {371#true} is VALID [2020-07-10 15:26:59,284 INFO L280 TraceCheckUtils]: 1: Hoare triple {371#true} assume !(0 == ~cond); {371#true} is VALID [2020-07-10 15:26:59,284 INFO L280 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-10 15:26:59,285 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {371#true} {376#(<= 1 ~N~0)} #68#return; {376#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:59,286 INFO L263 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {389#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:59,287 INFO L280 TraceCheckUtils]: 1: Hoare triple {389#(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-10 15:26:59,287 INFO L280 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-10 15:26:59,287 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #72#return; {371#true} is VALID [2020-07-10 15:26:59,288 INFO L263 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret10 := main(); {371#true} is VALID [2020-07-10 15:26:59,288 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-10 15:26:59,289 INFO L280 TraceCheckUtils]: 6: Hoare triple {371#true} assume !(~N~0 <= 0); {376#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:59,289 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-10 15:26:59,290 INFO L280 TraceCheckUtils]: 8: Hoare triple {371#true} ~cond := #in~cond; {371#true} is VALID [2020-07-10 15:26:59,290 INFO L280 TraceCheckUtils]: 9: Hoare triple {371#true} assume !(0 == ~cond); {371#true} is VALID [2020-07-10 15:26:59,290 INFO L280 TraceCheckUtils]: 10: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-10 15:26:59,291 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {371#true} {376#(<= 1 ~N~0)} #68#return; {376#(<= 1 ~N~0)} is VALID [2020-07-10 15:26:59,294 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 (or (< 536870911 ~N~0) (and (<= 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))) (= 0 main_~i~0))} is VALID [2020-07-10 15:26:59,296 INFO L280 TraceCheckUtils]: 13: Hoare triple {381#(and (or (< 536870911 ~N~0) (and (<= 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))) (= 0 main_~i~0))} assume !!(~i~0 < ~N~0);call write~int(4, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {381#(and (or (< 536870911 ~N~0) (and (<= 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))) (= 0 main_~i~0))} is VALID [2020-07-10 15:26:59,298 INFO L280 TraceCheckUtils]: 14: Hoare triple {381#(and (or (< 536870911 ~N~0) (and (<= 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))) (= 0 main_~i~0))} #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-10 15:26:59,299 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-10 15:26:59,301 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; {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-10 15:26:59,303 INFO L280 TraceCheckUtils]: 17: 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))} assume !!(~i~0 < ~N~0);call #t~mem4 := read~int(~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {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|)) (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-10 15:26:59,305 INFO L280 TraceCheckUtils]: 18: 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|)) (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; {385#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0)) (<= ~N~0 536870911))} is VALID [2020-07-10 15:26:59,306 INFO L280 TraceCheckUtils]: 19: Hoare triple {385#(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; {385#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0)) (<= ~N~0 536870911))} is VALID [2020-07-10 15:26:59,307 INFO L280 TraceCheckUtils]: 20: Hoare triple {385#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0)) (<= ~N~0 536870911))} assume !(~i~0 < ~N~0); {385#(and (= (select (select |#memory_int| |main_~#sum~0.base|) |main_~#sum~0.offset|) (* 5 ~N~0)) (<= ~N~0 536870911))} is VALID [2020-07-10 15:26:59,308 INFO L280 TraceCheckUtils]: 21: Hoare triple {385#(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); {386#(and (= |main_#t~mem9| (* 5 ~N~0)) (<= ~N~0 536870911))} is VALID [2020-07-10 15:26:59,310 INFO L263 TraceCheckUtils]: 22: Hoare triple {386#(and (= |main_#t~mem9| (* 5 ~N~0)) (<= ~N~0 536870911))} call __VERIFIER_assert((if #t~mem9 == 5 * ~N~0 then 1 else 0)); {387#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 15:26:59,311 INFO L280 TraceCheckUtils]: 23: Hoare triple {387#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {388#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 15:26:59,311 INFO L280 TraceCheckUtils]: 24: Hoare triple {388#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {372#false} is VALID [2020-07-10 15:26:59,312 INFO L280 TraceCheckUtils]: 25: Hoare triple {372#false} assume !false; {372#false} is VALID [2020-07-10 15:26:59,316 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-10 15:26:59,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592305533] [2020-07-10 15:26:59,317 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466582723] [2020-07-10 15:26:59,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:59,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:59,368 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 19 conjunts are in the unsatisfiable core [2020-07-10 15:26:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:59,390 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:59,510 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-07-10 15:26:59,511 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:59,522 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:59,523 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:59,523 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:19 [2020-07-10 15:26:59,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:26:59,587 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-10 15:26:59,589 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:59,602 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:59,603 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:59,603 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:34, output treesize:30 [2020-07-10 15:27:00,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:00,035 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:27:00,036 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-10 15:27:00,040 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:00,082 INFO L624 ElimStorePlain]: treesize reduction 24, result has 65.7 percent of original size [2020-07-10 15:27:00,110 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-10 15:27:00,118 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:71, output treesize:46 [2020-07-10 15:27:00,131 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:27:00,131 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-10 15:27:00,132 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-10 15:27:00,381 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-07-10 15:27:00,388 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:27:00,389 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-10 15:27:00,391 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:27:00,401 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:27:00,408 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-10 15:27:00,409 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:53, output treesize:10 [2020-07-10 15:27:00,412 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:27:00,413 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-10 15:27:00,413 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (<= ~N~0 1) (<= 1 ~N~0) (= 5 |main_#t~mem9|)) [2020-07-10 15:27:00,458 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:27:00,533 INFO L263 TraceCheckUtils]: 0: Hoare triple {371#true} call ULTIMATE.init(); {371#true} is VALID [2020-07-10 15:27:00,534 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-10 15:27:00,534 INFO L280 TraceCheckUtils]: 2: Hoare triple {371#true} assume true; {371#true} is VALID [2020-07-10 15:27:00,535 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {371#true} {371#true} #72#return; {371#true} is VALID [2020-07-10 15:27:00,535 INFO L263 TraceCheckUtils]: 4: Hoare triple {371#true} call #t~ret10 := main(); {371#true} is VALID [2020-07-10 15:27:00,535 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-10 15:27:00,538 INFO L280 TraceCheckUtils]: 6: Hoare triple {371#true} assume !(~N~0 <= 0); {376#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:00,539 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-10 15:27:00,539 INFO L280 TraceCheckUtils]: 8: Hoare triple {376#(<= 1 ~N~0)} ~cond := #in~cond; {376#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:00,540 INFO L280 TraceCheckUtils]: 9: Hoare triple {376#(<= 1 ~N~0)} assume !(0 == ~cond); {376#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:00,541 INFO L280 TraceCheckUtils]: 10: Hoare triple {376#(<= 1 ~N~0)} assume true; {376#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:00,542 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {376#(<= 1 ~N~0)} {376#(<= 1 ~N~0)} #68#return; {376#(<= 1 ~N~0)} is VALID [2020-07-10 15:27:00,544 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; {429#(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-10 15:27:00,550 INFO L280 TraceCheckUtils]: 13: Hoare triple {429#(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); {433#(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-10 15:27:00,558 INFO L280 TraceCheckUtils]: 14: Hoare triple {433#(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; {437#(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-10 15:27:00,560 INFO L280 TraceCheckUtils]: 15: Hoare triple {437#(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); {441#(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-10 15:27:00,561 INFO L280 TraceCheckUtils]: 16: Hoare triple {441#(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; {441#(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-10 15:27:00,563 INFO L280 TraceCheckUtils]: 17: Hoare triple {441#(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); {448#(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-10 15:27:00,573 INFO L280 TraceCheckUtils]: 18: Hoare triple {448#(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; {452#(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-10 15:27:00,575 INFO L280 TraceCheckUtils]: 19: Hoare triple {452#(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; {452#(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-10 15:27:00,577 INFO L280 TraceCheckUtils]: 20: Hoare triple {452#(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); {452#(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-10 15:27:00,579 INFO L280 TraceCheckUtils]: 21: Hoare triple {452#(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); {462#(and (<= ~N~0 1) (<= 1 ~N~0) (= 5 |main_#t~mem9|))} is VALID [2020-07-10 15:27:00,580 INFO L263 TraceCheckUtils]: 22: Hoare triple {462#(and (<= ~N~0 1) (<= 1 ~N~0) (= 5 |main_#t~mem9|))} call __VERIFIER_assert((if #t~mem9 == 5 * ~N~0 then 1 else 0)); {466#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:27:00,581 INFO L280 TraceCheckUtils]: 23: Hoare triple {466#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {470#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:27:00,582 INFO L280 TraceCheckUtils]: 24: Hoare triple {470#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {372#false} is VALID [2020-07-10 15:27:00,582 INFO L280 TraceCheckUtils]: 25: Hoare triple {372#false} assume !false; {372#false} is VALID [2020-07-10 15:27:00,587 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-10 15:27:00,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:00,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2020-07-10 15:27:00,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909405603] [2020-07-10 15:27:00,589 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2020-07-10 15:27:00,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:00,590 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-10 15:27:02,093 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-10 15:27:02,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-10 15:27:02,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:02,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-10 15:27:02,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2020-07-10 15:27:02,095 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 21 states. [2020-07-10 15:27:05,547 WARN L193 SmtUtils]: Spent 2.05 s on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2020-07-10 15:27:05,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:05,999 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2020-07-10 15:27:05,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-07-10 15:27:06,000 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 26 [2020-07-10 15:27:06,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:27:06,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 55 transitions. [2020-07-10 15:27:06,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 15:27:06,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 55 transitions. [2020-07-10 15:27:06,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 55 transitions. [2020-07-10 15:27:08,199 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-10 15:27:08,201 INFO L225 Difference]: With dead ends: 49 [2020-07-10 15:27:08,201 INFO L226 Difference]: Without dead ends: 36 [2020-07-10 15:27:08,202 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=143, Invalid=727, Unknown=0, NotChecked=0, Total=870 [2020-07-10 15:27:08,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-10 15:27:08,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2020-07-10 15:27:08,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:08,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 33 states. [2020-07-10 15:27:08,233 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 33 states. [2020-07-10 15:27:08,234 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 33 states. [2020-07-10 15:27:08,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:08,237 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-10 15:27:08,237 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-10 15:27:08,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:08,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:08,238 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 36 states. [2020-07-10 15:27:08,238 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 36 states. [2020-07-10 15:27:08,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:08,241 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2020-07-10 15:27:08,241 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2020-07-10 15:27:08,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:08,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:08,242 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:08,243 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 15:27:08,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2020-07-10 15:27:08,245 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 26 [2020-07-10 15:27:08,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:08,245 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2020-07-10 15:27:08,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-10 15:27:08,245 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2020-07-10 15:27:08,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-10 15:27:08,247 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:08,247 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-10 15:27:08,460 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:27:08,461 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:08,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:08,462 INFO L82 PathProgramCache]: Analyzing trace with hash 531279049, now seen corresponding path program 2 times [2020-07-10 15:27:08,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:08,463 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938184133] [2020-07-10 15:27:08,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:08,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:08,600 INFO L280 TraceCheckUtils]: 0: Hoare triple {697#(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; {683#true} is VALID [2020-07-10 15:27:08,601 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 15:27:08,601 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {683#true} {683#true} #72#return; {683#true} is VALID [2020-07-10 15:27:08,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:08,608 INFO L280 TraceCheckUtils]: 0: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2020-07-10 15:27:08,609 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2020-07-10 15:27:08,609 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 15:27:08,613 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #68#return; {683#true} is VALID [2020-07-10 15:27:08,621 INFO L263 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {697#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:27:08,622 INFO L280 TraceCheckUtils]: 1: Hoare triple {697#(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; {683#true} is VALID [2020-07-10 15:27:08,622 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 15:27:08,622 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #72#return; {683#true} is VALID [2020-07-10 15:27:08,623 INFO L263 TraceCheckUtils]: 4: Hoare triple {683#true} call #t~ret10 := main(); {683#true} is VALID [2020-07-10 15:27:08,623 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {683#true} is VALID [2020-07-10 15:27:08,624 INFO L280 TraceCheckUtils]: 6: Hoare triple {683#true} assume !(~N~0 <= 0); {683#true} is VALID [2020-07-10 15:27:08,624 INFO L263 TraceCheckUtils]: 7: Hoare triple {683#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {683#true} is VALID [2020-07-10 15:27:08,624 INFO L280 TraceCheckUtils]: 8: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2020-07-10 15:27:08,624 INFO L280 TraceCheckUtils]: 9: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2020-07-10 15:27:08,625 INFO L280 TraceCheckUtils]: 10: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 15:27:08,625 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {683#true} {683#true} #68#return; {683#true} is VALID [2020-07-10 15:27:08,626 INFO L280 TraceCheckUtils]: 12: Hoare triple {683#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; {692#(= 0 main_~i~0)} is VALID [2020-07-10 15:27:08,627 INFO L280 TraceCheckUtils]: 13: Hoare triple {692#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(4, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {692#(= 0 main_~i~0)} is VALID [2020-07-10 15:27:08,627 INFO L280 TraceCheckUtils]: 14: Hoare triple {692#(= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {693#(<= 1 main_~i~0)} is VALID [2020-07-10 15:27:08,629 INFO L280 TraceCheckUtils]: 15: Hoare triple {693#(<= 1 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(4, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {694#(<= 2 ~N~0)} is VALID [2020-07-10 15:27:08,629 INFO L280 TraceCheckUtils]: 16: Hoare triple {694#(<= 2 ~N~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {694#(<= 2 ~N~0)} is VALID [2020-07-10 15:27:08,630 INFO L280 TraceCheckUtils]: 17: Hoare triple {694#(<= 2 ~N~0)} assume !(~i~0 < ~N~0); {694#(<= 2 ~N~0)} is VALID [2020-07-10 15:27:08,631 INFO L280 TraceCheckUtils]: 18: Hoare triple {694#(<= 2 ~N~0)} ~i~0 := 0; {695#(and (<= 2 ~N~0) (= 0 main_~i~0))} is VALID [2020-07-10 15:27:08,632 INFO L280 TraceCheckUtils]: 19: Hoare triple {695#(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); {695#(and (<= 2 ~N~0) (= 0 main_~i~0))} is VALID [2020-07-10 15:27:08,633 INFO L280 TraceCheckUtils]: 20: Hoare triple {695#(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; {695#(and (<= 2 ~N~0) (= 0 main_~i~0))} is VALID [2020-07-10 15:27:08,634 INFO L280 TraceCheckUtils]: 21: Hoare triple {695#(and (<= 2 ~N~0) (= 0 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {696#(<= (+ main_~i~0 1) ~N~0)} is VALID [2020-07-10 15:27:08,635 INFO L280 TraceCheckUtils]: 22: Hoare triple {696#(<= (+ main_~i~0 1) ~N~0)} assume !(~i~0 < ~N~0); {684#false} is VALID [2020-07-10 15:27:08,635 INFO L280 TraceCheckUtils]: 23: Hoare triple {684#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {684#false} is VALID [2020-07-10 15:27:08,635 INFO L263 TraceCheckUtils]: 24: Hoare triple {684#false} call __VERIFIER_assert((if #t~mem9 == 5 * ~N~0 then 1 else 0)); {684#false} is VALID [2020-07-10 15:27:08,636 INFO L280 TraceCheckUtils]: 25: Hoare triple {684#false} ~cond := #in~cond; {684#false} is VALID [2020-07-10 15:27:08,636 INFO L280 TraceCheckUtils]: 26: Hoare triple {684#false} assume 0 == ~cond; {684#false} is VALID [2020-07-10 15:27:08,636 INFO L280 TraceCheckUtils]: 27: Hoare triple {684#false} assume !false; {684#false} is VALID [2020-07-10 15:27:08,637 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-10 15:27:08,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938184133] [2020-07-10 15:27:08,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124431654] [2020-07-10 15:27:08,639 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-10 15:27:08,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:27:08,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:08,687 INFO L264 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:27:08,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:08,697 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:08,811 INFO L263 TraceCheckUtils]: 0: Hoare triple {683#true} call ULTIMATE.init(); {683#true} is VALID [2020-07-10 15:27:08,811 INFO L280 TraceCheckUtils]: 1: Hoare triple {683#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {683#true} is VALID [2020-07-10 15:27:08,811 INFO L280 TraceCheckUtils]: 2: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 15:27:08,812 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {683#true} {683#true} #72#return; {683#true} is VALID [2020-07-10 15:27:08,812 INFO L263 TraceCheckUtils]: 4: Hoare triple {683#true} call #t~ret10 := main(); {683#true} is VALID [2020-07-10 15:27:08,812 INFO L280 TraceCheckUtils]: 5: Hoare triple {683#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {683#true} is VALID [2020-07-10 15:27:08,813 INFO L280 TraceCheckUtils]: 6: Hoare triple {683#true} assume !(~N~0 <= 0); {683#true} is VALID [2020-07-10 15:27:08,813 INFO L263 TraceCheckUtils]: 7: Hoare triple {683#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {683#true} is VALID [2020-07-10 15:27:08,813 INFO L280 TraceCheckUtils]: 8: Hoare triple {683#true} ~cond := #in~cond; {683#true} is VALID [2020-07-10 15:27:08,814 INFO L280 TraceCheckUtils]: 9: Hoare triple {683#true} assume !(0 == ~cond); {683#true} is VALID [2020-07-10 15:27:08,814 INFO L280 TraceCheckUtils]: 10: Hoare triple {683#true} assume true; {683#true} is VALID [2020-07-10 15:27:08,814 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {683#true} {683#true} #68#return; {683#true} is VALID [2020-07-10 15:27:08,815 INFO L280 TraceCheckUtils]: 12: Hoare triple {683#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; {737#(<= 0 main_~i~0)} is VALID [2020-07-10 15:27:08,816 INFO L280 TraceCheckUtils]: 13: Hoare triple {737#(<= 0 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(4, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {737#(<= 0 main_~i~0)} is VALID [2020-07-10 15:27:08,817 INFO L280 TraceCheckUtils]: 14: Hoare triple {737#(<= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {693#(<= 1 main_~i~0)} is VALID [2020-07-10 15:27:08,819 INFO L280 TraceCheckUtils]: 15: Hoare triple {693#(<= 1 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(4, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {694#(<= 2 ~N~0)} is VALID [2020-07-10 15:27:08,820 INFO L280 TraceCheckUtils]: 16: Hoare triple {694#(<= 2 ~N~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {694#(<= 2 ~N~0)} is VALID [2020-07-10 15:27:08,821 INFO L280 TraceCheckUtils]: 17: Hoare triple {694#(<= 2 ~N~0)} assume !(~i~0 < ~N~0); {694#(<= 2 ~N~0)} is VALID [2020-07-10 15:27:08,821 INFO L280 TraceCheckUtils]: 18: Hoare triple {694#(<= 2 ~N~0)} ~i~0 := 0; {756#(and (<= main_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-10 15:27:08,822 INFO L280 TraceCheckUtils]: 19: Hoare triple {756#(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); {756#(and (<= main_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-10 15:27:08,823 INFO L280 TraceCheckUtils]: 20: Hoare triple {756#(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; {756#(and (<= main_~i~0 0) (<= 2 ~N~0))} is VALID [2020-07-10 15:27:08,824 INFO L280 TraceCheckUtils]: 21: Hoare triple {756#(and (<= main_~i~0 0) (<= 2 ~N~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {766#(and (<= 2 ~N~0) (<= main_~i~0 1))} is VALID [2020-07-10 15:27:08,825 INFO L280 TraceCheckUtils]: 22: Hoare triple {766#(and (<= 2 ~N~0) (<= main_~i~0 1))} assume !(~i~0 < ~N~0); {684#false} is VALID [2020-07-10 15:27:08,825 INFO L280 TraceCheckUtils]: 23: Hoare triple {684#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {684#false} is VALID [2020-07-10 15:27:08,825 INFO L263 TraceCheckUtils]: 24: Hoare triple {684#false} call __VERIFIER_assert((if #t~mem9 == 5 * ~N~0 then 1 else 0)); {684#false} is VALID [2020-07-10 15:27:08,826 INFO L280 TraceCheckUtils]: 25: Hoare triple {684#false} ~cond := #in~cond; {684#false} is VALID [2020-07-10 15:27:08,826 INFO L280 TraceCheckUtils]: 26: Hoare triple {684#false} assume 0 == ~cond; {684#false} is VALID [2020-07-10 15:27:08,826 INFO L280 TraceCheckUtils]: 27: Hoare triple {684#false} assume !false; {684#false} is VALID [2020-07-10 15:27:08,827 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-10 15:27:08,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:08,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-10 15:27:08,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595895348] [2020-07-10 15:27:08,829 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-10 15:27:08,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:08,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:27:08,876 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-10 15:27:08,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:27:08,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:08,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:27:08,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:27:08,878 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand 11 states. [2020-07-10 15:27:09,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:09,553 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2020-07-10 15:27:09,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:27:09,554 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 28 [2020-07-10 15:27:09,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:09,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:09,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2020-07-10 15:27:09,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:09,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2020-07-10 15:27:09,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2020-07-10 15:27:09,656 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-10 15:27:09,657 INFO L225 Difference]: With dead ends: 45 [2020-07-10 15:27:09,658 INFO L226 Difference]: Without dead ends: 39 [2020-07-10 15:27:09,658 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-10 15:27:09,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2020-07-10 15:27:09,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2020-07-10 15:27:09,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:09,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand 35 states. [2020-07-10 15:27:09,701 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 35 states. [2020-07-10 15:27:09,701 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 35 states. [2020-07-10 15:27:09,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:09,704 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-10 15:27:09,704 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-10 15:27:09,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:09,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:09,705 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 39 states. [2020-07-10 15:27:09,706 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 39 states. [2020-07-10 15:27:09,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:09,709 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2020-07-10 15:27:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2020-07-10 15:27:09,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:09,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:09,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:09,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:09,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 15:27:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2020-07-10 15:27:09,712 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 28 [2020-07-10 15:27:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:09,713 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2020-07-10 15:27:09,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:27:09,713 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:27:09,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2020-07-10 15:27:09,714 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:09,714 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-10 15:27:09,929 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:09,930 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:09,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:09,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1018004383, now seen corresponding path program 3 times [2020-07-10 15:27:09,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:09,932 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147955538] [2020-07-10 15:27:09,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:09,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:10,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:10,052 INFO L280 TraceCheckUtils]: 0: Hoare triple {999#(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; {985#true} is VALID [2020-07-10 15:27:10,053 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:27:10,053 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {985#true} {985#true} #72#return; {985#true} is VALID [2020-07-10 15:27:10,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:10,061 INFO L280 TraceCheckUtils]: 0: Hoare triple {985#true} ~cond := #in~cond; {985#true} is VALID [2020-07-10 15:27:10,061 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} assume !(0 == ~cond); {985#true} is VALID [2020-07-10 15:27:10,061 INFO L280 TraceCheckUtils]: 2: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:27:10,061 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {985#true} {985#true} #68#return; {985#true} is VALID [2020-07-10 15:27:10,063 INFO L263 TraceCheckUtils]: 0: Hoare triple {985#true} call ULTIMATE.init(); {999#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= ~N~0 |old(~N~0)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:27:10,064 INFO L280 TraceCheckUtils]: 1: Hoare triple {999#(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; {985#true} is VALID [2020-07-10 15:27:10,064 INFO L280 TraceCheckUtils]: 2: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:27:10,064 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {985#true} {985#true} #72#return; {985#true} is VALID [2020-07-10 15:27:10,064 INFO L263 TraceCheckUtils]: 4: Hoare triple {985#true} call #t~ret10 := main(); {985#true} is VALID [2020-07-10 15:27:10,065 INFO L280 TraceCheckUtils]: 5: Hoare triple {985#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {985#true} is VALID [2020-07-10 15:27:10,065 INFO L280 TraceCheckUtils]: 6: Hoare triple {985#true} assume !(~N~0 <= 0); {985#true} is VALID [2020-07-10 15:27:10,065 INFO L263 TraceCheckUtils]: 7: Hoare triple {985#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {985#true} is VALID [2020-07-10 15:27:10,065 INFO L280 TraceCheckUtils]: 8: Hoare triple {985#true} ~cond := #in~cond; {985#true} is VALID [2020-07-10 15:27:10,066 INFO L280 TraceCheckUtils]: 9: Hoare triple {985#true} assume !(0 == ~cond); {985#true} is VALID [2020-07-10 15:27:10,066 INFO L280 TraceCheckUtils]: 10: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:27:10,066 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {985#true} {985#true} #68#return; {985#true} is VALID [2020-07-10 15:27:10,071 INFO L280 TraceCheckUtils]: 12: Hoare triple {985#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; {994#(= 0 main_~i~0)} is VALID [2020-07-10 15:27:10,072 INFO L280 TraceCheckUtils]: 13: Hoare triple {994#(= 0 main_~i~0)} assume !!(~i~0 < ~N~0);call write~int(4, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {994#(= 0 main_~i~0)} is VALID [2020-07-10 15:27:10,073 INFO L280 TraceCheckUtils]: 14: Hoare triple {994#(= 0 main_~i~0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {995#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:10,074 INFO L280 TraceCheckUtils]: 15: Hoare triple {995#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {996#(<= ~N~0 1)} is VALID [2020-07-10 15:27:10,074 INFO L280 TraceCheckUtils]: 16: Hoare triple {996#(<= ~N~0 1)} ~i~0 := 0; {997#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-10 15:27:10,075 INFO L280 TraceCheckUtils]: 17: Hoare triple {997#(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); {997#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-10 15:27:10,076 INFO L280 TraceCheckUtils]: 18: Hoare triple {997#(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; {997#(and (<= ~N~0 1) (= 0 main_~i~0))} is VALID [2020-07-10 15:27:10,077 INFO L280 TraceCheckUtils]: 19: Hoare triple {997#(and (<= ~N~0 1) (= 0 main_~i~0))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {998#(<= ~N~0 main_~i~0)} is VALID [2020-07-10 15:27:10,078 INFO L280 TraceCheckUtils]: 20: Hoare triple {998#(<= ~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); {986#false} is VALID [2020-07-10 15:27:10,078 INFO L280 TraceCheckUtils]: 21: Hoare triple {986#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; {986#false} is VALID [2020-07-10 15:27:10,078 INFO L280 TraceCheckUtils]: 22: Hoare triple {986#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {986#false} is VALID [2020-07-10 15:27:10,078 INFO L280 TraceCheckUtils]: 23: Hoare triple {986#false} assume !(~i~0 < ~N~0); {986#false} is VALID [2020-07-10 15:27:10,079 INFO L280 TraceCheckUtils]: 24: Hoare triple {986#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {986#false} is VALID [2020-07-10 15:27:10,079 INFO L263 TraceCheckUtils]: 25: Hoare triple {986#false} call __VERIFIER_assert((if #t~mem9 == 5 * ~N~0 then 1 else 0)); {986#false} is VALID [2020-07-10 15:27:10,079 INFO L280 TraceCheckUtils]: 26: Hoare triple {986#false} ~cond := #in~cond; {986#false} is VALID [2020-07-10 15:27:10,079 INFO L280 TraceCheckUtils]: 27: Hoare triple {986#false} assume 0 == ~cond; {986#false} is VALID [2020-07-10 15:27:10,079 INFO L280 TraceCheckUtils]: 28: Hoare triple {986#false} assume !false; {986#false} is VALID [2020-07-10 15:27:10,081 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-10 15:27:10,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147955538] [2020-07-10 15:27:10,081 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325748550] [2020-07-10 15:27:10,081 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-10 15:27:10,132 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-10 15:27:10,132 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:27:10,133 INFO L264 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-10 15:27:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:27:10,146 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:27:10,235 INFO L263 TraceCheckUtils]: 0: Hoare triple {985#true} call ULTIMATE.init(); {985#true} is VALID [2020-07-10 15:27:10,236 INFO L280 TraceCheckUtils]: 1: Hoare triple {985#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;~N~0 := 0; {985#true} is VALID [2020-07-10 15:27:10,236 INFO L280 TraceCheckUtils]: 2: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:27:10,236 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {985#true} {985#true} #72#return; {985#true} is VALID [2020-07-10 15:27:10,236 INFO L263 TraceCheckUtils]: 4: Hoare triple {985#true} call #t~ret10 := main(); {985#true} is VALID [2020-07-10 15:27:10,236 INFO L280 TraceCheckUtils]: 5: Hoare triple {985#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~N~0 := #t~nondet0;havoc #t~nondet0; {985#true} is VALID [2020-07-10 15:27:10,237 INFO L280 TraceCheckUtils]: 6: Hoare triple {985#true} assume !(~N~0 <= 0); {985#true} is VALID [2020-07-10 15:27:10,237 INFO L263 TraceCheckUtils]: 7: Hoare triple {985#true} call assume_abort_if_not((if ~N~0 <= 536870911 then 1 else 0)); {985#true} is VALID [2020-07-10 15:27:10,237 INFO L280 TraceCheckUtils]: 8: Hoare triple {985#true} ~cond := #in~cond; {985#true} is VALID [2020-07-10 15:27:10,237 INFO L280 TraceCheckUtils]: 9: Hoare triple {985#true} assume !(0 == ~cond); {985#true} is VALID [2020-07-10 15:27:10,237 INFO L280 TraceCheckUtils]: 10: Hoare triple {985#true} assume true; {985#true} is VALID [2020-07-10 15:27:10,238 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {985#true} {985#true} #68#return; {985#true} is VALID [2020-07-10 15:27:10,238 INFO L280 TraceCheckUtils]: 12: Hoare triple {985#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; {1039#(<= main_~i~0 0)} is VALID [2020-07-10 15:27:10,239 INFO L280 TraceCheckUtils]: 13: Hoare triple {1039#(<= main_~i~0 0)} assume !!(~i~0 < ~N~0);call write~int(4, ~a~0.base, ~a~0.offset + 4 * ~i~0, 4); {1039#(<= main_~i~0 0)} is VALID [2020-07-10 15:27:10,240 INFO L280 TraceCheckUtils]: 14: Hoare triple {1039#(<= main_~i~0 0)} #t~post2 := ~i~0;~i~0 := 1 + #t~post2;havoc #t~post2; {995#(<= main_~i~0 1)} is VALID [2020-07-10 15:27:10,241 INFO L280 TraceCheckUtils]: 15: Hoare triple {995#(<= main_~i~0 1)} assume !(~i~0 < ~N~0); {996#(<= ~N~0 1)} is VALID [2020-07-10 15:27:10,241 INFO L280 TraceCheckUtils]: 16: Hoare triple {996#(<= ~N~0 1)} ~i~0 := 0; {1052#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:27:10,242 INFO L280 TraceCheckUtils]: 17: Hoare triple {1052#(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); {1052#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:27:10,242 INFO L280 TraceCheckUtils]: 18: Hoare triple {1052#(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; {1052#(and (<= 0 main_~i~0) (<= ~N~0 1))} is VALID [2020-07-10 15:27:10,243 INFO L280 TraceCheckUtils]: 19: Hoare triple {1052#(and (<= 0 main_~i~0) (<= ~N~0 1))} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1062#(and (<= ~N~0 1) (<= 1 main_~i~0))} is VALID [2020-07-10 15:27:10,244 INFO L280 TraceCheckUtils]: 20: Hoare triple {1062#(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); {986#false} is VALID [2020-07-10 15:27:10,244 INFO L280 TraceCheckUtils]: 21: Hoare triple {986#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; {986#false} is VALID [2020-07-10 15:27:10,244 INFO L280 TraceCheckUtils]: 22: Hoare triple {986#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {986#false} is VALID [2020-07-10 15:27:10,244 INFO L280 TraceCheckUtils]: 23: Hoare triple {986#false} assume !(~i~0 < ~N~0); {986#false} is VALID [2020-07-10 15:27:10,245 INFO L280 TraceCheckUtils]: 24: Hoare triple {986#false} call #t~mem9 := read~int(~#sum~0.base, ~#sum~0.offset, 8); {986#false} is VALID [2020-07-10 15:27:10,245 INFO L263 TraceCheckUtils]: 25: Hoare triple {986#false} call __VERIFIER_assert((if #t~mem9 == 5 * ~N~0 then 1 else 0)); {986#false} is VALID [2020-07-10 15:27:10,245 INFO L280 TraceCheckUtils]: 26: Hoare triple {986#false} ~cond := #in~cond; {986#false} is VALID [2020-07-10 15:27:10,245 INFO L280 TraceCheckUtils]: 27: Hoare triple {986#false} assume 0 == ~cond; {986#false} is VALID [2020-07-10 15:27:10,245 INFO L280 TraceCheckUtils]: 28: Hoare triple {986#false} assume !false; {986#false} is VALID [2020-07-10 15:27:10,246 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-10 15:27:10,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:27:10,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2020-07-10 15:27:10,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724218253] [2020-07-10 15:27:10,248 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-07-10 15:27:10,248 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:27:10,248 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:27:10,303 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-10 15:27:10,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:27:10,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:27:10,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:27:10,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:27:10,304 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 11 states. [2020-07-10 15:27:10,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:10,747 INFO L93 Difference]: Finished difference Result 49 states and 55 transitions. [2020-07-10 15:27:10,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:27:10,748 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 29 [2020-07-10 15:27:10,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:27:10,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:10,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2020-07-10 15:27:10,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:27:10,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 55 transitions. [2020-07-10 15:27:10,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 55 transitions. [2020-07-10 15:27:10,832 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-10 15:27:10,834 INFO L225 Difference]: With dead ends: 49 [2020-07-10 15:27:10,834 INFO L226 Difference]: Without dead ends: 35 [2020-07-10 15:27:10,835 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-10 15:27:10,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-10 15:27:10,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2020-07-10 15:27:10,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:27:10,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 32 states. [2020-07-10 15:27:10,878 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 32 states. [2020-07-10 15:27:10,878 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 32 states. [2020-07-10 15:27:10,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:10,880 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-10 15:27:10,880 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:27:10,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:10,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:10,881 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 35 states. [2020-07-10 15:27:10,881 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 35 states. [2020-07-10 15:27:10,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:27:10,884 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2020-07-10 15:27:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2020-07-10 15:27:10,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:27:10,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:27:10,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:27:10,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:27:10,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 15:27:10,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-07-10 15:27:10,887 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 29 [2020-07-10 15:27:10,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:27:10,887 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-07-10 15:27:10,887 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:27:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-07-10 15:27:10,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 15:27:10,889 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:27:10,889 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-10 15:27:11,096 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:27:11,098 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:27:11,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:27:11,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2056219107, now seen corresponding path program 4 times [2020-07-10 15:27:11,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:27:11,099 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462209049] [2020-07-10 15:27:11,099 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:27:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-10 15:27:11,186 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-10 15:27:11,186 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-10 15:27:11,187 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 15:27:11,235 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2020-07-10 15:27:11,235 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:11,235 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-10 15:27:11,236 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 15:27:11,236 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-10 15:27:11,236 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-10 15:27:11,236 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:27:11,236 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:11,236 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-10 15:27:11,237 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:27:11,237 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-10 15:27:11,237 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:27:11,237 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2020-07-10 15:27:11,237 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:11,237 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-10 15:27:11,237 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:27:11,238 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:27:11,238 WARN L170 areAnnotationChecker]: L11-2 has no Hoare annotation [2020-07-10 15:27:11,238 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:27:11,238 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:11,238 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-10 15:27:11,238 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:27:11,239 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 15:27:11,239 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-10 15:27:11,239 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2020-07-10 15:27:11,239 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:27:11,239 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:27:11,239 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:27:11,239 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:11,239 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:11,240 WARN L170 areAnnotationChecker]: L30-3 has no Hoare annotation [2020-07-10 15:27:11,240 WARN L170 areAnnotationChecker]: L44-1 has no Hoare annotation [2020-07-10 15:27:11,240 WARN L170 areAnnotationChecker]: L30-4 has no Hoare annotation [2020-07-10 15:27:11,240 WARN L170 areAnnotationChecker]: L30-2 has no Hoare annotation [2020-07-10 15:27:11,240 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:27:11,240 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:27:11,240 WARN L170 areAnnotationChecker]: L35-3 has no Hoare annotation [2020-07-10 15:27:11,240 WARN L170 areAnnotationChecker]: L35-4 has no Hoare annotation [2020-07-10 15:27:11,241 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:27:11,241 WARN L170 areAnnotationChecker]: L37 has no Hoare annotation [2020-07-10 15:27:11,241 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-10 15:27:11,241 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-10 15:27:11,241 WARN L170 areAnnotationChecker]: L35-2 has no Hoare annotation [2020-07-10 15:27:11,241 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:27:11,244 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:27:11 BoogieIcfgContainer [2020-07-10 15:27:11,244 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:27:11,246 INFO L168 Benchmark]: Toolchain (without parser) took 15203.52 ms. Allocated memory was 136.8 MB in the beginning and 308.8 MB in the end (delta: 172.0 MB). Free memory was 101.2 MB in the beginning and 96.9 MB in the end (delta: 4.3 MB). Peak memory consumption was 176.3 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:11,247 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-10 15:27:11,248 INFO L168 Benchmark]: CACSL2BoogieTranslator took 288.59 ms. Allocated memory is still 136.8 MB. Free memory was 100.8 MB in the beginning and 89.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:11,249 INFO L168 Benchmark]: Boogie Preprocessor took 147.92 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 89.8 MB in the beginning and 177.0 MB in the end (delta: -87.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:11,249 INFO L168 Benchmark]: RCFGBuilder took 452.58 ms. Allocated memory is still 199.8 MB. Free memory was 177.0 MB in the beginning and 153.3 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:11,250 INFO L168 Benchmark]: TraceAbstraction took 14307.72 ms. Allocated memory was 199.8 MB in the beginning and 308.8 MB in the end (delta: 109.1 MB). Free memory was 152.7 MB in the beginning and 96.9 MB in the end (delta: 55.8 MB). Peak memory consumption was 164.8 MB. Max. memory is 7.1 GB. [2020-07-10 15:27:11,254 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.24 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 288.59 ms. Allocated memory is still 136.8 MB. Free memory was 100.8 MB in the beginning and 89.8 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 147.92 ms. Allocated memory was 136.8 MB in the beginning and 199.8 MB in the end (delta: 62.9 MB). Free memory was 89.8 MB in the beginning and 177.0 MB in the end (delta: -87.2 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 452.58 ms. Allocated memory is still 199.8 MB. Free memory was 177.0 MB in the beginning and 153.3 MB in the end (delta: 23.7 MB). Peak memory consumption was 23.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14307.72 ms. Allocated memory was 199.8 MB in the beginning and 308.8 MB in the end (delta: 109.1 MB). Free memory was 152.7 MB in the beginning and 96.9 MB in the end (delta: 55.8 MB). Peak memory consumption was 164.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