/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-lopstr16/flag_loopdep.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:25:52,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:25:52,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:25:52,896 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:25:52,896 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:25:52,898 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:25:52,900 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:25:52,910 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:25:52,913 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:25:52,916 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:25:52,918 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:25:52,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:25:52,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:25:52,921 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:25:52,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:25:52,925 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:25:52,926 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:25:52,928 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:25:52,929 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:25:52,933 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:25:52,938 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:25:52,942 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:25:52,943 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:25:52,943 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:25:52,946 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:25:52,946 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:25:52,946 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:25:52,948 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:25:52,949 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:25:52,950 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:25:52,951 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:25:52,951 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:25:52,952 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:25:52,953 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:25:52,954 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:25:52,955 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:25:52,955 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:25:52,956 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:25:52,956 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:25:52,957 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:25:52,958 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:25:52,959 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:25:52,994 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:25:52,995 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:25:52,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:25:52,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:25:53,000 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:25:53,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:25:53,000 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:25:53,002 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:25:53,002 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:25:53,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:25:53,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:25:53,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:25:53,003 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:25:53,003 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:25:53,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:25:53,004 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:25:53,004 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:25:53,005 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:25:53,005 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:25:53,005 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:25:53,005 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:25:53,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:25:53,006 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:25:53,006 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:25:53,006 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:25:53,006 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:25:53,006 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:25:53,007 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:25:53,007 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:25:53,007 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:25:53,267 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:25:53,279 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:25:53,283 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:25:53,284 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:25:53,285 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:25:53,285 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-lopstr16/flag_loopdep.i [2020-07-10 15:25:53,361 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1910bf9c/1c8cda2796e7453c982b6c5dc73e705e/FLAG4557bd3d1 [2020-07-10 15:25:53,798 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:25:53,799 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-lopstr16/flag_loopdep.i [2020-07-10 15:25:53,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1910bf9c/1c8cda2796e7453c982b6c5dc73e705e/FLAG4557bd3d1 [2020-07-10 15:25:54,174 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1910bf9c/1c8cda2796e7453c982b6c5dc73e705e [2020-07-10 15:25:54,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:25:54,184 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:25:54,185 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:25:54,185 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:25:54,189 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:25:54,190 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,193 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c11b393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54, skipping insertion in model container [2020-07-10 15:25:54,193 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,201 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:25:54,218 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:25:54,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:25:54,417 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:25:54,437 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:25:54,454 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:25:54,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54 WrapperNode [2020-07-10 15:25:54,455 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:25:54,455 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:25:54,456 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:25:54,456 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:25:54,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,581 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,594 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,595 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (1/1) ... [2020-07-10 15:25:54,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:25:54,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:25:54,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:25:54,601 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:25:54,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (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:25:54,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:25:54,663 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:25:54,663 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:25:54,663 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-07-10 15:25:54,663 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:25:54,663 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:25:54,664 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:25:54,664 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:25:54,664 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_pointer [2020-07-10 15:25:54,664 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-07-10 15:25:54,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:25:54,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:25:54,665 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:25:54,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:25:54,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:25:54,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:25:54,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:25:54,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:25:55,034 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:25:55,034 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:25:55,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:25:55 BoogieIcfgContainer [2020-07-10 15:25:55,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:25:55,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:25:55,039 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:25:55,042 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:25:55,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:25:54" (1/3) ... [2020-07-10 15:25:55,043 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d09bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:25:55, skipping insertion in model container [2020-07-10 15:25:55,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:54" (2/3) ... [2020-07-10 15:25:55,044 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d09bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:25:55, skipping insertion in model container [2020-07-10 15:25:55,044 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:25:55" (3/3) ... [2020-07-10 15:25:55,045 INFO L109 eAbstractionObserver]: Analyzing ICFG flag_loopdep.i [2020-07-10 15:25:55,054 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:25:55,060 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:25:55,072 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:25:55,091 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:25:55,091 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:25:55,091 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:25:55,092 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:25:55,092 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:25:55,092 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:25:55,092 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:25:55,092 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:25:55,107 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-10 15:25:55,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:25:55,112 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:55,113 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] [2020-07-10 15:25:55,113 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:55,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:55,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1059974619, now seen corresponding path program 1 times [2020-07-10 15:25:55,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:55,128 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040874682] [2020-07-10 15:25:55,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:55,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:55,338 INFO L280 TraceCheckUtils]: 0: Hoare triple {45#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {36#true} is VALID [2020-07-10 15:25:55,339 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 15:25:55,340 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #80#return; {36#true} is VALID [2020-07-10 15:25:55,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:55,402 INFO L280 TraceCheckUtils]: 0: Hoare triple {46#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {36#true} is VALID [2020-07-10 15:25:55,402 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume !(~i~0 < ~size); {36#true} is VALID [2020-07-10 15:25:55,403 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 15:25:55,403 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #76#return; {36#true} is VALID [2020-07-10 15:25:55,406 INFO L263 TraceCheckUtils]: 0: Hoare triple {36#true} call ULTIMATE.init(); {45#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:55,406 INFO L280 TraceCheckUtils]: 1: Hoare triple {45#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {36#true} is VALID [2020-07-10 15:25:55,407 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 15:25:55,407 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #80#return; {36#true} is VALID [2020-07-10 15:25:55,408 INFO L263 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret6 := main(); {36#true} is VALID [2020-07-10 15:25:55,408 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {36#true} is VALID [2020-07-10 15:25:55,412 INFO L263 TraceCheckUtils]: 6: Hoare triple {36#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {46#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:25:55,413 INFO L280 TraceCheckUtils]: 7: Hoare triple {46#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {36#true} is VALID [2020-07-10 15:25:55,413 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#true} assume !(~i~0 < ~size); {36#true} is VALID [2020-07-10 15:25:55,413 INFO L280 TraceCheckUtils]: 9: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 15:25:55,414 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {36#true} {36#true} #76#return; {36#true} is VALID [2020-07-10 15:25:55,414 INFO L280 TraceCheckUtils]: 11: Hoare triple {36#true} ~i~1 := 0; {36#true} is VALID [2020-07-10 15:25:55,417 INFO L280 TraceCheckUtils]: 12: Hoare triple {36#true} assume !true; {37#false} is VALID [2020-07-10 15:25:55,418 INFO L280 TraceCheckUtils]: 13: Hoare triple {37#false} ~i~1 := 0; {37#false} is VALID [2020-07-10 15:25:55,419 INFO L280 TraceCheckUtils]: 14: Hoare triple {37#false} assume !!(~i~1 < 1000000); {37#false} is VALID [2020-07-10 15:25:55,419 INFO L280 TraceCheckUtils]: 15: Hoare triple {37#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {37#false} is VALID [2020-07-10 15:25:55,419 INFO L263 TraceCheckUtils]: 16: Hoare triple {37#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {37#false} is VALID [2020-07-10 15:25:55,420 INFO L280 TraceCheckUtils]: 17: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2020-07-10 15:25:55,423 INFO L280 TraceCheckUtils]: 18: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2020-07-10 15:25:55,423 INFO L280 TraceCheckUtils]: 19: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-10 15:25:55,427 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:25:55,429 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040874682] [2020-07-10 15:25:55,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:55,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:25:55,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504103169] [2020-07-10 15:25:55,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-07-10 15:25:55,443 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:55,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:25:55,512 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:55,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:25:55,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:55,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:25:55,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:25:55,527 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 4 states. [2020-07-10 15:25:55,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:55,847 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2020-07-10 15:25:55,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:25:55,847 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-07-10 15:25:55,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:55,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:25:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2020-07-10 15:25:55,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:25:55,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2020-07-10 15:25:55,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2020-07-10 15:25:55,986 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:55,999 INFO L225 Difference]: With dead ends: 59 [2020-07-10 15:25:55,999 INFO L226 Difference]: Without dead ends: 31 [2020-07-10 15:25:56,002 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-10 15:25:56,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-10 15:25:56,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2020-07-10 15:25:56,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:56,061 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 28 states. [2020-07-10 15:25:56,062 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 28 states. [2020-07-10 15:25:56,062 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 28 states. [2020-07-10 15:25:56,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,067 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-10 15:25:56,067 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2020-07-10 15:25:56,068 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:56,068 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:56,068 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 31 states. [2020-07-10 15:25:56,068 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 31 states. [2020-07-10 15:25:56,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,073 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-10 15:25:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2020-07-10 15:25:56,073 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:56,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:56,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:56,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 15:25:56,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-10 15:25:56,079 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2020-07-10 15:25:56,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:56,079 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-10 15:25:56,079 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:25:56,079 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-10 15:25:56,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:25:56,080 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:56,081 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] [2020-07-10 15:25:56,081 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:25:56,081 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:56,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:56,082 INFO L82 PathProgramCache]: Analyzing trace with hash -931069882, now seen corresponding path program 1 times [2020-07-10 15:25:56,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:56,083 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598107858] [2020-07-10 15:25:56,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,215 INFO L280 TraceCheckUtils]: 0: Hoare triple {237#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {228#true} is VALID [2020-07-10 15:25:56,215 INFO L280 TraceCheckUtils]: 1: Hoare triple {228#true} assume true; {228#true} is VALID [2020-07-10 15:25:56,216 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {228#true} {228#true} #80#return; {228#true} is VALID [2020-07-10 15:25:56,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,340 INFO L280 TraceCheckUtils]: 0: Hoare triple {238#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {239#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:25:56,342 INFO L280 TraceCheckUtils]: 1: Hoare triple {239#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {240#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:25:56,343 INFO L280 TraceCheckUtils]: 2: Hoare triple {240#(not (= |init_#in~size| 1000000))} assume true; {240#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:25:56,344 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {240#(not (= |init_#in~size| 1000000))} {228#true} #76#return; {229#false} is VALID [2020-07-10 15:25:56,345 INFO L263 TraceCheckUtils]: 0: Hoare triple {228#true} call ULTIMATE.init(); {237#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:56,346 INFO L280 TraceCheckUtils]: 1: Hoare triple {237#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {228#true} is VALID [2020-07-10 15:25:56,346 INFO L280 TraceCheckUtils]: 2: Hoare triple {228#true} assume true; {228#true} is VALID [2020-07-10 15:25:56,346 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} #80#return; {228#true} is VALID [2020-07-10 15:25:56,347 INFO L263 TraceCheckUtils]: 4: Hoare triple {228#true} call #t~ret6 := main(); {228#true} is VALID [2020-07-10 15:25:56,347 INFO L280 TraceCheckUtils]: 5: Hoare triple {228#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {228#true} is VALID [2020-07-10 15:25:56,349 INFO L263 TraceCheckUtils]: 6: Hoare triple {228#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {238#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:25:56,350 INFO L280 TraceCheckUtils]: 7: Hoare triple {238#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {239#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:25:56,351 INFO L280 TraceCheckUtils]: 8: Hoare triple {239#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {240#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:25:56,352 INFO L280 TraceCheckUtils]: 9: Hoare triple {240#(not (= |init_#in~size| 1000000))} assume true; {240#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:25:56,354 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {240#(not (= |init_#in~size| 1000000))} {228#true} #76#return; {229#false} is VALID [2020-07-10 15:25:56,354 INFO L280 TraceCheckUtils]: 11: Hoare triple {229#false} ~i~1 := 0; {229#false} is VALID [2020-07-10 15:25:56,355 INFO L280 TraceCheckUtils]: 12: Hoare triple {229#false} assume !(~i~1 < 1000000); {229#false} is VALID [2020-07-10 15:25:56,355 INFO L280 TraceCheckUtils]: 13: Hoare triple {229#false} ~i~1 := 0; {229#false} is VALID [2020-07-10 15:25:56,355 INFO L280 TraceCheckUtils]: 14: Hoare triple {229#false} assume !!(~i~1 < 1000000); {229#false} is VALID [2020-07-10 15:25:56,356 INFO L280 TraceCheckUtils]: 15: Hoare triple {229#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {229#false} is VALID [2020-07-10 15:25:56,356 INFO L263 TraceCheckUtils]: 16: Hoare triple {229#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {229#false} is VALID [2020-07-10 15:25:56,356 INFO L280 TraceCheckUtils]: 17: Hoare triple {229#false} ~cond := #in~cond; {229#false} is VALID [2020-07-10 15:25:56,357 INFO L280 TraceCheckUtils]: 18: Hoare triple {229#false} assume 0 == ~cond; {229#false} is VALID [2020-07-10 15:25:56,357 INFO L280 TraceCheckUtils]: 19: Hoare triple {229#false} assume !false; {229#false} is VALID [2020-07-10 15:25:56,358 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:25:56,359 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598107858] [2020-07-10 15:25:56,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:56,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:25:56,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177018234] [2020-07-10 15:25:56,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-10 15:25:56,362 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:56,362 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:25:56,388 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:56,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:25:56,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:56,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:25:56,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:25:56,390 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2020-07-10 15:25:56,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,778 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2020-07-10 15:25:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:25:56,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-10 15:25:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:25:56,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2020-07-10 15:25:56,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:25:56,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2020-07-10 15:25:56,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2020-07-10 15:25:56,871 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:56,874 INFO L225 Difference]: With dead ends: 48 [2020-07-10 15:25:56,874 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 15:25:56,875 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:25:56,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 15:25:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-07-10 15:25:56,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:56,906 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2020-07-10 15:25:56,906 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2020-07-10 15:25:56,907 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2020-07-10 15:25:56,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,909 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-10 15:25:56,910 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-10 15:25:56,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:56,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:56,911 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2020-07-10 15:25:56,911 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2020-07-10 15:25:56,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,913 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-10 15:25:56,914 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-10 15:25:56,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:56,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:56,915 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:56,915 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:56,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:25:56,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-07-10 15:25:56,917 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2020-07-10 15:25:56,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:56,918 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-07-10 15:25:56,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:25:56,918 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-10 15:25:56,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:25:56,919 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:56,919 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:56,919 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:25:56,920 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:56,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:56,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1782065480, now seen corresponding path program 1 times [2020-07-10 15:25:56,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:56,921 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752399037] [2020-07-10 15:25:56,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,978 INFO L280 TraceCheckUtils]: 0: Hoare triple {426#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {415#true} is VALID [2020-07-10 15:25:56,979 INFO L280 TraceCheckUtils]: 1: Hoare triple {415#true} assume true; {415#true} is VALID [2020-07-10 15:25:56,979 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {415#true} {415#true} #80#return; {415#true} is VALID [2020-07-10 15:25:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,103 INFO L280 TraceCheckUtils]: 0: Hoare triple {427#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {428#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:25:57,104 INFO L280 TraceCheckUtils]: 1: Hoare triple {428#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {428#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:25:57,105 INFO L280 TraceCheckUtils]: 2: Hoare triple {428#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {429#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:25:57,106 INFO L280 TraceCheckUtils]: 3: Hoare triple {429#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {430#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:25:57,107 INFO L280 TraceCheckUtils]: 4: Hoare triple {430#(not (= |init_#in~size| 1000000))} assume true; {430#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:25:57,108 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {430#(not (= |init_#in~size| 1000000))} {415#true} #76#return; {416#false} is VALID [2020-07-10 15:25:57,110 INFO L263 TraceCheckUtils]: 0: Hoare triple {415#true} call ULTIMATE.init(); {426#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:57,110 INFO L280 TraceCheckUtils]: 1: Hoare triple {426#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {415#true} is VALID [2020-07-10 15:25:57,110 INFO L280 TraceCheckUtils]: 2: Hoare triple {415#true} assume true; {415#true} is VALID [2020-07-10 15:25:57,110 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {415#true} {415#true} #80#return; {415#true} is VALID [2020-07-10 15:25:57,111 INFO L263 TraceCheckUtils]: 4: Hoare triple {415#true} call #t~ret6 := main(); {415#true} is VALID [2020-07-10 15:25:57,111 INFO L280 TraceCheckUtils]: 5: Hoare triple {415#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {415#true} is VALID [2020-07-10 15:25:57,112 INFO L263 TraceCheckUtils]: 6: Hoare triple {415#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {427#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:25:57,113 INFO L280 TraceCheckUtils]: 7: Hoare triple {427#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {428#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:25:57,115 INFO L280 TraceCheckUtils]: 8: Hoare triple {428#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {428#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:25:57,116 INFO L280 TraceCheckUtils]: 9: Hoare triple {428#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {429#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:25:57,117 INFO L280 TraceCheckUtils]: 10: Hoare triple {429#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {430#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:25:57,117 INFO L280 TraceCheckUtils]: 11: Hoare triple {430#(not (= |init_#in~size| 1000000))} assume true; {430#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:25:57,118 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {430#(not (= |init_#in~size| 1000000))} {415#true} #76#return; {416#false} is VALID [2020-07-10 15:25:57,119 INFO L280 TraceCheckUtils]: 13: Hoare triple {416#false} ~i~1 := 0; {416#false} is VALID [2020-07-10 15:25:57,119 INFO L280 TraceCheckUtils]: 14: Hoare triple {416#false} assume !(~i~1 < 1000000); {416#false} is VALID [2020-07-10 15:25:57,119 INFO L280 TraceCheckUtils]: 15: Hoare triple {416#false} ~i~1 := 0; {416#false} is VALID [2020-07-10 15:25:57,120 INFO L280 TraceCheckUtils]: 16: Hoare triple {416#false} assume !!(~i~1 < 1000000); {416#false} is VALID [2020-07-10 15:25:57,120 INFO L280 TraceCheckUtils]: 17: Hoare triple {416#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {416#false} is VALID [2020-07-10 15:25:57,120 INFO L263 TraceCheckUtils]: 18: Hoare triple {416#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {416#false} is VALID [2020-07-10 15:25:57,121 INFO L280 TraceCheckUtils]: 19: Hoare triple {416#false} ~cond := #in~cond; {416#false} is VALID [2020-07-10 15:25:57,121 INFO L280 TraceCheckUtils]: 20: Hoare triple {416#false} assume 0 == ~cond; {416#false} is VALID [2020-07-10 15:25:57,121 INFO L280 TraceCheckUtils]: 21: Hoare triple {416#false} assume !false; {416#false} is VALID [2020-07-10 15:25:57,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 15:25:57,123 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752399037] [2020-07-10 15:25:57,123 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [813912147] [2020-07-10 15:25:57,123 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:25:57,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,167 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-10 15:25:57,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,184 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:57,246 INFO L263 TraceCheckUtils]: 0: Hoare triple {415#true} call ULTIMATE.init(); {415#true} is VALID [2020-07-10 15:25:57,246 INFO L280 TraceCheckUtils]: 1: Hoare triple {415#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {415#true} is VALID [2020-07-10 15:25:57,247 INFO L280 TraceCheckUtils]: 2: Hoare triple {415#true} assume true; {415#true} is VALID [2020-07-10 15:25:57,247 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {415#true} {415#true} #80#return; {415#true} is VALID [2020-07-10 15:25:57,247 INFO L263 TraceCheckUtils]: 4: Hoare triple {415#true} call #t~ret6 := main(); {415#true} is VALID [2020-07-10 15:25:57,248 INFO L280 TraceCheckUtils]: 5: Hoare triple {415#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {415#true} is VALID [2020-07-10 15:25:57,248 INFO L263 TraceCheckUtils]: 6: Hoare triple {415#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {415#true} is VALID [2020-07-10 15:25:57,248 INFO L280 TraceCheckUtils]: 7: Hoare triple {415#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {415#true} is VALID [2020-07-10 15:25:57,248 INFO L280 TraceCheckUtils]: 8: Hoare triple {415#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {415#true} is VALID [2020-07-10 15:25:57,249 INFO L280 TraceCheckUtils]: 9: Hoare triple {415#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {415#true} is VALID [2020-07-10 15:25:57,249 INFO L280 TraceCheckUtils]: 10: Hoare triple {415#true} assume !(~i~0 < ~size); {415#true} is VALID [2020-07-10 15:25:57,249 INFO L280 TraceCheckUtils]: 11: Hoare triple {415#true} assume true; {415#true} is VALID [2020-07-10 15:25:57,250 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {415#true} {415#true} #76#return; {415#true} is VALID [2020-07-10 15:25:57,251 INFO L280 TraceCheckUtils]: 13: Hoare triple {415#true} ~i~1 := 0; {473#(<= main_~i~1 0)} is VALID [2020-07-10 15:25:57,251 INFO L280 TraceCheckUtils]: 14: Hoare triple {473#(<= main_~i~1 0)} assume !(~i~1 < 1000000); {416#false} is VALID [2020-07-10 15:25:57,252 INFO L280 TraceCheckUtils]: 15: Hoare triple {416#false} ~i~1 := 0; {416#false} is VALID [2020-07-10 15:25:57,252 INFO L280 TraceCheckUtils]: 16: Hoare triple {416#false} assume !!(~i~1 < 1000000); {416#false} is VALID [2020-07-10 15:25:57,252 INFO L280 TraceCheckUtils]: 17: Hoare triple {416#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {416#false} is VALID [2020-07-10 15:25:57,253 INFO L263 TraceCheckUtils]: 18: Hoare triple {416#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {416#false} is VALID [2020-07-10 15:25:57,253 INFO L280 TraceCheckUtils]: 19: Hoare triple {416#false} ~cond := #in~cond; {416#false} is VALID [2020-07-10 15:25:57,253 INFO L280 TraceCheckUtils]: 20: Hoare triple {416#false} assume 0 == ~cond; {416#false} is VALID [2020-07-10 15:25:57,253 INFO L280 TraceCheckUtils]: 21: Hoare triple {416#false} assume !false; {416#false} is VALID [2020-07-10 15:25:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:25:57,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:25:57,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2020-07-10 15:25:57,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288794727] [2020-07-10 15:25:57,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:25:57,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:57,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:25:57,281 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:57,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:25:57,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:57,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:25:57,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:25:57,282 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2020-07-10 15:25:57,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,373 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2020-07-10 15:25:57,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:25:57,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:25:57,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:57,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:57,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2020-07-10 15:25:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2020-07-10 15:25:57,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2020-07-10 15:25:57,445 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:57,448 INFO L225 Difference]: With dead ends: 49 [2020-07-10 15:25:57,448 INFO L226 Difference]: Without dead ends: 37 [2020-07-10 15:25:57,449 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:25:57,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-10 15:25:57,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2020-07-10 15:25:57,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:57,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 30 states. [2020-07-10 15:25:57,470 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 30 states. [2020-07-10 15:25:57,470 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 30 states. [2020-07-10 15:25:57,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,474 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2020-07-10 15:25:57,474 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2020-07-10 15:25:57,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:57,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:57,475 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 37 states. [2020-07-10 15:25:57,475 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 37 states. [2020-07-10 15:25:57,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,478 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2020-07-10 15:25:57,478 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2020-07-10 15:25:57,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:57,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:57,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:57,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 15:25:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-10 15:25:57,481 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2020-07-10 15:25:57,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:57,482 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-10 15:25:57,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:25:57,482 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-10 15:25:57,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:25:57,483 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:57,483 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] [2020-07-10 15:25:57,697 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 15:25:57,698 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:57,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:57,699 INFO L82 PathProgramCache]: Analyzing trace with hash 413319423, now seen corresponding path program 1 times [2020-07-10 15:25:57,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:57,700 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311292959] [2020-07-10 15:25:57,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,790 INFO L280 TraceCheckUtils]: 0: Hoare triple {694#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {681#true} is VALID [2020-07-10 15:25:57,791 INFO L280 TraceCheckUtils]: 1: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-10 15:25:57,791 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {681#true} {681#true} #80#return; {681#true} is VALID [2020-07-10 15:25:57,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,826 INFO L280 TraceCheckUtils]: 0: Hoare triple {695#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {681#true} is VALID [2020-07-10 15:25:57,826 INFO L280 TraceCheckUtils]: 1: Hoare triple {681#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {681#true} is VALID [2020-07-10 15:25:57,827 INFO L280 TraceCheckUtils]: 2: Hoare triple {681#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {681#true} is VALID [2020-07-10 15:25:57,827 INFO L280 TraceCheckUtils]: 3: Hoare triple {681#true} assume !(~i~0 < ~size); {681#true} is VALID [2020-07-10 15:25:57,827 INFO L280 TraceCheckUtils]: 4: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-10 15:25:57,827 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {681#true} {681#true} #76#return; {681#true} is VALID [2020-07-10 15:25:57,828 INFO L263 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {694#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:57,829 INFO L280 TraceCheckUtils]: 1: Hoare triple {694#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {681#true} is VALID [2020-07-10 15:25:57,829 INFO L280 TraceCheckUtils]: 2: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-10 15:25:57,829 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {681#true} {681#true} #80#return; {681#true} is VALID [2020-07-10 15:25:57,830 INFO L263 TraceCheckUtils]: 4: Hoare triple {681#true} call #t~ret6 := main(); {681#true} is VALID [2020-07-10 15:25:57,830 INFO L280 TraceCheckUtils]: 5: Hoare triple {681#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {681#true} is VALID [2020-07-10 15:25:57,831 INFO L263 TraceCheckUtils]: 6: Hoare triple {681#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {695#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:25:57,832 INFO L280 TraceCheckUtils]: 7: Hoare triple {695#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {681#true} is VALID [2020-07-10 15:25:57,832 INFO L280 TraceCheckUtils]: 8: Hoare triple {681#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {681#true} is VALID [2020-07-10 15:25:57,832 INFO L280 TraceCheckUtils]: 9: Hoare triple {681#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {681#true} is VALID [2020-07-10 15:25:57,832 INFO L280 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(~i~0 < ~size); {681#true} is VALID [2020-07-10 15:25:57,833 INFO L280 TraceCheckUtils]: 11: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-10 15:25:57,833 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {681#true} {681#true} #76#return; {681#true} is VALID [2020-07-10 15:25:57,834 INFO L280 TraceCheckUtils]: 13: Hoare triple {681#true} ~i~1 := 0; {692#(= 0 main_~i~1)} is VALID [2020-07-10 15:25:57,834 INFO L280 TraceCheckUtils]: 14: Hoare triple {692#(= 0 main_~i~1)} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {692#(= 0 main_~i~1)} is VALID [2020-07-10 15:25:57,835 INFO L280 TraceCheckUtils]: 15: Hoare triple {692#(= 0 main_~i~1)} assume #t~mem3.base != 0 || #t~mem3.offset != 0;havoc #t~mem3.base, #t~mem3.offset;~flag~0 := 1; {692#(= 0 main_~i~1)} is VALID [2020-07-10 15:25:57,836 INFO L280 TraceCheckUtils]: 16: Hoare triple {692#(= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {693#(<= main_~i~1 1)} is VALID [2020-07-10 15:25:57,837 INFO L280 TraceCheckUtils]: 17: Hoare triple {693#(<= main_~i~1 1)} assume !(~i~1 < 1000000); {682#false} is VALID [2020-07-10 15:25:57,837 INFO L280 TraceCheckUtils]: 18: Hoare triple {682#false} ~i~1 := 0; {682#false} is VALID [2020-07-10 15:25:57,837 INFO L280 TraceCheckUtils]: 19: Hoare triple {682#false} assume !!(~i~1 < 1000000); {682#false} is VALID [2020-07-10 15:25:57,838 INFO L280 TraceCheckUtils]: 20: Hoare triple {682#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {682#false} is VALID [2020-07-10 15:25:57,838 INFO L263 TraceCheckUtils]: 21: Hoare triple {682#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {682#false} is VALID [2020-07-10 15:25:57,838 INFO L280 TraceCheckUtils]: 22: Hoare triple {682#false} ~cond := #in~cond; {682#false} is VALID [2020-07-10 15:25:57,838 INFO L280 TraceCheckUtils]: 23: Hoare triple {682#false} assume 0 == ~cond; {682#false} is VALID [2020-07-10 15:25:57,839 INFO L280 TraceCheckUtils]: 24: Hoare triple {682#false} assume !false; {682#false} is VALID [2020-07-10 15:25:57,840 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:25:57,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311292959] [2020-07-10 15:25:57,840 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040807454] [2020-07-10 15:25:57,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,880 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-10 15:25:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,905 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:57,953 INFO L263 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2020-07-10 15:25:57,954 INFO L280 TraceCheckUtils]: 1: Hoare triple {681#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {681#true} is VALID [2020-07-10 15:25:57,954 INFO L280 TraceCheckUtils]: 2: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-10 15:25:57,954 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {681#true} {681#true} #80#return; {681#true} is VALID [2020-07-10 15:25:57,955 INFO L263 TraceCheckUtils]: 4: Hoare triple {681#true} call #t~ret6 := main(); {681#true} is VALID [2020-07-10 15:25:57,955 INFO L280 TraceCheckUtils]: 5: Hoare triple {681#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {681#true} is VALID [2020-07-10 15:25:57,955 INFO L263 TraceCheckUtils]: 6: Hoare triple {681#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {681#true} is VALID [2020-07-10 15:25:57,955 INFO L280 TraceCheckUtils]: 7: Hoare triple {681#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {681#true} is VALID [2020-07-10 15:25:57,956 INFO L280 TraceCheckUtils]: 8: Hoare triple {681#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {681#true} is VALID [2020-07-10 15:25:57,956 INFO L280 TraceCheckUtils]: 9: Hoare triple {681#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {681#true} is VALID [2020-07-10 15:25:57,956 INFO L280 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(~i~0 < ~size); {681#true} is VALID [2020-07-10 15:25:57,956 INFO L280 TraceCheckUtils]: 11: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-10 15:25:57,957 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {681#true} {681#true} #76#return; {681#true} is VALID [2020-07-10 15:25:57,957 INFO L280 TraceCheckUtils]: 13: Hoare triple {681#true} ~i~1 := 0; {681#true} is VALID [2020-07-10 15:25:57,957 INFO L280 TraceCheckUtils]: 14: Hoare triple {681#true} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {681#true} is VALID [2020-07-10 15:25:57,958 INFO L280 TraceCheckUtils]: 15: Hoare triple {681#true} assume #t~mem3.base != 0 || #t~mem3.offset != 0;havoc #t~mem3.base, #t~mem3.offset;~flag~0 := 1; {744#(<= 1 main_~flag~0)} is VALID [2020-07-10 15:25:57,959 INFO L280 TraceCheckUtils]: 16: Hoare triple {744#(<= 1 main_~flag~0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {744#(<= 1 main_~flag~0)} is VALID [2020-07-10 15:25:57,959 INFO L280 TraceCheckUtils]: 17: Hoare triple {744#(<= 1 main_~flag~0)} assume !(~i~1 < 1000000); {744#(<= 1 main_~flag~0)} is VALID [2020-07-10 15:25:57,960 INFO L280 TraceCheckUtils]: 18: Hoare triple {744#(<= 1 main_~flag~0)} ~i~1 := 0; {744#(<= 1 main_~flag~0)} is VALID [2020-07-10 15:25:57,961 INFO L280 TraceCheckUtils]: 19: Hoare triple {744#(<= 1 main_~flag~0)} assume !!(~i~1 < 1000000); {744#(<= 1 main_~flag~0)} is VALID [2020-07-10 15:25:57,962 INFO L280 TraceCheckUtils]: 20: Hoare triple {744#(<= 1 main_~flag~0)} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {682#false} is VALID [2020-07-10 15:25:57,962 INFO L263 TraceCheckUtils]: 21: Hoare triple {682#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {682#false} is VALID [2020-07-10 15:25:57,962 INFO L280 TraceCheckUtils]: 22: Hoare triple {682#false} ~cond := #in~cond; {682#false} is VALID [2020-07-10 15:25:57,962 INFO L280 TraceCheckUtils]: 23: Hoare triple {682#false} assume 0 == ~cond; {682#false} is VALID [2020-07-10 15:25:57,963 INFO L280 TraceCheckUtils]: 24: Hoare triple {682#false} assume !false; {682#false} is VALID [2020-07-10 15:25:57,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:25:57,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:25:57,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2020-07-10 15:25:57,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339814259] [2020-07-10 15:25:57,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:25:57,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:57,965 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:25:57,993 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:57,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:25:57,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:57,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:25:57,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:25:57,994 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 3 states. [2020-07-10 15:25:58,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:58,077 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2020-07-10 15:25:58,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:25:58,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:25:58,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:58,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:58,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2020-07-10 15:25:58,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:58,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2020-07-10 15:25:58,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2020-07-10 15:25:58,151 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:58,152 INFO L225 Difference]: With dead ends: 48 [2020-07-10 15:25:58,153 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 15:25:58,154 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:25:58,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 15:25:58,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-10 15:25:58,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:58,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-10 15:25:58,178 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 15:25:58,178 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 15:25:58,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:58,181 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-10 15:25:58,182 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:25:58,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:58,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:58,182 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 15:25:58,182 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 15:25:58,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:58,186 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-10 15:25:58,186 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:25:58,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:58,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:58,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:58,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:58,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 15:25:58,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-10 15:25:58,192 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2020-07-10 15:25:58,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:58,193 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-10 15:25:58,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:25:58,193 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:25:58,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:25:58,196 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:58,196 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] [2020-07-10 15:25:58,397 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:58,398 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:58,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:58,398 INFO L82 PathProgramCache]: Analyzing trace with hash 20292413, now seen corresponding path program 1 times [2020-07-10 15:25:58,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:58,399 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784593805] [2020-07-10 15:25:58,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:58,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,465 INFO L280 TraceCheckUtils]: 0: Hoare triple {953#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {940#true} is VALID [2020-07-10 15:25:58,465 INFO L280 TraceCheckUtils]: 1: Hoare triple {940#true} assume true; {940#true} is VALID [2020-07-10 15:25:58,466 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {940#true} {940#true} #80#return; {940#true} is VALID [2020-07-10 15:25:58,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,487 INFO L280 TraceCheckUtils]: 0: Hoare triple {954#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {940#true} is VALID [2020-07-10 15:25:58,487 INFO L280 TraceCheckUtils]: 1: Hoare triple {940#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {940#true} is VALID [2020-07-10 15:25:58,488 INFO L280 TraceCheckUtils]: 2: Hoare triple {940#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {940#true} is VALID [2020-07-10 15:25:58,488 INFO L280 TraceCheckUtils]: 3: Hoare triple {940#true} assume !(~i~0 < ~size); {940#true} is VALID [2020-07-10 15:25:58,488 INFO L280 TraceCheckUtils]: 4: Hoare triple {940#true} assume true; {940#true} is VALID [2020-07-10 15:25:58,488 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {940#true} {940#true} #76#return; {940#true} is VALID [2020-07-10 15:25:58,489 INFO L263 TraceCheckUtils]: 0: Hoare triple {940#true} call ULTIMATE.init(); {953#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:58,490 INFO L280 TraceCheckUtils]: 1: Hoare triple {953#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {940#true} is VALID [2020-07-10 15:25:58,490 INFO L280 TraceCheckUtils]: 2: Hoare triple {940#true} assume true; {940#true} is VALID [2020-07-10 15:25:58,490 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {940#true} {940#true} #80#return; {940#true} is VALID [2020-07-10 15:25:58,490 INFO L263 TraceCheckUtils]: 4: Hoare triple {940#true} call #t~ret6 := main(); {940#true} is VALID [2020-07-10 15:25:58,490 INFO L280 TraceCheckUtils]: 5: Hoare triple {940#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {940#true} is VALID [2020-07-10 15:25:58,491 INFO L263 TraceCheckUtils]: 6: Hoare triple {940#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {954#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:25:58,492 INFO L280 TraceCheckUtils]: 7: Hoare triple {954#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {940#true} is VALID [2020-07-10 15:25:58,492 INFO L280 TraceCheckUtils]: 8: Hoare triple {940#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {940#true} is VALID [2020-07-10 15:25:58,492 INFO L280 TraceCheckUtils]: 9: Hoare triple {940#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {940#true} is VALID [2020-07-10 15:25:58,492 INFO L280 TraceCheckUtils]: 10: Hoare triple {940#true} assume !(~i~0 < ~size); {940#true} is VALID [2020-07-10 15:25:58,493 INFO L280 TraceCheckUtils]: 11: Hoare triple {940#true} assume true; {940#true} is VALID [2020-07-10 15:25:58,493 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {940#true} {940#true} #76#return; {940#true} is VALID [2020-07-10 15:25:58,495 INFO L280 TraceCheckUtils]: 13: Hoare triple {940#true} ~i~1 := 0; {951#(= 0 main_~i~1)} is VALID [2020-07-10 15:25:58,495 INFO L280 TraceCheckUtils]: 14: Hoare triple {951#(= 0 main_~i~1)} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {951#(= 0 main_~i~1)} is VALID [2020-07-10 15:25:58,497 INFO L280 TraceCheckUtils]: 15: Hoare triple {951#(= 0 main_~i~1)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {951#(= 0 main_~i~1)} is VALID [2020-07-10 15:25:58,498 INFO L280 TraceCheckUtils]: 16: Hoare triple {951#(= 0 main_~i~1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {952#(<= main_~i~1 1)} is VALID [2020-07-10 15:25:58,499 INFO L280 TraceCheckUtils]: 17: Hoare triple {952#(<= main_~i~1 1)} assume !(~i~1 < 1000000); {941#false} is VALID [2020-07-10 15:25:58,499 INFO L280 TraceCheckUtils]: 18: Hoare triple {941#false} ~i~1 := 0; {941#false} is VALID [2020-07-10 15:25:58,500 INFO L280 TraceCheckUtils]: 19: Hoare triple {941#false} assume !!(~i~1 < 1000000); {941#false} is VALID [2020-07-10 15:25:58,500 INFO L280 TraceCheckUtils]: 20: Hoare triple {941#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {941#false} is VALID [2020-07-10 15:25:58,500 INFO L263 TraceCheckUtils]: 21: Hoare triple {941#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {941#false} is VALID [2020-07-10 15:25:58,500 INFO L280 TraceCheckUtils]: 22: Hoare triple {941#false} ~cond := #in~cond; {941#false} is VALID [2020-07-10 15:25:58,501 INFO L280 TraceCheckUtils]: 23: Hoare triple {941#false} assume 0 == ~cond; {941#false} is VALID [2020-07-10 15:25:58,501 INFO L280 TraceCheckUtils]: 24: Hoare triple {941#false} assume !false; {941#false} is VALID [2020-07-10 15:25:58,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:25:58,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784593805] [2020-07-10 15:25:58,502 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104568372] [2020-07-10 15:25:58,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:58,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,546 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:25:58,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,559 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:58,659 INFO L263 TraceCheckUtils]: 0: Hoare triple {940#true} call ULTIMATE.init(); {940#true} is VALID [2020-07-10 15:25:58,659 INFO L280 TraceCheckUtils]: 1: Hoare triple {940#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {940#true} is VALID [2020-07-10 15:25:58,659 INFO L280 TraceCheckUtils]: 2: Hoare triple {940#true} assume true; {940#true} is VALID [2020-07-10 15:25:58,660 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {940#true} {940#true} #80#return; {940#true} is VALID [2020-07-10 15:25:58,660 INFO L263 TraceCheckUtils]: 4: Hoare triple {940#true} call #t~ret6 := main(); {940#true} is VALID [2020-07-10 15:25:58,660 INFO L280 TraceCheckUtils]: 5: Hoare triple {940#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {940#true} is VALID [2020-07-10 15:25:58,662 INFO L263 TraceCheckUtils]: 6: Hoare triple {940#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {940#true} is VALID [2020-07-10 15:25:58,663 INFO L280 TraceCheckUtils]: 7: Hoare triple {940#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {979#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} is VALID [2020-07-10 15:25:58,664 INFO L280 TraceCheckUtils]: 8: Hoare triple {979#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {979#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} is VALID [2020-07-10 15:25:58,665 INFO L280 TraceCheckUtils]: 9: Hoare triple {979#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {986#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} is VALID [2020-07-10 15:25:58,666 INFO L280 TraceCheckUtils]: 10: Hoare triple {986#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} assume !(~i~0 < ~size); {990#(<= |init_#in~size| 1)} is VALID [2020-07-10 15:25:58,667 INFO L280 TraceCheckUtils]: 11: Hoare triple {990#(<= |init_#in~size| 1)} assume true; {990#(<= |init_#in~size| 1)} is VALID [2020-07-10 15:25:58,667 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {990#(<= |init_#in~size| 1)} {940#true} #76#return; {941#false} is VALID [2020-07-10 15:25:58,668 INFO L280 TraceCheckUtils]: 13: Hoare triple {941#false} ~i~1 := 0; {941#false} is VALID [2020-07-10 15:25:58,668 INFO L280 TraceCheckUtils]: 14: Hoare triple {941#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {941#false} is VALID [2020-07-10 15:25:58,668 INFO L280 TraceCheckUtils]: 15: Hoare triple {941#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {941#false} is VALID [2020-07-10 15:25:58,668 INFO L280 TraceCheckUtils]: 16: Hoare triple {941#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {941#false} is VALID [2020-07-10 15:25:58,669 INFO L280 TraceCheckUtils]: 17: Hoare triple {941#false} assume !(~i~1 < 1000000); {941#false} is VALID [2020-07-10 15:25:58,669 INFO L280 TraceCheckUtils]: 18: Hoare triple {941#false} ~i~1 := 0; {941#false} is VALID [2020-07-10 15:25:58,669 INFO L280 TraceCheckUtils]: 19: Hoare triple {941#false} assume !!(~i~1 < 1000000); {941#false} is VALID [2020-07-10 15:25:58,669 INFO L280 TraceCheckUtils]: 20: Hoare triple {941#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {941#false} is VALID [2020-07-10 15:25:58,670 INFO L263 TraceCheckUtils]: 21: Hoare triple {941#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {941#false} is VALID [2020-07-10 15:25:58,670 INFO L280 TraceCheckUtils]: 22: Hoare triple {941#false} ~cond := #in~cond; {941#false} is VALID [2020-07-10 15:25:58,670 INFO L280 TraceCheckUtils]: 23: Hoare triple {941#false} assume 0 == ~cond; {941#false} is VALID [2020-07-10 15:25:58,670 INFO L280 TraceCheckUtils]: 24: Hoare triple {941#false} assume !false; {941#false} is VALID [2020-07-10 15:25:58,671 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-10 15:25:58,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:25:58,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2020-07-10 15:25:58,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619281761] [2020-07-10 15:25:58,673 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-10 15:25:58,673 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:58,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:25:58,721 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:25:58,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:25:58,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:58,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:25:58,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:25:58,722 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 9 states. [2020-07-10 15:25:59,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:59,318 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2020-07-10 15:25:59,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:25:59,319 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-10 15:25:59,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:59,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:25:59,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2020-07-10 15:25:59,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:25:59,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2020-07-10 15:25:59,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 77 transitions. [2020-07-10 15:25:59,417 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:25:59,421 INFO L225 Difference]: With dead ends: 67 [2020-07-10 15:25:59,422 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 15:25:59,422 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-07-10 15:25:59,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 15:25:59,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2020-07-10 15:25:59,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:59,460 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 35 states. [2020-07-10 15:25:59,460 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 35 states. [2020-07-10 15:25:59,460 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 35 states. [2020-07-10 15:25:59,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:59,463 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2020-07-10 15:25:59,464 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2020-07-10 15:25:59,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:59,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:59,465 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 48 states. [2020-07-10 15:25:59,465 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 48 states. [2020-07-10 15:25:59,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:59,467 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2020-07-10 15:25:59,467 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2020-07-10 15:25:59,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:59,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:59,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:59,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:59,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 15:25:59,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2020-07-10 15:25:59,470 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 25 [2020-07-10 15:25:59,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:59,471 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2020-07-10 15:25:59,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:25:59,471 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-10 15:25:59,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:25:59,472 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:59,472 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] [2020-07-10 15:25:59,672 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:59,673 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:59,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:59,674 INFO L82 PathProgramCache]: Analyzing trace with hash -40898518, now seen corresponding path program 2 times [2020-07-10 15:25:59,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:59,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504509312] [2020-07-10 15:25:59,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:59,750 INFO L280 TraceCheckUtils]: 0: Hoare triple {1289#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1276#true} is VALID [2020-07-10 15:25:59,750 INFO L280 TraceCheckUtils]: 1: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-10 15:25:59,750 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1276#true} {1276#true} #80#return; {1276#true} is VALID [2020-07-10 15:25:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:59,920 INFO L280 TraceCheckUtils]: 0: Hoare triple {1290#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {1291#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:25:59,921 INFO L280 TraceCheckUtils]: 1: Hoare triple {1291#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1291#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:25:59,922 INFO L280 TraceCheckUtils]: 2: Hoare triple {1291#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1292#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:25:59,924 INFO L280 TraceCheckUtils]: 3: Hoare triple {1292#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1292#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:25:59,924 INFO L280 TraceCheckUtils]: 4: Hoare triple {1292#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1293#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:25:59,925 INFO L280 TraceCheckUtils]: 5: Hoare triple {1293#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !(~i~0 < ~size); {1294#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:25:59,926 INFO L280 TraceCheckUtils]: 6: Hoare triple {1294#(not (= |init_#in~size| 1000000))} assume true; {1294#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:25:59,927 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1294#(not (= |init_#in~size| 1000000))} {1276#true} #76#return; {1277#false} is VALID [2020-07-10 15:25:59,928 INFO L263 TraceCheckUtils]: 0: Hoare triple {1276#true} call ULTIMATE.init(); {1289#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:25:59,929 INFO L280 TraceCheckUtils]: 1: Hoare triple {1289#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1276#true} is VALID [2020-07-10 15:25:59,929 INFO L280 TraceCheckUtils]: 2: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-10 15:25:59,929 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1276#true} {1276#true} #80#return; {1276#true} is VALID [2020-07-10 15:25:59,929 INFO L263 TraceCheckUtils]: 4: Hoare triple {1276#true} call #t~ret6 := main(); {1276#true} is VALID [2020-07-10 15:25:59,929 INFO L280 TraceCheckUtils]: 5: Hoare triple {1276#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {1276#true} is VALID [2020-07-10 15:25:59,931 INFO L263 TraceCheckUtils]: 6: Hoare triple {1276#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {1290#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:25:59,932 INFO L280 TraceCheckUtils]: 7: Hoare triple {1290#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {1291#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:25:59,933 INFO L280 TraceCheckUtils]: 8: Hoare triple {1291#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1291#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:25:59,934 INFO L280 TraceCheckUtils]: 9: Hoare triple {1291#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1292#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:25:59,939 INFO L280 TraceCheckUtils]: 10: Hoare triple {1292#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1292#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:25:59,940 INFO L280 TraceCheckUtils]: 11: Hoare triple {1292#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1293#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:25:59,941 INFO L280 TraceCheckUtils]: 12: Hoare triple {1293#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !(~i~0 < ~size); {1294#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:25:59,941 INFO L280 TraceCheckUtils]: 13: Hoare triple {1294#(not (= |init_#in~size| 1000000))} assume true; {1294#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:25:59,942 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1294#(not (= |init_#in~size| 1000000))} {1276#true} #76#return; {1277#false} is VALID [2020-07-10 15:25:59,943 INFO L280 TraceCheckUtils]: 15: Hoare triple {1277#false} ~i~1 := 0; {1277#false} is VALID [2020-07-10 15:25:59,943 INFO L280 TraceCheckUtils]: 16: Hoare triple {1277#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1277#false} is VALID [2020-07-10 15:25:59,944 INFO L280 TraceCheckUtils]: 17: Hoare triple {1277#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1277#false} is VALID [2020-07-10 15:25:59,944 INFO L280 TraceCheckUtils]: 18: Hoare triple {1277#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1277#false} is VALID [2020-07-10 15:25:59,944 INFO L280 TraceCheckUtils]: 19: Hoare triple {1277#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1277#false} is VALID [2020-07-10 15:25:59,944 INFO L280 TraceCheckUtils]: 20: Hoare triple {1277#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1277#false} is VALID [2020-07-10 15:25:59,945 INFO L280 TraceCheckUtils]: 21: Hoare triple {1277#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1277#false} is VALID [2020-07-10 15:25:59,945 INFO L280 TraceCheckUtils]: 22: Hoare triple {1277#false} assume !(~i~1 < 1000000); {1277#false} is VALID [2020-07-10 15:25:59,945 INFO L280 TraceCheckUtils]: 23: Hoare triple {1277#false} ~i~1 := 0; {1277#false} is VALID [2020-07-10 15:25:59,946 INFO L280 TraceCheckUtils]: 24: Hoare triple {1277#false} assume !!(~i~1 < 1000000); {1277#false} is VALID [2020-07-10 15:25:59,946 INFO L280 TraceCheckUtils]: 25: Hoare triple {1277#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1277#false} is VALID [2020-07-10 15:25:59,946 INFO L263 TraceCheckUtils]: 26: Hoare triple {1277#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {1277#false} is VALID [2020-07-10 15:25:59,946 INFO L280 TraceCheckUtils]: 27: Hoare triple {1277#false} ~cond := #in~cond; {1277#false} is VALID [2020-07-10 15:25:59,946 INFO L280 TraceCheckUtils]: 28: Hoare triple {1277#false} assume 0 == ~cond; {1277#false} is VALID [2020-07-10 15:25:59,947 INFO L280 TraceCheckUtils]: 29: Hoare triple {1277#false} assume !false; {1277#false} is VALID [2020-07-10 15:25:59,948 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-10 15:25:59,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504509312] [2020-07-10 15:25:59,949 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230715190] [2020-07-10 15:25:59,949 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:25:59,994 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:25:59,995 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:25:59,996 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:26:00,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:00,016 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:00,104 INFO L263 TraceCheckUtils]: 0: Hoare triple {1276#true} call ULTIMATE.init(); {1276#true} is VALID [2020-07-10 15:26:00,105 INFO L280 TraceCheckUtils]: 1: Hoare triple {1276#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1276#true} is VALID [2020-07-10 15:26:00,105 INFO L280 TraceCheckUtils]: 2: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-10 15:26:00,105 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1276#true} {1276#true} #80#return; {1276#true} is VALID [2020-07-10 15:26:00,106 INFO L263 TraceCheckUtils]: 4: Hoare triple {1276#true} call #t~ret6 := main(); {1276#true} is VALID [2020-07-10 15:26:00,106 INFO L280 TraceCheckUtils]: 5: Hoare triple {1276#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {1276#true} is VALID [2020-07-10 15:26:00,106 INFO L263 TraceCheckUtils]: 6: Hoare triple {1276#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {1276#true} is VALID [2020-07-10 15:26:00,106 INFO L280 TraceCheckUtils]: 7: Hoare triple {1276#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {1276#true} is VALID [2020-07-10 15:26:00,106 INFO L280 TraceCheckUtils]: 8: Hoare triple {1276#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1276#true} is VALID [2020-07-10 15:26:00,107 INFO L280 TraceCheckUtils]: 9: Hoare triple {1276#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1276#true} is VALID [2020-07-10 15:26:00,107 INFO L280 TraceCheckUtils]: 10: Hoare triple {1276#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1276#true} is VALID [2020-07-10 15:26:00,117 INFO L280 TraceCheckUtils]: 11: Hoare triple {1276#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1276#true} is VALID [2020-07-10 15:26:00,117 INFO L280 TraceCheckUtils]: 12: Hoare triple {1276#true} assume !(~i~0 < ~size); {1276#true} is VALID [2020-07-10 15:26:00,117 INFO L280 TraceCheckUtils]: 13: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-10 15:26:00,118 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1276#true} {1276#true} #76#return; {1276#true} is VALID [2020-07-10 15:26:00,120 INFO L280 TraceCheckUtils]: 15: Hoare triple {1276#true} ~i~1 := 0; {1343#(<= main_~i~1 0)} is VALID [2020-07-10 15:26:00,121 INFO L280 TraceCheckUtils]: 16: Hoare triple {1343#(<= main_~i~1 0)} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1343#(<= main_~i~1 0)} is VALID [2020-07-10 15:26:00,122 INFO L280 TraceCheckUtils]: 17: Hoare triple {1343#(<= main_~i~1 0)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1343#(<= main_~i~1 0)} is VALID [2020-07-10 15:26:00,123 INFO L280 TraceCheckUtils]: 18: Hoare triple {1343#(<= main_~i~1 0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1353#(<= main_~i~1 1)} is VALID [2020-07-10 15:26:00,123 INFO L280 TraceCheckUtils]: 19: Hoare triple {1353#(<= main_~i~1 1)} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1353#(<= main_~i~1 1)} is VALID [2020-07-10 15:26:00,124 INFO L280 TraceCheckUtils]: 20: Hoare triple {1353#(<= main_~i~1 1)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1353#(<= main_~i~1 1)} is VALID [2020-07-10 15:26:00,124 INFO L280 TraceCheckUtils]: 21: Hoare triple {1353#(<= main_~i~1 1)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1363#(<= main_~i~1 2)} is VALID [2020-07-10 15:26:00,125 INFO L280 TraceCheckUtils]: 22: Hoare triple {1363#(<= main_~i~1 2)} assume !(~i~1 < 1000000); {1277#false} is VALID [2020-07-10 15:26:00,126 INFO L280 TraceCheckUtils]: 23: Hoare triple {1277#false} ~i~1 := 0; {1277#false} is VALID [2020-07-10 15:26:00,126 INFO L280 TraceCheckUtils]: 24: Hoare triple {1277#false} assume !!(~i~1 < 1000000); {1277#false} is VALID [2020-07-10 15:26:00,126 INFO L280 TraceCheckUtils]: 25: Hoare triple {1277#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1277#false} is VALID [2020-07-10 15:26:00,126 INFO L263 TraceCheckUtils]: 26: Hoare triple {1277#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {1277#false} is VALID [2020-07-10 15:26:00,126 INFO L280 TraceCheckUtils]: 27: Hoare triple {1277#false} ~cond := #in~cond; {1277#false} is VALID [2020-07-10 15:26:00,126 INFO L280 TraceCheckUtils]: 28: Hoare triple {1277#false} assume 0 == ~cond; {1277#false} is VALID [2020-07-10 15:26:00,127 INFO L280 TraceCheckUtils]: 29: Hoare triple {1277#false} assume !false; {1277#false} is VALID [2020-07-10 15:26:00,128 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-07-10 15:26:00,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:00,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2020-07-10 15:26:00,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735173547] [2020-07-10 15:26:00,129 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-07-10 15:26:00,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:00,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:26:00,195 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:00,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:26:00,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:00,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:26:00,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:26:00,196 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 11 states. [2020-07-10 15:26:00,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:00,829 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2020-07-10 15:26:00,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:26:00,830 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-07-10 15:26:00,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:26:00,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2020-07-10 15:26:00,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:26:00,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2020-07-10 15:26:00,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 89 transitions. [2020-07-10 15:26:00,942 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:00,944 INFO L225 Difference]: With dead ends: 80 [2020-07-10 15:26:00,944 INFO L226 Difference]: Without dead ends: 58 [2020-07-10 15:26:00,945 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2020-07-10 15:26:00,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-10 15:26:00,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2020-07-10 15:26:00,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:00,970 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 40 states. [2020-07-10 15:26:00,970 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 40 states. [2020-07-10 15:26:00,970 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 40 states. [2020-07-10 15:26:00,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:00,973 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-07-10 15:26:00,973 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2020-07-10 15:26:00,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:00,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:00,974 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 58 states. [2020-07-10 15:26:00,974 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 58 states. [2020-07-10 15:26:00,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:00,977 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-07-10 15:26:00,977 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2020-07-10 15:26:00,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:00,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:00,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:00,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:00,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 15:26:00,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-07-10 15:26:00,980 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 30 [2020-07-10 15:26:00,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:00,980 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-07-10 15:26:00,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:26:00,980 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-10 15:26:00,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 15:26:00,981 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:00,981 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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:01,194 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:01,196 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:01,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:01,197 INFO L82 PathProgramCache]: Analyzing trace with hash -577379495, now seen corresponding path program 3 times [2020-07-10 15:26:01,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:01,198 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921482128] [2020-07-10 15:26:01,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:01,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,282 INFO L280 TraceCheckUtils]: 0: Hoare triple {1691#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1676#true} is VALID [2020-07-10 15:26:01,282 INFO L280 TraceCheckUtils]: 1: Hoare triple {1676#true} assume true; {1676#true} is VALID [2020-07-10 15:26:01,283 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1676#true} {1676#true} #80#return; {1676#true} is VALID [2020-07-10 15:26:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,513 INFO L280 TraceCheckUtils]: 0: Hoare triple {1692#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {1693#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:01,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {1693#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1693#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:01,515 INFO L280 TraceCheckUtils]: 2: Hoare triple {1693#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1694#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:01,516 INFO L280 TraceCheckUtils]: 3: Hoare triple {1694#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1694#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:01,518 INFO L280 TraceCheckUtils]: 4: Hoare triple {1694#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1695#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:01,519 INFO L280 TraceCheckUtils]: 5: Hoare triple {1695#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1695#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:01,520 INFO L280 TraceCheckUtils]: 6: Hoare triple {1695#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1696#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:01,521 INFO L280 TraceCheckUtils]: 7: Hoare triple {1696#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {1697#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:01,521 INFO L280 TraceCheckUtils]: 8: Hoare triple {1697#(not (= |init_#in~size| 1000000))} assume true; {1697#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:01,524 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1697#(not (= |init_#in~size| 1000000))} {1676#true} #76#return; {1677#false} is VALID [2020-07-10 15:26:01,526 INFO L263 TraceCheckUtils]: 0: Hoare triple {1676#true} call ULTIMATE.init(); {1691#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:01,526 INFO L280 TraceCheckUtils]: 1: Hoare triple {1691#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1676#true} is VALID [2020-07-10 15:26:01,526 INFO L280 TraceCheckUtils]: 2: Hoare triple {1676#true} assume true; {1676#true} is VALID [2020-07-10 15:26:01,526 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1676#true} {1676#true} #80#return; {1676#true} is VALID [2020-07-10 15:26:01,526 INFO L263 TraceCheckUtils]: 4: Hoare triple {1676#true} call #t~ret6 := main(); {1676#true} is VALID [2020-07-10 15:26:01,527 INFO L280 TraceCheckUtils]: 5: Hoare triple {1676#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {1676#true} is VALID [2020-07-10 15:26:01,528 INFO L263 TraceCheckUtils]: 6: Hoare triple {1676#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {1692#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:26:01,528 INFO L280 TraceCheckUtils]: 7: Hoare triple {1692#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {1693#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:01,529 INFO L280 TraceCheckUtils]: 8: Hoare triple {1693#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1693#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:01,530 INFO L280 TraceCheckUtils]: 9: Hoare triple {1693#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1694#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:01,531 INFO L280 TraceCheckUtils]: 10: Hoare triple {1694#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1694#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:01,532 INFO L280 TraceCheckUtils]: 11: Hoare triple {1694#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1695#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:01,533 INFO L280 TraceCheckUtils]: 12: Hoare triple {1695#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1695#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:01,534 INFO L280 TraceCheckUtils]: 13: Hoare triple {1695#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1696#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:01,534 INFO L280 TraceCheckUtils]: 14: Hoare triple {1696#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {1697#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:01,535 INFO L280 TraceCheckUtils]: 15: Hoare triple {1697#(not (= |init_#in~size| 1000000))} assume true; {1697#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:01,536 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1697#(not (= |init_#in~size| 1000000))} {1676#true} #76#return; {1677#false} is VALID [2020-07-10 15:26:01,536 INFO L280 TraceCheckUtils]: 17: Hoare triple {1677#false} ~i~1 := 0; {1677#false} is VALID [2020-07-10 15:26:01,536 INFO L280 TraceCheckUtils]: 18: Hoare triple {1677#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1677#false} is VALID [2020-07-10 15:26:01,536 INFO L280 TraceCheckUtils]: 19: Hoare triple {1677#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1677#false} is VALID [2020-07-10 15:26:01,536 INFO L280 TraceCheckUtils]: 20: Hoare triple {1677#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1677#false} is VALID [2020-07-10 15:26:01,537 INFO L280 TraceCheckUtils]: 21: Hoare triple {1677#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1677#false} is VALID [2020-07-10 15:26:01,537 INFO L280 TraceCheckUtils]: 22: Hoare triple {1677#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1677#false} is VALID [2020-07-10 15:26:01,537 INFO L280 TraceCheckUtils]: 23: Hoare triple {1677#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1677#false} is VALID [2020-07-10 15:26:01,537 INFO L280 TraceCheckUtils]: 24: Hoare triple {1677#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1677#false} is VALID [2020-07-10 15:26:01,538 INFO L280 TraceCheckUtils]: 25: Hoare triple {1677#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1677#false} is VALID [2020-07-10 15:26:01,538 INFO L280 TraceCheckUtils]: 26: Hoare triple {1677#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1677#false} is VALID [2020-07-10 15:26:01,538 INFO L280 TraceCheckUtils]: 27: Hoare triple {1677#false} assume !(~i~1 < 1000000); {1677#false} is VALID [2020-07-10 15:26:01,538 INFO L280 TraceCheckUtils]: 28: Hoare triple {1677#false} ~i~1 := 0; {1677#false} is VALID [2020-07-10 15:26:01,538 INFO L280 TraceCheckUtils]: 29: Hoare triple {1677#false} assume !!(~i~1 < 1000000); {1677#false} is VALID [2020-07-10 15:26:01,539 INFO L280 TraceCheckUtils]: 30: Hoare triple {1677#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1677#false} is VALID [2020-07-10 15:26:01,539 INFO L263 TraceCheckUtils]: 31: Hoare triple {1677#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {1677#false} is VALID [2020-07-10 15:26:01,539 INFO L280 TraceCheckUtils]: 32: Hoare triple {1677#false} ~cond := #in~cond; {1677#false} is VALID [2020-07-10 15:26:01,539 INFO L280 TraceCheckUtils]: 33: Hoare triple {1677#false} assume 0 == ~cond; {1677#false} is VALID [2020-07-10 15:26:01,539 INFO L280 TraceCheckUtils]: 34: Hoare triple {1677#false} assume !false; {1677#false} is VALID [2020-07-10 15:26:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-07-10 15:26:01,542 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921482128] [2020-07-10 15:26:01,542 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806646802] [2020-07-10 15:26:01,542 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:01,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-10 15:26:01,585 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:01,587 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-10 15:26:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,601 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:01,810 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-10 15:26:01,811 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:01,818 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:01,821 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2020-07-10 15:26:01,823 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:01,826 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:01,827 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:01,827 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2020-07-10 15:26:01,830 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:01,830 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#a~0.base|, |#memory_$Pointer$.offset|]. (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) 0)) (.cse1 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) 0))) (and (= .cse0 |main_#t~mem5.base|) (= 0 .cse1) (= 0 .cse0) (= |main_#t~mem5.offset| .cse1))) [2020-07-10 15:26:01,830 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|)) [2020-07-10 15:26:01,907 INFO L263 TraceCheckUtils]: 0: Hoare triple {1676#true} call ULTIMATE.init(); {1676#true} is VALID [2020-07-10 15:26:01,908 INFO L280 TraceCheckUtils]: 1: Hoare triple {1676#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1676#true} is VALID [2020-07-10 15:26:01,908 INFO L280 TraceCheckUtils]: 2: Hoare triple {1676#true} assume true; {1676#true} is VALID [2020-07-10 15:26:01,908 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1676#true} {1676#true} #80#return; {1676#true} is VALID [2020-07-10 15:26:01,908 INFO L263 TraceCheckUtils]: 4: Hoare triple {1676#true} call #t~ret6 := main(); {1676#true} is VALID [2020-07-10 15:26:01,909 INFO L280 TraceCheckUtils]: 5: Hoare triple {1676#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {1716#(= 0 |main_~#a~0.offset|)} is VALID [2020-07-10 15:26:01,909 INFO L263 TraceCheckUtils]: 6: Hoare triple {1716#(= 0 |main_~#a~0.offset|)} call init(~#a~0.base, ~#a~0.offset, 1000000); {1676#true} is VALID [2020-07-10 15:26:01,910 INFO L280 TraceCheckUtils]: 7: Hoare triple {1676#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {1676#true} is VALID [2020-07-10 15:26:01,910 INFO L280 TraceCheckUtils]: 8: Hoare triple {1676#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1676#true} is VALID [2020-07-10 15:26:01,910 INFO L280 TraceCheckUtils]: 9: Hoare triple {1676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1676#true} is VALID [2020-07-10 15:26:01,910 INFO L280 TraceCheckUtils]: 10: Hoare triple {1676#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1676#true} is VALID [2020-07-10 15:26:01,910 INFO L280 TraceCheckUtils]: 11: Hoare triple {1676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1676#true} is VALID [2020-07-10 15:26:01,910 INFO L280 TraceCheckUtils]: 12: Hoare triple {1676#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {1676#true} is VALID [2020-07-10 15:26:01,911 INFO L280 TraceCheckUtils]: 13: Hoare triple {1676#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1676#true} is VALID [2020-07-10 15:26:01,911 INFO L280 TraceCheckUtils]: 14: Hoare triple {1676#true} assume !(~i~0 < ~size); {1676#true} is VALID [2020-07-10 15:26:01,911 INFO L280 TraceCheckUtils]: 15: Hoare triple {1676#true} assume true; {1676#true} is VALID [2020-07-10 15:26:01,912 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1676#true} {1716#(= 0 |main_~#a~0.offset|)} #76#return; {1716#(= 0 |main_~#a~0.offset|)} is VALID [2020-07-10 15:26:01,912 INFO L280 TraceCheckUtils]: 17: Hoare triple {1716#(= 0 |main_~#a~0.offset|)} ~i~1 := 0; {1753#(and (= 0 main_~i~1) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-10 15:26:01,913 INFO L280 TraceCheckUtils]: 18: Hoare triple {1753#(and (= 0 main_~i~1) (= 0 |main_~#a~0.offset|))} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1757#(and (= |main_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|) |main_#t~mem3.base|) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-10 15:26:01,917 INFO L280 TraceCheckUtils]: 19: Hoare triple {1757#(and (= |main_#t~mem3.offset| (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|) |main_#t~mem3.base|) (= 0 |main_~#a~0.offset|))} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-10 15:26:01,918 INFO L280 TraceCheckUtils]: 20: Hoare triple {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-10 15:26:01,924 INFO L280 TraceCheckUtils]: 21: Hoare triple {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-10 15:26:01,925 INFO L280 TraceCheckUtils]: 22: Hoare triple {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-10 15:26:01,926 INFO L280 TraceCheckUtils]: 23: Hoare triple {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-10 15:26:01,927 INFO L280 TraceCheckUtils]: 24: Hoare triple {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-10 15:26:01,927 INFO L280 TraceCheckUtils]: 25: Hoare triple {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-10 15:26:01,928 INFO L280 TraceCheckUtils]: 26: Hoare triple {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-10 15:26:01,931 INFO L280 TraceCheckUtils]: 27: Hoare triple {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} assume !(~i~1 < 1000000); {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-10 15:26:01,934 INFO L280 TraceCheckUtils]: 28: Hoare triple {1761#(and (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} ~i~1 := 0; {1789#(and (= 0 main_~i~1) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-10 15:26:01,934 INFO L280 TraceCheckUtils]: 29: Hoare triple {1789#(and (= 0 main_~i~1) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} assume !!(~i~1 < 1000000); {1789#(and (= 0 main_~i~1) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} is VALID [2020-07-10 15:26:01,936 INFO L280 TraceCheckUtils]: 30: Hoare triple {1789#(and (= 0 main_~i~1) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 |main_~#a~0.offset|))} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {1796#(and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|))} is VALID [2020-07-10 15:26:01,937 INFO L263 TraceCheckUtils]: 31: Hoare triple {1796#(and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|))} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {1800#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-10 15:26:01,938 INFO L280 TraceCheckUtils]: 32: Hoare triple {1800#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1804#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-10 15:26:01,938 INFO L280 TraceCheckUtils]: 33: Hoare triple {1804#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1677#false} is VALID [2020-07-10 15:26:01,938 INFO L280 TraceCheckUtils]: 34: Hoare triple {1677#false} assume !false; {1677#false} is VALID [2020-07-10 15:26:01,942 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-07-10 15:26:01,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:01,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2020-07-10 15:26:01,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089059640] [2020-07-10 15:26:01,943 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2020-07-10 15:26:01,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:01,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-10 15:26:02,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:02,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-10 15:26:02,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:02,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-10 15:26:02,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2020-07-10 15:26:02,009 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 17 states. [2020-07-10 15:26:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:02,977 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2020-07-10 15:26:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-10 15:26:02,977 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2020-07-10 15:26:02,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:02,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 15:26:02,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 74 transitions. [2020-07-10 15:26:02,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 15:26:02,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 74 transitions. [2020-07-10 15:26:02,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 74 transitions. [2020-07-10 15:26:03,088 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:03,090 INFO L225 Difference]: With dead ends: 77 [2020-07-10 15:26:03,090 INFO L226 Difference]: Without dead ends: 52 [2020-07-10 15:26:03,091 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=89, Invalid=463, Unknown=0, NotChecked=0, Total=552 [2020-07-10 15:26:03,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-10 15:26:03,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2020-07-10 15:26:03,144 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:03,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 49 states. [2020-07-10 15:26:03,144 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 49 states. [2020-07-10 15:26:03,144 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 49 states. [2020-07-10 15:26:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:03,146 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-07-10 15:26:03,146 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-07-10 15:26:03,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:03,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:03,147 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 52 states. [2020-07-10 15:26:03,147 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 52 states. [2020-07-10 15:26:03,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:03,149 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-07-10 15:26:03,149 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-07-10 15:26:03,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:03,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:03,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:03,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-10 15:26:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2020-07-10 15:26:03,151 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 35 [2020-07-10 15:26:03,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:03,152 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2020-07-10 15:26:03,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-10 15:26:03,152 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2020-07-10 15:26:03,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-10 15:26:03,153 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:03,153 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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:26:03,363 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-10 15:26:03,364 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:03,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:03,364 INFO L82 PathProgramCache]: Analyzing trace with hash -749708025, now seen corresponding path program 1 times [2020-07-10 15:26:03,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:03,365 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031616267] [2020-07-10 15:26:03,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:03,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,441 INFO L280 TraceCheckUtils]: 0: Hoare triple {2121#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2104#true} is VALID [2020-07-10 15:26:03,442 INFO L280 TraceCheckUtils]: 1: Hoare triple {2104#true} assume true; {2104#true} is VALID [2020-07-10 15:26:03,442 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2104#true} {2104#true} #80#return; {2104#true} is VALID [2020-07-10 15:26:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,738 INFO L280 TraceCheckUtils]: 0: Hoare triple {2122#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {2123#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:03,740 INFO L280 TraceCheckUtils]: 1: Hoare triple {2123#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2123#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:03,747 INFO L280 TraceCheckUtils]: 2: Hoare triple {2123#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2124#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:03,751 INFO L280 TraceCheckUtils]: 3: Hoare triple {2124#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2124#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:03,752 INFO L280 TraceCheckUtils]: 4: Hoare triple {2124#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2125#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:03,754 INFO L280 TraceCheckUtils]: 5: Hoare triple {2125#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2125#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:03,757 INFO L280 TraceCheckUtils]: 6: Hoare triple {2125#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2126#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:03,758 INFO L280 TraceCheckUtils]: 7: Hoare triple {2126#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2126#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:03,759 INFO L280 TraceCheckUtils]: 8: Hoare triple {2126#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2127#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:03,760 INFO L280 TraceCheckUtils]: 9: Hoare triple {2127#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {2128#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:03,762 INFO L280 TraceCheckUtils]: 10: Hoare triple {2128#(not (= |init_#in~size| 1000000))} assume true; {2128#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:03,764 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2128#(not (= |init_#in~size| 1000000))} {2104#true} #76#return; {2105#false} is VALID [2020-07-10 15:26:03,766 INFO L263 TraceCheckUtils]: 0: Hoare triple {2104#true} call ULTIMATE.init(); {2121#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:03,767 INFO L280 TraceCheckUtils]: 1: Hoare triple {2121#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2104#true} is VALID [2020-07-10 15:26:03,767 INFO L280 TraceCheckUtils]: 2: Hoare triple {2104#true} assume true; {2104#true} is VALID [2020-07-10 15:26:03,767 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2104#true} {2104#true} #80#return; {2104#true} is VALID [2020-07-10 15:26:03,767 INFO L263 TraceCheckUtils]: 4: Hoare triple {2104#true} call #t~ret6 := main(); {2104#true} is VALID [2020-07-10 15:26:03,767 INFO L280 TraceCheckUtils]: 5: Hoare triple {2104#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {2104#true} is VALID [2020-07-10 15:26:03,769 INFO L263 TraceCheckUtils]: 6: Hoare triple {2104#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {2122#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:26:03,770 INFO L280 TraceCheckUtils]: 7: Hoare triple {2122#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {2123#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:03,771 INFO L280 TraceCheckUtils]: 8: Hoare triple {2123#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2123#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:03,772 INFO L280 TraceCheckUtils]: 9: Hoare triple {2123#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2124#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:03,773 INFO L280 TraceCheckUtils]: 10: Hoare triple {2124#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2124#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:03,774 INFO L280 TraceCheckUtils]: 11: Hoare triple {2124#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2125#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:03,779 INFO L280 TraceCheckUtils]: 12: Hoare triple {2125#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2125#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:03,781 INFO L280 TraceCheckUtils]: 13: Hoare triple {2125#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2126#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:03,782 INFO L280 TraceCheckUtils]: 14: Hoare triple {2126#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2126#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:03,783 INFO L280 TraceCheckUtils]: 15: Hoare triple {2126#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2127#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:03,783 INFO L280 TraceCheckUtils]: 16: Hoare triple {2127#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {2128#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:03,784 INFO L280 TraceCheckUtils]: 17: Hoare triple {2128#(not (= |init_#in~size| 1000000))} assume true; {2128#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:03,785 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2128#(not (= |init_#in~size| 1000000))} {2104#true} #76#return; {2105#false} is VALID [2020-07-10 15:26:03,785 INFO L280 TraceCheckUtils]: 19: Hoare triple {2105#false} ~i~1 := 0; {2105#false} is VALID [2020-07-10 15:26:03,785 INFO L280 TraceCheckUtils]: 20: Hoare triple {2105#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2105#false} is VALID [2020-07-10 15:26:03,786 INFO L280 TraceCheckUtils]: 21: Hoare triple {2105#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2105#false} is VALID [2020-07-10 15:26:03,786 INFO L280 TraceCheckUtils]: 22: Hoare triple {2105#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2105#false} is VALID [2020-07-10 15:26:03,786 INFO L280 TraceCheckUtils]: 23: Hoare triple {2105#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2105#false} is VALID [2020-07-10 15:26:03,786 INFO L280 TraceCheckUtils]: 24: Hoare triple {2105#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2105#false} is VALID [2020-07-10 15:26:03,786 INFO L280 TraceCheckUtils]: 25: Hoare triple {2105#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2105#false} is VALID [2020-07-10 15:26:03,787 INFO L280 TraceCheckUtils]: 26: Hoare triple {2105#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2105#false} is VALID [2020-07-10 15:26:03,787 INFO L280 TraceCheckUtils]: 27: Hoare triple {2105#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2105#false} is VALID [2020-07-10 15:26:03,787 INFO L280 TraceCheckUtils]: 28: Hoare triple {2105#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2105#false} is VALID [2020-07-10 15:26:03,787 INFO L280 TraceCheckUtils]: 29: Hoare triple {2105#false} assume !(~i~1 < 1000000); {2105#false} is VALID [2020-07-10 15:26:03,787 INFO L280 TraceCheckUtils]: 30: Hoare triple {2105#false} ~i~1 := 0; {2105#false} is VALID [2020-07-10 15:26:03,788 INFO L280 TraceCheckUtils]: 31: Hoare triple {2105#false} assume !!(~i~1 < 1000000); {2105#false} is VALID [2020-07-10 15:26:03,788 INFO L280 TraceCheckUtils]: 32: Hoare triple {2105#false} assume !(0 == ~flag~0); {2105#false} is VALID [2020-07-10 15:26:03,788 INFO L280 TraceCheckUtils]: 33: Hoare triple {2105#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2105#false} is VALID [2020-07-10 15:26:03,788 INFO L280 TraceCheckUtils]: 34: Hoare triple {2105#false} assume !!(~i~1 < 1000000); {2105#false} is VALID [2020-07-10 15:26:03,788 INFO L280 TraceCheckUtils]: 35: Hoare triple {2105#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2105#false} is VALID [2020-07-10 15:26:03,789 INFO L263 TraceCheckUtils]: 36: Hoare triple {2105#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2105#false} is VALID [2020-07-10 15:26:03,789 INFO L280 TraceCheckUtils]: 37: Hoare triple {2105#false} ~cond := #in~cond; {2105#false} is VALID [2020-07-10 15:26:03,789 INFO L280 TraceCheckUtils]: 38: Hoare triple {2105#false} assume 0 == ~cond; {2105#false} is VALID [2020-07-10 15:26:03,789 INFO L280 TraceCheckUtils]: 39: Hoare triple {2105#false} assume !false; {2105#false} is VALID [2020-07-10 15:26:03,792 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-07-10 15:26:03,792 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031616267] [2020-07-10 15:26:03,794 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469358458] [2020-07-10 15:26:03,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,850 INFO L264 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:26:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,875 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:03,917 INFO L263 TraceCheckUtils]: 0: Hoare triple {2104#true} call ULTIMATE.init(); {2104#true} is VALID [2020-07-10 15:26:03,917 INFO L280 TraceCheckUtils]: 1: Hoare triple {2104#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2104#true} is VALID [2020-07-10 15:26:03,917 INFO L280 TraceCheckUtils]: 2: Hoare triple {2104#true} assume true; {2104#true} is VALID [2020-07-10 15:26:03,917 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2104#true} {2104#true} #80#return; {2104#true} is VALID [2020-07-10 15:26:03,918 INFO L263 TraceCheckUtils]: 4: Hoare triple {2104#true} call #t~ret6 := main(); {2104#true} is VALID [2020-07-10 15:26:03,919 INFO L280 TraceCheckUtils]: 5: Hoare triple {2104#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {2147#(= 0 main_~flag~0)} is VALID [2020-07-10 15:26:03,919 INFO L263 TraceCheckUtils]: 6: Hoare triple {2147#(= 0 main_~flag~0)} call init(~#a~0.base, ~#a~0.offset, 1000000); {2104#true} is VALID [2020-07-10 15:26:03,919 INFO L280 TraceCheckUtils]: 7: Hoare triple {2104#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {2104#true} is VALID [2020-07-10 15:26:03,919 INFO L280 TraceCheckUtils]: 8: Hoare triple {2104#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2104#true} is VALID [2020-07-10 15:26:03,919 INFO L280 TraceCheckUtils]: 9: Hoare triple {2104#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2104#true} is VALID [2020-07-10 15:26:03,920 INFO L280 TraceCheckUtils]: 10: Hoare triple {2104#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2104#true} is VALID [2020-07-10 15:26:03,920 INFO L280 TraceCheckUtils]: 11: Hoare triple {2104#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2104#true} is VALID [2020-07-10 15:26:03,920 INFO L280 TraceCheckUtils]: 12: Hoare triple {2104#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2104#true} is VALID [2020-07-10 15:26:03,920 INFO L280 TraceCheckUtils]: 13: Hoare triple {2104#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2104#true} is VALID [2020-07-10 15:26:03,920 INFO L280 TraceCheckUtils]: 14: Hoare triple {2104#true} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2104#true} is VALID [2020-07-10 15:26:03,921 INFO L280 TraceCheckUtils]: 15: Hoare triple {2104#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2104#true} is VALID [2020-07-10 15:26:03,921 INFO L280 TraceCheckUtils]: 16: Hoare triple {2104#true} assume !(~i~0 < ~size); {2104#true} is VALID [2020-07-10 15:26:03,921 INFO L280 TraceCheckUtils]: 17: Hoare triple {2104#true} assume true; {2104#true} is VALID [2020-07-10 15:26:03,922 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2104#true} {2147#(= 0 main_~flag~0)} #76#return; {2147#(= 0 main_~flag~0)} is VALID [2020-07-10 15:26:03,922 INFO L280 TraceCheckUtils]: 19: Hoare triple {2147#(= 0 main_~flag~0)} ~i~1 := 0; {2147#(= 0 main_~flag~0)} is VALID [2020-07-10 15:26:03,923 INFO L280 TraceCheckUtils]: 20: Hoare triple {2147#(= 0 main_~flag~0)} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2147#(= 0 main_~flag~0)} is VALID [2020-07-10 15:26:03,924 INFO L280 TraceCheckUtils]: 21: Hoare triple {2147#(= 0 main_~flag~0)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2147#(= 0 main_~flag~0)} is VALID [2020-07-10 15:26:03,924 INFO L280 TraceCheckUtils]: 22: Hoare triple {2147#(= 0 main_~flag~0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2147#(= 0 main_~flag~0)} is VALID [2020-07-10 15:26:03,925 INFO L280 TraceCheckUtils]: 23: Hoare triple {2147#(= 0 main_~flag~0)} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2147#(= 0 main_~flag~0)} is VALID [2020-07-10 15:26:03,925 INFO L280 TraceCheckUtils]: 24: Hoare triple {2147#(= 0 main_~flag~0)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2147#(= 0 main_~flag~0)} is VALID [2020-07-10 15:26:03,926 INFO L280 TraceCheckUtils]: 25: Hoare triple {2147#(= 0 main_~flag~0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2147#(= 0 main_~flag~0)} is VALID [2020-07-10 15:26:03,926 INFO L280 TraceCheckUtils]: 26: Hoare triple {2147#(= 0 main_~flag~0)} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2147#(= 0 main_~flag~0)} is VALID [2020-07-10 15:26:03,927 INFO L280 TraceCheckUtils]: 27: Hoare triple {2147#(= 0 main_~flag~0)} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2147#(= 0 main_~flag~0)} is VALID [2020-07-10 15:26:03,927 INFO L280 TraceCheckUtils]: 28: Hoare triple {2147#(= 0 main_~flag~0)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2147#(= 0 main_~flag~0)} is VALID [2020-07-10 15:26:03,928 INFO L280 TraceCheckUtils]: 29: Hoare triple {2147#(= 0 main_~flag~0)} assume !(~i~1 < 1000000); {2147#(= 0 main_~flag~0)} is VALID [2020-07-10 15:26:03,928 INFO L280 TraceCheckUtils]: 30: Hoare triple {2147#(= 0 main_~flag~0)} ~i~1 := 0; {2147#(= 0 main_~flag~0)} is VALID [2020-07-10 15:26:03,929 INFO L280 TraceCheckUtils]: 31: Hoare triple {2147#(= 0 main_~flag~0)} assume !!(~i~1 < 1000000); {2147#(= 0 main_~flag~0)} is VALID [2020-07-10 15:26:03,929 INFO L280 TraceCheckUtils]: 32: Hoare triple {2147#(= 0 main_~flag~0)} assume !(0 == ~flag~0); {2105#false} is VALID [2020-07-10 15:26:03,930 INFO L280 TraceCheckUtils]: 33: Hoare triple {2105#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2105#false} is VALID [2020-07-10 15:26:03,930 INFO L280 TraceCheckUtils]: 34: Hoare triple {2105#false} assume !!(~i~1 < 1000000); {2105#false} is VALID [2020-07-10 15:26:03,930 INFO L280 TraceCheckUtils]: 35: Hoare triple {2105#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2105#false} is VALID [2020-07-10 15:26:03,930 INFO L263 TraceCheckUtils]: 36: Hoare triple {2105#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2105#false} is VALID [2020-07-10 15:26:03,930 INFO L280 TraceCheckUtils]: 37: Hoare triple {2105#false} ~cond := #in~cond; {2105#false} is VALID [2020-07-10 15:26:03,931 INFO L280 TraceCheckUtils]: 38: Hoare triple {2105#false} assume 0 == ~cond; {2105#false} is VALID [2020-07-10 15:26:03,931 INFO L280 TraceCheckUtils]: 39: Hoare triple {2105#false} assume !false; {2105#false} is VALID [2020-07-10 15:26:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-07-10 15:26:03,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:03,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2020-07-10 15:26:03,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527673052] [2020-07-10 15:26:03,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-07-10 15:26:03,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:03,934 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:03,960 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:03,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:03,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:03,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:03,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:26:03,961 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 3 states. [2020-07-10 15:26:04,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:04,052 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2020-07-10 15:26:04,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:04,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-07-10 15:26:04,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:04,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:04,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2020-07-10 15:26:04,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:04,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2020-07-10 15:26:04,059 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2020-07-10 15:26:04,105 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:04,107 INFO L225 Difference]: With dead ends: 60 [2020-07-10 15:26:04,107 INFO L226 Difference]: Without dead ends: 49 [2020-07-10 15:26:04,108 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:26:04,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-10 15:26:04,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-10 15:26:04,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:04,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2020-07-10 15:26:04,158 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-10 15:26:04,158 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-10 15:26:04,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:04,161 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-10 15:26:04,161 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-10 15:26:04,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:04,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:04,161 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-10 15:26:04,162 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-10 15:26:04,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:04,163 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-10 15:26:04,164 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-10 15:26:04,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:04,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:04,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:04,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:04,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-10 15:26:04,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2020-07-10 15:26:04,166 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 40 [2020-07-10 15:26:04,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:04,167 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2020-07-10 15:26:04,167 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:04,167 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-10 15:26:04,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-10 15:26:04,168 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:04,168 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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:26:04,380 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:04,381 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:04,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:04,382 INFO L82 PathProgramCache]: Analyzing trace with hash 379746771, now seen corresponding path program 1 times [2020-07-10 15:26:04,382 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:04,383 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017528825] [2020-07-10 15:26:04,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,443 INFO L280 TraceCheckUtils]: 0: Hoare triple {2522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2501#true} is VALID [2020-07-10 15:26:04,443 INFO L280 TraceCheckUtils]: 1: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-10 15:26:04,444 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2501#true} {2501#true} #80#return; {2501#true} is VALID [2020-07-10 15:26:04,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,698 INFO L280 TraceCheckUtils]: 0: Hoare triple {2523#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {2524#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:04,699 INFO L280 TraceCheckUtils]: 1: Hoare triple {2524#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2524#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:04,700 INFO L280 TraceCheckUtils]: 2: Hoare triple {2524#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2525#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:04,701 INFO L280 TraceCheckUtils]: 3: Hoare triple {2525#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2525#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:04,702 INFO L280 TraceCheckUtils]: 4: Hoare triple {2525#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2526#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:04,703 INFO L280 TraceCheckUtils]: 5: Hoare triple {2526#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2526#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:04,704 INFO L280 TraceCheckUtils]: 6: Hoare triple {2526#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2527#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:04,705 INFO L280 TraceCheckUtils]: 7: Hoare triple {2527#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2527#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:04,706 INFO L280 TraceCheckUtils]: 8: Hoare triple {2527#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2528#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:04,707 INFO L280 TraceCheckUtils]: 9: Hoare triple {2528#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {2529#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:04,707 INFO L280 TraceCheckUtils]: 10: Hoare triple {2529#(not (= |init_#in~size| 1000000))} assume true; {2529#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:04,708 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2529#(not (= |init_#in~size| 1000000))} {2501#true} #76#return; {2502#false} is VALID [2020-07-10 15:26:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,713 INFO L280 TraceCheckUtils]: 0: Hoare triple {2501#true} ~cond := #in~cond; {2501#true} is VALID [2020-07-10 15:26:04,713 INFO L280 TraceCheckUtils]: 1: Hoare triple {2501#true} assume !(0 == ~cond); {2501#true} is VALID [2020-07-10 15:26:04,713 INFO L280 TraceCheckUtils]: 2: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-10 15:26:04,713 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2501#true} {2502#false} #78#return; {2502#false} is VALID [2020-07-10 15:26:04,714 INFO L263 TraceCheckUtils]: 0: Hoare triple {2501#true} call ULTIMATE.init(); {2522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:04,714 INFO L280 TraceCheckUtils]: 1: Hoare triple {2522#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2501#true} is VALID [2020-07-10 15:26:04,714 INFO L280 TraceCheckUtils]: 2: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-10 15:26:04,714 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2501#true} {2501#true} #80#return; {2501#true} is VALID [2020-07-10 15:26:04,714 INFO L263 TraceCheckUtils]: 4: Hoare triple {2501#true} call #t~ret6 := main(); {2501#true} is VALID [2020-07-10 15:26:04,714 INFO L280 TraceCheckUtils]: 5: Hoare triple {2501#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {2501#true} is VALID [2020-07-10 15:26:04,715 INFO L263 TraceCheckUtils]: 6: Hoare triple {2501#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {2523#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:26:04,716 INFO L280 TraceCheckUtils]: 7: Hoare triple {2523#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {2524#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:04,718 INFO L280 TraceCheckUtils]: 8: Hoare triple {2524#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2524#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:04,719 INFO L280 TraceCheckUtils]: 9: Hoare triple {2524#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2525#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:04,720 INFO L280 TraceCheckUtils]: 10: Hoare triple {2525#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2525#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:04,721 INFO L280 TraceCheckUtils]: 11: Hoare triple {2525#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2526#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:04,722 INFO L280 TraceCheckUtils]: 12: Hoare triple {2526#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2526#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:04,723 INFO L280 TraceCheckUtils]: 13: Hoare triple {2526#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2527#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:04,724 INFO L280 TraceCheckUtils]: 14: Hoare triple {2527#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2527#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:04,725 INFO L280 TraceCheckUtils]: 15: Hoare triple {2527#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2528#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:04,726 INFO L280 TraceCheckUtils]: 16: Hoare triple {2528#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {2529#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:04,727 INFO L280 TraceCheckUtils]: 17: Hoare triple {2529#(not (= |init_#in~size| 1000000))} assume true; {2529#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:04,728 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2529#(not (= |init_#in~size| 1000000))} {2501#true} #76#return; {2502#false} is VALID [2020-07-10 15:26:04,728 INFO L280 TraceCheckUtils]: 19: Hoare triple {2502#false} ~i~1 := 0; {2502#false} is VALID [2020-07-10 15:26:04,728 INFO L280 TraceCheckUtils]: 20: Hoare triple {2502#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-10 15:26:04,728 INFO L280 TraceCheckUtils]: 21: Hoare triple {2502#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2502#false} is VALID [2020-07-10 15:26:04,728 INFO L280 TraceCheckUtils]: 22: Hoare triple {2502#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2502#false} is VALID [2020-07-10 15:26:04,729 INFO L280 TraceCheckUtils]: 23: Hoare triple {2502#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-10 15:26:04,729 INFO L280 TraceCheckUtils]: 24: Hoare triple {2502#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2502#false} is VALID [2020-07-10 15:26:04,729 INFO L280 TraceCheckUtils]: 25: Hoare triple {2502#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2502#false} is VALID [2020-07-10 15:26:04,729 INFO L280 TraceCheckUtils]: 26: Hoare triple {2502#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-10 15:26:04,730 INFO L280 TraceCheckUtils]: 27: Hoare triple {2502#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2502#false} is VALID [2020-07-10 15:26:04,730 INFO L280 TraceCheckUtils]: 28: Hoare triple {2502#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2502#false} is VALID [2020-07-10 15:26:04,730 INFO L280 TraceCheckUtils]: 29: Hoare triple {2502#false} assume !(~i~1 < 1000000); {2502#false} is VALID [2020-07-10 15:26:04,731 INFO L280 TraceCheckUtils]: 30: Hoare triple {2502#false} ~i~1 := 0; {2502#false} is VALID [2020-07-10 15:26:04,731 INFO L280 TraceCheckUtils]: 31: Hoare triple {2502#false} assume !!(~i~1 < 1000000); {2502#false} is VALID [2020-07-10 15:26:04,731 INFO L280 TraceCheckUtils]: 32: Hoare triple {2502#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-10 15:26:04,731 INFO L263 TraceCheckUtils]: 33: Hoare triple {2502#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2501#true} is VALID [2020-07-10 15:26:04,732 INFO L280 TraceCheckUtils]: 34: Hoare triple {2501#true} ~cond := #in~cond; {2501#true} is VALID [2020-07-10 15:26:04,732 INFO L280 TraceCheckUtils]: 35: Hoare triple {2501#true} assume !(0 == ~cond); {2501#true} is VALID [2020-07-10 15:26:04,732 INFO L280 TraceCheckUtils]: 36: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-10 15:26:04,732 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2501#true} {2502#false} #78#return; {2502#false} is VALID [2020-07-10 15:26:04,732 INFO L280 TraceCheckUtils]: 38: Hoare triple {2502#false} havoc #t~mem5.base, #t~mem5.offset; {2502#false} is VALID [2020-07-10 15:26:04,733 INFO L280 TraceCheckUtils]: 39: Hoare triple {2502#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2502#false} is VALID [2020-07-10 15:26:04,733 INFO L280 TraceCheckUtils]: 40: Hoare triple {2502#false} assume !!(~i~1 < 1000000); {2502#false} is VALID [2020-07-10 15:26:04,733 INFO L280 TraceCheckUtils]: 41: Hoare triple {2502#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-10 15:26:04,733 INFO L263 TraceCheckUtils]: 42: Hoare triple {2502#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2502#false} is VALID [2020-07-10 15:26:04,733 INFO L280 TraceCheckUtils]: 43: Hoare triple {2502#false} ~cond := #in~cond; {2502#false} is VALID [2020-07-10 15:26:04,734 INFO L280 TraceCheckUtils]: 44: Hoare triple {2502#false} assume 0 == ~cond; {2502#false} is VALID [2020-07-10 15:26:04,734 INFO L280 TraceCheckUtils]: 45: Hoare triple {2502#false} assume !false; {2502#false} is VALID [2020-07-10 15:26:04,737 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-10 15:26:04,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017528825] [2020-07-10 15:26:04,737 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1740317896] [2020-07-10 15:26:04,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,808 INFO L264 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 15:26:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,822 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:05,050 INFO L263 TraceCheckUtils]: 0: Hoare triple {2501#true} call ULTIMATE.init(); {2501#true} is VALID [2020-07-10 15:26:05,051 INFO L280 TraceCheckUtils]: 1: Hoare triple {2501#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2501#true} is VALID [2020-07-10 15:26:05,051 INFO L280 TraceCheckUtils]: 2: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-10 15:26:05,051 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2501#true} {2501#true} #80#return; {2501#true} is VALID [2020-07-10 15:26:05,051 INFO L263 TraceCheckUtils]: 4: Hoare triple {2501#true} call #t~ret6 := main(); {2501#true} is VALID [2020-07-10 15:26:05,051 INFO L280 TraceCheckUtils]: 5: Hoare triple {2501#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {2501#true} is VALID [2020-07-10 15:26:05,051 INFO L263 TraceCheckUtils]: 6: Hoare triple {2501#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {2501#true} is VALID [2020-07-10 15:26:05,052 INFO L280 TraceCheckUtils]: 7: Hoare triple {2501#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {2554#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} is VALID [2020-07-10 15:26:05,053 INFO L280 TraceCheckUtils]: 8: Hoare triple {2554#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2554#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} is VALID [2020-07-10 15:26:05,054 INFO L280 TraceCheckUtils]: 9: Hoare triple {2554#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2561#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} is VALID [2020-07-10 15:26:05,055 INFO L280 TraceCheckUtils]: 10: Hoare triple {2561#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2561#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} is VALID [2020-07-10 15:26:05,056 INFO L280 TraceCheckUtils]: 11: Hoare triple {2561#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2568#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} is VALID [2020-07-10 15:26:05,056 INFO L280 TraceCheckUtils]: 12: Hoare triple {2568#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2568#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} is VALID [2020-07-10 15:26:05,057 INFO L280 TraceCheckUtils]: 13: Hoare triple {2568#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2575#(and (<= |init_#in~size| init_~size) (<= init_~i~0 3))} is VALID [2020-07-10 15:26:05,058 INFO L280 TraceCheckUtils]: 14: Hoare triple {2575#(and (<= |init_#in~size| init_~size) (<= init_~i~0 3))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {2575#(and (<= |init_#in~size| init_~size) (<= init_~i~0 3))} is VALID [2020-07-10 15:26:05,059 INFO L280 TraceCheckUtils]: 15: Hoare triple {2575#(and (<= |init_#in~size| init_~size) (<= init_~i~0 3))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2582#(and (<= init_~i~0 4) (<= |init_#in~size| init_~size))} is VALID [2020-07-10 15:26:05,060 INFO L280 TraceCheckUtils]: 16: Hoare triple {2582#(and (<= init_~i~0 4) (<= |init_#in~size| init_~size))} assume !(~i~0 < ~size); {2586#(<= |init_#in~size| 4)} is VALID [2020-07-10 15:26:05,061 INFO L280 TraceCheckUtils]: 17: Hoare triple {2586#(<= |init_#in~size| 4)} assume true; {2586#(<= |init_#in~size| 4)} is VALID [2020-07-10 15:26:05,062 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2586#(<= |init_#in~size| 4)} {2501#true} #76#return; {2502#false} is VALID [2020-07-10 15:26:05,062 INFO L280 TraceCheckUtils]: 19: Hoare triple {2502#false} ~i~1 := 0; {2502#false} is VALID [2020-07-10 15:26:05,062 INFO L280 TraceCheckUtils]: 20: Hoare triple {2502#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-10 15:26:05,062 INFO L280 TraceCheckUtils]: 21: Hoare triple {2502#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2502#false} is VALID [2020-07-10 15:26:05,062 INFO L280 TraceCheckUtils]: 22: Hoare triple {2502#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2502#false} is VALID [2020-07-10 15:26:05,063 INFO L280 TraceCheckUtils]: 23: Hoare triple {2502#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-10 15:26:05,063 INFO L280 TraceCheckUtils]: 24: Hoare triple {2502#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2502#false} is VALID [2020-07-10 15:26:05,063 INFO L280 TraceCheckUtils]: 25: Hoare triple {2502#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2502#false} is VALID [2020-07-10 15:26:05,063 INFO L280 TraceCheckUtils]: 26: Hoare triple {2502#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-10 15:26:05,063 INFO L280 TraceCheckUtils]: 27: Hoare triple {2502#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2502#false} is VALID [2020-07-10 15:26:05,064 INFO L280 TraceCheckUtils]: 28: Hoare triple {2502#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2502#false} is VALID [2020-07-10 15:26:05,064 INFO L280 TraceCheckUtils]: 29: Hoare triple {2502#false} assume !(~i~1 < 1000000); {2502#false} is VALID [2020-07-10 15:26:05,064 INFO L280 TraceCheckUtils]: 30: Hoare triple {2502#false} ~i~1 := 0; {2502#false} is VALID [2020-07-10 15:26:05,064 INFO L280 TraceCheckUtils]: 31: Hoare triple {2502#false} assume !!(~i~1 < 1000000); {2502#false} is VALID [2020-07-10 15:26:05,064 INFO L280 TraceCheckUtils]: 32: Hoare triple {2502#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-10 15:26:05,064 INFO L263 TraceCheckUtils]: 33: Hoare triple {2502#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2502#false} is VALID [2020-07-10 15:26:05,064 INFO L280 TraceCheckUtils]: 34: Hoare triple {2502#false} ~cond := #in~cond; {2502#false} is VALID [2020-07-10 15:26:05,065 INFO L280 TraceCheckUtils]: 35: Hoare triple {2502#false} assume !(0 == ~cond); {2502#false} is VALID [2020-07-10 15:26:05,065 INFO L280 TraceCheckUtils]: 36: Hoare triple {2502#false} assume true; {2502#false} is VALID [2020-07-10 15:26:05,065 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2502#false} {2502#false} #78#return; {2502#false} is VALID [2020-07-10 15:26:05,065 INFO L280 TraceCheckUtils]: 38: Hoare triple {2502#false} havoc #t~mem5.base, #t~mem5.offset; {2502#false} is VALID [2020-07-10 15:26:05,065 INFO L280 TraceCheckUtils]: 39: Hoare triple {2502#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2502#false} is VALID [2020-07-10 15:26:05,065 INFO L280 TraceCheckUtils]: 40: Hoare triple {2502#false} assume !!(~i~1 < 1000000); {2502#false} is VALID [2020-07-10 15:26:05,065 INFO L280 TraceCheckUtils]: 41: Hoare triple {2502#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2502#false} is VALID [2020-07-10 15:26:05,065 INFO L263 TraceCheckUtils]: 42: Hoare triple {2502#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2502#false} is VALID [2020-07-10 15:26:05,066 INFO L280 TraceCheckUtils]: 43: Hoare triple {2502#false} ~cond := #in~cond; {2502#false} is VALID [2020-07-10 15:26:05,066 INFO L280 TraceCheckUtils]: 44: Hoare triple {2502#false} assume 0 == ~cond; {2502#false} is VALID [2020-07-10 15:26:05,066 INFO L280 TraceCheckUtils]: 45: Hoare triple {2502#false} assume !false; {2502#false} is VALID [2020-07-10 15:26:05,068 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-10 15:26:05,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:05,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2020-07-10 15:26:05,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359507351] [2020-07-10 15:26:05,069 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2020-07-10 15:26:05,069 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:05,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-10 15:26:05,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:05,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-10 15:26:05,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:05,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-10 15:26:05,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-07-10 15:26:05,142 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 16 states. [2020-07-10 15:26:05,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:05,901 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2020-07-10 15:26:05,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:26:05,901 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2020-07-10 15:26:05,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:05,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 15:26:05,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2020-07-10 15:26:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 15:26:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2020-07-10 15:26:05,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 60 transitions. [2020-07-10 15:26:05,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:05,983 INFO L225 Difference]: With dead ends: 84 [2020-07-10 15:26:05,983 INFO L226 Difference]: Without dead ends: 52 [2020-07-10 15:26:05,985 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=135, Invalid=417, Unknown=0, NotChecked=0, Total=552 [2020-07-10 15:26:05,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-10 15:26:06,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2020-07-10 15:26:06,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:06,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2020-07-10 15:26:06,042 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2020-07-10 15:26:06,042 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2020-07-10 15:26:06,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:06,044 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-10 15:26:06,044 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-10 15:26:06,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:06,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:06,045 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2020-07-10 15:26:06,045 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2020-07-10 15:26:06,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:06,048 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-10 15:26:06,048 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-10 15:26:06,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:06,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:06,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:06,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:06,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-10 15:26:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2020-07-10 15:26:06,055 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 46 [2020-07-10 15:26:06,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:06,056 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2020-07-10 15:26:06,056 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-10 15:26:06,056 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2020-07-10 15:26:06,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-10 15:26:06,057 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:06,057 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 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:26:06,258 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:06,259 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:06,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:06,260 INFO L82 PathProgramCache]: Analyzing trace with hash -538278827, now seen corresponding path program 2 times [2020-07-10 15:26:06,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:06,260 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155486102] [2020-07-10 15:26:06,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:06,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,318 INFO L280 TraceCheckUtils]: 0: Hoare triple {3006#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2983#true} is VALID [2020-07-10 15:26:06,318 INFO L280 TraceCheckUtils]: 1: Hoare triple {2983#true} assume true; {2983#true} is VALID [2020-07-10 15:26:06,318 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2983#true} {2983#true} #80#return; {2983#true} is VALID [2020-07-10 15:26:06,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,605 INFO L280 TraceCheckUtils]: 0: Hoare triple {3007#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {3008#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:06,606 INFO L280 TraceCheckUtils]: 1: Hoare triple {3008#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3008#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:06,607 INFO L280 TraceCheckUtils]: 2: Hoare triple {3008#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3009#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:06,608 INFO L280 TraceCheckUtils]: 3: Hoare triple {3009#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3009#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:06,609 INFO L280 TraceCheckUtils]: 4: Hoare triple {3009#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3010#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:06,609 INFO L280 TraceCheckUtils]: 5: Hoare triple {3010#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3010#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:06,610 INFO L280 TraceCheckUtils]: 6: Hoare triple {3010#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3011#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:06,611 INFO L280 TraceCheckUtils]: 7: Hoare triple {3011#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3011#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:06,612 INFO L280 TraceCheckUtils]: 8: Hoare triple {3011#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3012#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:06,613 INFO L280 TraceCheckUtils]: 9: Hoare triple {3012#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3012#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:06,613 INFO L280 TraceCheckUtils]: 10: Hoare triple {3012#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3013#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:06,614 INFO L280 TraceCheckUtils]: 11: Hoare triple {3013#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {3014#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:06,615 INFO L280 TraceCheckUtils]: 12: Hoare triple {3014#(not (= |init_#in~size| 1000000))} assume true; {3014#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:06,616 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3014#(not (= |init_#in~size| 1000000))} {2983#true} #76#return; {2984#false} is VALID [2020-07-10 15:26:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,620 INFO L280 TraceCheckUtils]: 0: Hoare triple {2983#true} ~cond := #in~cond; {2983#true} is VALID [2020-07-10 15:26:06,620 INFO L280 TraceCheckUtils]: 1: Hoare triple {2983#true} assume !(0 == ~cond); {2983#true} is VALID [2020-07-10 15:26:06,620 INFO L280 TraceCheckUtils]: 2: Hoare triple {2983#true} assume true; {2983#true} is VALID [2020-07-10 15:26:06,620 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2983#true} {2984#false} #78#return; {2984#false} is VALID [2020-07-10 15:26:06,621 INFO L263 TraceCheckUtils]: 0: Hoare triple {2983#true} call ULTIMATE.init(); {3006#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:06,621 INFO L280 TraceCheckUtils]: 1: Hoare triple {3006#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2983#true} is VALID [2020-07-10 15:26:06,622 INFO L280 TraceCheckUtils]: 2: Hoare triple {2983#true} assume true; {2983#true} is VALID [2020-07-10 15:26:06,622 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2983#true} {2983#true} #80#return; {2983#true} is VALID [2020-07-10 15:26:06,622 INFO L263 TraceCheckUtils]: 4: Hoare triple {2983#true} call #t~ret6 := main(); {2983#true} is VALID [2020-07-10 15:26:06,622 INFO L280 TraceCheckUtils]: 5: Hoare triple {2983#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {2983#true} is VALID [2020-07-10 15:26:06,623 INFO L263 TraceCheckUtils]: 6: Hoare triple {2983#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {3007#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:26:06,623 INFO L280 TraceCheckUtils]: 7: Hoare triple {3007#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {3008#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:06,624 INFO L280 TraceCheckUtils]: 8: Hoare triple {3008#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3008#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:06,625 INFO L280 TraceCheckUtils]: 9: Hoare triple {3008#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3009#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:06,626 INFO L280 TraceCheckUtils]: 10: Hoare triple {3009#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3009#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:06,626 INFO L280 TraceCheckUtils]: 11: Hoare triple {3009#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3010#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:06,627 INFO L280 TraceCheckUtils]: 12: Hoare triple {3010#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3010#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:06,628 INFO L280 TraceCheckUtils]: 13: Hoare triple {3010#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3011#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:06,629 INFO L280 TraceCheckUtils]: 14: Hoare triple {3011#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3011#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:06,629 INFO L280 TraceCheckUtils]: 15: Hoare triple {3011#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3012#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:06,630 INFO L280 TraceCheckUtils]: 16: Hoare triple {3012#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3012#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:06,630 INFO L280 TraceCheckUtils]: 17: Hoare triple {3012#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3013#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:06,631 INFO L280 TraceCheckUtils]: 18: Hoare triple {3013#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {3014#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:06,631 INFO L280 TraceCheckUtils]: 19: Hoare triple {3014#(not (= |init_#in~size| 1000000))} assume true; {3014#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:06,632 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3014#(not (= |init_#in~size| 1000000))} {2983#true} #76#return; {2984#false} is VALID [2020-07-10 15:26:06,632 INFO L280 TraceCheckUtils]: 21: Hoare triple {2984#false} ~i~1 := 0; {2984#false} is VALID [2020-07-10 15:26:06,632 INFO L280 TraceCheckUtils]: 22: Hoare triple {2984#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-10 15:26:06,632 INFO L280 TraceCheckUtils]: 23: Hoare triple {2984#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2984#false} is VALID [2020-07-10 15:26:06,633 INFO L280 TraceCheckUtils]: 24: Hoare triple {2984#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2984#false} is VALID [2020-07-10 15:26:06,633 INFO L280 TraceCheckUtils]: 25: Hoare triple {2984#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-10 15:26:06,633 INFO L280 TraceCheckUtils]: 26: Hoare triple {2984#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2984#false} is VALID [2020-07-10 15:26:06,633 INFO L280 TraceCheckUtils]: 27: Hoare triple {2984#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2984#false} is VALID [2020-07-10 15:26:06,633 INFO L280 TraceCheckUtils]: 28: Hoare triple {2984#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-10 15:26:06,633 INFO L280 TraceCheckUtils]: 29: Hoare triple {2984#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2984#false} is VALID [2020-07-10 15:26:06,633 INFO L280 TraceCheckUtils]: 30: Hoare triple {2984#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2984#false} is VALID [2020-07-10 15:26:06,633 INFO L280 TraceCheckUtils]: 31: Hoare triple {2984#false} assume !(~i~1 < 1000000); {2984#false} is VALID [2020-07-10 15:26:06,634 INFO L280 TraceCheckUtils]: 32: Hoare triple {2984#false} ~i~1 := 0; {2984#false} is VALID [2020-07-10 15:26:06,634 INFO L280 TraceCheckUtils]: 33: Hoare triple {2984#false} assume !!(~i~1 < 1000000); {2984#false} is VALID [2020-07-10 15:26:06,634 INFO L280 TraceCheckUtils]: 34: Hoare triple {2984#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-10 15:26:06,634 INFO L263 TraceCheckUtils]: 35: Hoare triple {2984#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2983#true} is VALID [2020-07-10 15:26:06,634 INFO L280 TraceCheckUtils]: 36: Hoare triple {2983#true} ~cond := #in~cond; {2983#true} is VALID [2020-07-10 15:26:06,634 INFO L280 TraceCheckUtils]: 37: Hoare triple {2983#true} assume !(0 == ~cond); {2983#true} is VALID [2020-07-10 15:26:06,634 INFO L280 TraceCheckUtils]: 38: Hoare triple {2983#true} assume true; {2983#true} is VALID [2020-07-10 15:26:06,635 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2983#true} {2984#false} #78#return; {2984#false} is VALID [2020-07-10 15:26:06,635 INFO L280 TraceCheckUtils]: 40: Hoare triple {2984#false} havoc #t~mem5.base, #t~mem5.offset; {2984#false} is VALID [2020-07-10 15:26:06,635 INFO L280 TraceCheckUtils]: 41: Hoare triple {2984#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2984#false} is VALID [2020-07-10 15:26:06,635 INFO L280 TraceCheckUtils]: 42: Hoare triple {2984#false} assume !!(~i~1 < 1000000); {2984#false} is VALID [2020-07-10 15:26:06,635 INFO L280 TraceCheckUtils]: 43: Hoare triple {2984#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-10 15:26:06,635 INFO L263 TraceCheckUtils]: 44: Hoare triple {2984#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2984#false} is VALID [2020-07-10 15:26:06,635 INFO L280 TraceCheckUtils]: 45: Hoare triple {2984#false} ~cond := #in~cond; {2984#false} is VALID [2020-07-10 15:26:06,635 INFO L280 TraceCheckUtils]: 46: Hoare triple {2984#false} assume 0 == ~cond; {2984#false} is VALID [2020-07-10 15:26:06,636 INFO L280 TraceCheckUtils]: 47: Hoare triple {2984#false} assume !false; {2984#false} is VALID [2020-07-10 15:26:06,638 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-10 15:26:06,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155486102] [2020-07-10 15:26:06,638 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473914104] [2020-07-10 15:26:06,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 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:06,685 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:26:06,686 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:06,686 INFO L264 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-10 15:26:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,709 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:06,937 INFO L263 TraceCheckUtils]: 0: Hoare triple {2983#true} call ULTIMATE.init(); {2983#true} is VALID [2020-07-10 15:26:06,938 INFO L280 TraceCheckUtils]: 1: Hoare triple {2983#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2983#true} is VALID [2020-07-10 15:26:06,938 INFO L280 TraceCheckUtils]: 2: Hoare triple {2983#true} assume true; {2983#true} is VALID [2020-07-10 15:26:06,938 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2983#true} {2983#true} #80#return; {2983#true} is VALID [2020-07-10 15:26:06,938 INFO L263 TraceCheckUtils]: 4: Hoare triple {2983#true} call #t~ret6 := main(); {2983#true} is VALID [2020-07-10 15:26:06,938 INFO L280 TraceCheckUtils]: 5: Hoare triple {2983#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {2983#true} is VALID [2020-07-10 15:26:06,938 INFO L263 TraceCheckUtils]: 6: Hoare triple {2983#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {2983#true} is VALID [2020-07-10 15:26:06,939 INFO L280 TraceCheckUtils]: 7: Hoare triple {2983#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {3039#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} is VALID [2020-07-10 15:26:06,940 INFO L280 TraceCheckUtils]: 8: Hoare triple {3039#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3039#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} is VALID [2020-07-10 15:26:06,940 INFO L280 TraceCheckUtils]: 9: Hoare triple {3039#(and (<= init_~i~0 0) (<= |init_#in~size| init_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3046#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} is VALID [2020-07-10 15:26:06,941 INFO L280 TraceCheckUtils]: 10: Hoare triple {3046#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3046#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} is VALID [2020-07-10 15:26:06,942 INFO L280 TraceCheckUtils]: 11: Hoare triple {3046#(and (<= |init_#in~size| init_~size) (<= init_~i~0 1))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3053#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} is VALID [2020-07-10 15:26:06,942 INFO L280 TraceCheckUtils]: 12: Hoare triple {3053#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3053#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} is VALID [2020-07-10 15:26:06,943 INFO L280 TraceCheckUtils]: 13: Hoare triple {3053#(and (<= |init_#in~size| init_~size) (<= init_~i~0 2))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3060#(and (<= |init_#in~size| init_~size) (<= init_~i~0 3))} is VALID [2020-07-10 15:26:06,944 INFO L280 TraceCheckUtils]: 14: Hoare triple {3060#(and (<= |init_#in~size| init_~size) (<= init_~i~0 3))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3060#(and (<= |init_#in~size| init_~size) (<= init_~i~0 3))} is VALID [2020-07-10 15:26:06,945 INFO L280 TraceCheckUtils]: 15: Hoare triple {3060#(and (<= |init_#in~size| init_~size) (<= init_~i~0 3))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3067#(and (<= init_~i~0 4) (<= |init_#in~size| init_~size))} is VALID [2020-07-10 15:26:06,946 INFO L280 TraceCheckUtils]: 16: Hoare triple {3067#(and (<= init_~i~0 4) (<= |init_#in~size| init_~size))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3067#(and (<= init_~i~0 4) (<= |init_#in~size| init_~size))} is VALID [2020-07-10 15:26:06,946 INFO L280 TraceCheckUtils]: 17: Hoare triple {3067#(and (<= init_~i~0 4) (<= |init_#in~size| init_~size))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3074#(and (<= |init_#in~size| init_~size) (<= init_~i~0 5))} is VALID [2020-07-10 15:26:06,947 INFO L280 TraceCheckUtils]: 18: Hoare triple {3074#(and (<= |init_#in~size| init_~size) (<= init_~i~0 5))} assume !(~i~0 < ~size); {3078#(<= |init_#in~size| 5)} is VALID [2020-07-10 15:26:06,947 INFO L280 TraceCheckUtils]: 19: Hoare triple {3078#(<= |init_#in~size| 5)} assume true; {3078#(<= |init_#in~size| 5)} is VALID [2020-07-10 15:26:06,948 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3078#(<= |init_#in~size| 5)} {2983#true} #76#return; {2984#false} is VALID [2020-07-10 15:26:06,948 INFO L280 TraceCheckUtils]: 21: Hoare triple {2984#false} ~i~1 := 0; {2984#false} is VALID [2020-07-10 15:26:06,948 INFO L280 TraceCheckUtils]: 22: Hoare triple {2984#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-10 15:26:06,948 INFO L280 TraceCheckUtils]: 23: Hoare triple {2984#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2984#false} is VALID [2020-07-10 15:26:06,948 INFO L280 TraceCheckUtils]: 24: Hoare triple {2984#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2984#false} is VALID [2020-07-10 15:26:06,948 INFO L280 TraceCheckUtils]: 25: Hoare triple {2984#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-10 15:26:06,949 INFO L280 TraceCheckUtils]: 26: Hoare triple {2984#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2984#false} is VALID [2020-07-10 15:26:06,949 INFO L280 TraceCheckUtils]: 27: Hoare triple {2984#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2984#false} is VALID [2020-07-10 15:26:06,949 INFO L280 TraceCheckUtils]: 28: Hoare triple {2984#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-10 15:26:06,949 INFO L280 TraceCheckUtils]: 29: Hoare triple {2984#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {2984#false} is VALID [2020-07-10 15:26:06,949 INFO L280 TraceCheckUtils]: 30: Hoare triple {2984#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {2984#false} is VALID [2020-07-10 15:26:06,949 INFO L280 TraceCheckUtils]: 31: Hoare triple {2984#false} assume !(~i~1 < 1000000); {2984#false} is VALID [2020-07-10 15:26:06,949 INFO L280 TraceCheckUtils]: 32: Hoare triple {2984#false} ~i~1 := 0; {2984#false} is VALID [2020-07-10 15:26:06,949 INFO L280 TraceCheckUtils]: 33: Hoare triple {2984#false} assume !!(~i~1 < 1000000); {2984#false} is VALID [2020-07-10 15:26:06,950 INFO L280 TraceCheckUtils]: 34: Hoare triple {2984#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-10 15:26:06,950 INFO L263 TraceCheckUtils]: 35: Hoare triple {2984#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2984#false} is VALID [2020-07-10 15:26:06,950 INFO L280 TraceCheckUtils]: 36: Hoare triple {2984#false} ~cond := #in~cond; {2984#false} is VALID [2020-07-10 15:26:06,950 INFO L280 TraceCheckUtils]: 37: Hoare triple {2984#false} assume !(0 == ~cond); {2984#false} is VALID [2020-07-10 15:26:06,950 INFO L280 TraceCheckUtils]: 38: Hoare triple {2984#false} assume true; {2984#false} is VALID [2020-07-10 15:26:06,950 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2984#false} {2984#false} #78#return; {2984#false} is VALID [2020-07-10 15:26:06,950 INFO L280 TraceCheckUtils]: 40: Hoare triple {2984#false} havoc #t~mem5.base, #t~mem5.offset; {2984#false} is VALID [2020-07-10 15:26:06,951 INFO L280 TraceCheckUtils]: 41: Hoare triple {2984#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {2984#false} is VALID [2020-07-10 15:26:06,951 INFO L280 TraceCheckUtils]: 42: Hoare triple {2984#false} assume !!(~i~1 < 1000000); {2984#false} is VALID [2020-07-10 15:26:06,951 INFO L280 TraceCheckUtils]: 43: Hoare triple {2984#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {2984#false} is VALID [2020-07-10 15:26:06,951 INFO L263 TraceCheckUtils]: 44: Hoare triple {2984#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {2984#false} is VALID [2020-07-10 15:26:06,951 INFO L280 TraceCheckUtils]: 45: Hoare triple {2984#false} ~cond := #in~cond; {2984#false} is VALID [2020-07-10 15:26:06,951 INFO L280 TraceCheckUtils]: 46: Hoare triple {2984#false} assume 0 == ~cond; {2984#false} is VALID [2020-07-10 15:26:06,951 INFO L280 TraceCheckUtils]: 47: Hoare triple {2984#false} assume !false; {2984#false} is VALID [2020-07-10 15:26:06,953 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2020-07-10 15:26:06,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:06,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2020-07-10 15:26:06,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576288954] [2020-07-10 15:26:06,954 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2020-07-10 15:26:06,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:06,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-10 15:26:07,030 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:07,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-10 15:26:07,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:07,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-10 15:26:07,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2020-07-10 15:26:07,032 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 18 states. [2020-07-10 15:26:07,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:07,963 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2020-07-10 15:26:07,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:26:07,963 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2020-07-10 15:26:07,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:07,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:26:07,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2020-07-10 15:26:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:26:07,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2020-07-10 15:26:07,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 62 transitions. [2020-07-10 15:26:08,041 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:08,043 INFO L225 Difference]: With dead ends: 86 [2020-07-10 15:26:08,043 INFO L226 Difference]: Without dead ends: 54 [2020-07-10 15:26:08,045 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2020-07-10 15:26:08,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-10 15:26:08,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2020-07-10 15:26:08,103 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:08,103 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2020-07-10 15:26:08,103 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2020-07-10 15:26:08,103 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2020-07-10 15:26:08,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:08,105 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2020-07-10 15:26:08,105 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2020-07-10 15:26:08,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:08,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:08,106 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2020-07-10 15:26:08,106 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2020-07-10 15:26:08,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:08,108 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2020-07-10 15:26:08,108 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2020-07-10 15:26:08,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:08,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:08,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:08,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-10 15:26:08,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2020-07-10 15:26:08,110 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 48 [2020-07-10 15:26:08,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:08,110 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2020-07-10 15:26:08,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-10 15:26:08,111 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-10 15:26:08,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-10 15:26:08,111 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:08,111 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 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:26:08,323 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-10 15:26:08,323 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:08,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:08,324 INFO L82 PathProgramCache]: Analyzing trace with hash 2002384471, now seen corresponding path program 3 times [2020-07-10 15:26:08,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:08,325 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258069477] [2020-07-10 15:26:08,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,366 INFO L280 TraceCheckUtils]: 0: Hoare triple {3512#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3487#true} is VALID [2020-07-10 15:26:08,367 INFO L280 TraceCheckUtils]: 1: Hoare triple {3487#true} assume true; {3487#true} is VALID [2020-07-10 15:26:08,367 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3487#true} {3487#true} #80#return; {3487#true} is VALID [2020-07-10 15:26:08,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,698 INFO L280 TraceCheckUtils]: 0: Hoare triple {3513#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {3514#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,699 INFO L280 TraceCheckUtils]: 1: Hoare triple {3514#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3514#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,700 INFO L280 TraceCheckUtils]: 2: Hoare triple {3514#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3515#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,701 INFO L280 TraceCheckUtils]: 3: Hoare triple {3515#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3515#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,702 INFO L280 TraceCheckUtils]: 4: Hoare triple {3515#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3516#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:08,703 INFO L280 TraceCheckUtils]: 5: Hoare triple {3516#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3516#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:08,704 INFO L280 TraceCheckUtils]: 6: Hoare triple {3516#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3517#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,705 INFO L280 TraceCheckUtils]: 7: Hoare triple {3517#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3517#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,706 INFO L280 TraceCheckUtils]: 8: Hoare triple {3517#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3518#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,707 INFO L280 TraceCheckUtils]: 9: Hoare triple {3518#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3518#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,708 INFO L280 TraceCheckUtils]: 10: Hoare triple {3518#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3519#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,709 INFO L280 TraceCheckUtils]: 11: Hoare triple {3519#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3519#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,710 INFO L280 TraceCheckUtils]: 12: Hoare triple {3519#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3520#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 6)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,711 INFO L280 TraceCheckUtils]: 13: Hoare triple {3520#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 6)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {3521#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:08,711 INFO L280 TraceCheckUtils]: 14: Hoare triple {3521#(not (= |init_#in~size| 1000000))} assume true; {3521#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:08,712 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {3521#(not (= |init_#in~size| 1000000))} {3487#true} #76#return; {3488#false} is VALID [2020-07-10 15:26:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,717 INFO L280 TraceCheckUtils]: 0: Hoare triple {3487#true} ~cond := #in~cond; {3487#true} is VALID [2020-07-10 15:26:08,717 INFO L280 TraceCheckUtils]: 1: Hoare triple {3487#true} assume !(0 == ~cond); {3487#true} is VALID [2020-07-10 15:26:08,717 INFO L280 TraceCheckUtils]: 2: Hoare triple {3487#true} assume true; {3487#true} is VALID [2020-07-10 15:26:08,718 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3487#true} {3488#false} #78#return; {3488#false} is VALID [2020-07-10 15:26:08,718 INFO L263 TraceCheckUtils]: 0: Hoare triple {3487#true} call ULTIMATE.init(); {3512#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-10 15:26:08,719 INFO L280 TraceCheckUtils]: 1: Hoare triple {3512#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3487#true} is VALID [2020-07-10 15:26:08,719 INFO L280 TraceCheckUtils]: 2: Hoare triple {3487#true} assume true; {3487#true} is VALID [2020-07-10 15:26:08,719 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3487#true} {3487#true} #80#return; {3487#true} is VALID [2020-07-10 15:26:08,719 INFO L263 TraceCheckUtils]: 4: Hoare triple {3487#true} call #t~ret6 := main(); {3487#true} is VALID [2020-07-10 15:26:08,719 INFO L280 TraceCheckUtils]: 5: Hoare triple {3487#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {3487#true} is VALID [2020-07-10 15:26:08,720 INFO L263 TraceCheckUtils]: 6: Hoare triple {3487#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {3513#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} is VALID [2020-07-10 15:26:08,721 INFO L280 TraceCheckUtils]: 7: Hoare triple {3513#(and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|))} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {3514#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,722 INFO L280 TraceCheckUtils]: 8: Hoare triple {3514#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3514#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,723 INFO L280 TraceCheckUtils]: 9: Hoare triple {3514#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 0)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3515#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,724 INFO L280 TraceCheckUtils]: 10: Hoare triple {3515#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3515#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,725 INFO L280 TraceCheckUtils]: 11: Hoare triple {3515#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 1)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3516#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:08,726 INFO L280 TraceCheckUtils]: 12: Hoare triple {3516#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3516#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:08,727 INFO L280 TraceCheckUtils]: 13: Hoare triple {3516#(and (or (= |init_#in~size| init_~size) (= 1000000 init_~size)) (or (not (= 1000000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3517#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,728 INFO L280 TraceCheckUtils]: 14: Hoare triple {3517#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3517#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,729 INFO L280 TraceCheckUtils]: 15: Hoare triple {3517#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 3)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3518#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,730 INFO L280 TraceCheckUtils]: 16: Hoare triple {3518#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3518#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,731 INFO L280 TraceCheckUtils]: 17: Hoare triple {3518#(and (or (<= init_~i~0 4) (not (= 1000000 init_~size))) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3519#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,733 INFO L280 TraceCheckUtils]: 18: Hoare triple {3519#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3519#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,734 INFO L280 TraceCheckUtils]: 19: Hoare triple {3519#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 5)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3520#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 6)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} is VALID [2020-07-10 15:26:08,735 INFO L280 TraceCheckUtils]: 20: Hoare triple {3520#(and (or (not (= 1000000 init_~size)) (<= init_~i~0 6)) (or (= |init_#in~size| init_~size) (= 1000000 init_~size)))} assume !(~i~0 < ~size); {3521#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:08,735 INFO L280 TraceCheckUtils]: 21: Hoare triple {3521#(not (= |init_#in~size| 1000000))} assume true; {3521#(not (= |init_#in~size| 1000000))} is VALID [2020-07-10 15:26:08,737 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3521#(not (= |init_#in~size| 1000000))} {3487#true} #76#return; {3488#false} is VALID [2020-07-10 15:26:08,737 INFO L280 TraceCheckUtils]: 23: Hoare triple {3488#false} ~i~1 := 0; {3488#false} is VALID [2020-07-10 15:26:08,737 INFO L280 TraceCheckUtils]: 24: Hoare triple {3488#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3488#false} is VALID [2020-07-10 15:26:08,737 INFO L280 TraceCheckUtils]: 25: Hoare triple {3488#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {3488#false} is VALID [2020-07-10 15:26:08,737 INFO L280 TraceCheckUtils]: 26: Hoare triple {3488#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3488#false} is VALID [2020-07-10 15:26:08,738 INFO L280 TraceCheckUtils]: 27: Hoare triple {3488#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3488#false} is VALID [2020-07-10 15:26:08,738 INFO L280 TraceCheckUtils]: 28: Hoare triple {3488#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {3488#false} is VALID [2020-07-10 15:26:08,738 INFO L280 TraceCheckUtils]: 29: Hoare triple {3488#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3488#false} is VALID [2020-07-10 15:26:08,738 INFO L280 TraceCheckUtils]: 30: Hoare triple {3488#false} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3488#false} is VALID [2020-07-10 15:26:08,738 INFO L280 TraceCheckUtils]: 31: Hoare triple {3488#false} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {3488#false} is VALID [2020-07-10 15:26:08,739 INFO L280 TraceCheckUtils]: 32: Hoare triple {3488#false} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3488#false} is VALID [2020-07-10 15:26:08,739 INFO L280 TraceCheckUtils]: 33: Hoare triple {3488#false} assume !(~i~1 < 1000000); {3488#false} is VALID [2020-07-10 15:26:08,739 INFO L280 TraceCheckUtils]: 34: Hoare triple {3488#false} ~i~1 := 0; {3488#false} is VALID [2020-07-10 15:26:08,739 INFO L280 TraceCheckUtils]: 35: Hoare triple {3488#false} assume !!(~i~1 < 1000000); {3488#false} is VALID [2020-07-10 15:26:08,739 INFO L280 TraceCheckUtils]: 36: Hoare triple {3488#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3488#false} is VALID [2020-07-10 15:26:08,740 INFO L263 TraceCheckUtils]: 37: Hoare triple {3488#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {3487#true} is VALID [2020-07-10 15:26:08,740 INFO L280 TraceCheckUtils]: 38: Hoare triple {3487#true} ~cond := #in~cond; {3487#true} is VALID [2020-07-10 15:26:08,740 INFO L280 TraceCheckUtils]: 39: Hoare triple {3487#true} assume !(0 == ~cond); {3487#true} is VALID [2020-07-10 15:26:08,740 INFO L280 TraceCheckUtils]: 40: Hoare triple {3487#true} assume true; {3487#true} is VALID [2020-07-10 15:26:08,741 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3487#true} {3488#false} #78#return; {3488#false} is VALID [2020-07-10 15:26:08,741 INFO L280 TraceCheckUtils]: 42: Hoare triple {3488#false} havoc #t~mem5.base, #t~mem5.offset; {3488#false} is VALID [2020-07-10 15:26:08,741 INFO L280 TraceCheckUtils]: 43: Hoare triple {3488#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3488#false} is VALID [2020-07-10 15:26:08,741 INFO L280 TraceCheckUtils]: 44: Hoare triple {3488#false} assume !!(~i~1 < 1000000); {3488#false} is VALID [2020-07-10 15:26:08,741 INFO L280 TraceCheckUtils]: 45: Hoare triple {3488#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3488#false} is VALID [2020-07-10 15:26:08,742 INFO L263 TraceCheckUtils]: 46: Hoare triple {3488#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {3488#false} is VALID [2020-07-10 15:26:08,742 INFO L280 TraceCheckUtils]: 47: Hoare triple {3488#false} ~cond := #in~cond; {3488#false} is VALID [2020-07-10 15:26:08,742 INFO L280 TraceCheckUtils]: 48: Hoare triple {3488#false} assume 0 == ~cond; {3488#false} is VALID [2020-07-10 15:26:08,742 INFO L280 TraceCheckUtils]: 49: Hoare triple {3488#false} assume !false; {3488#false} is VALID [2020-07-10 15:26:08,746 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2020-07-10 15:26:08,747 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258069477] [2020-07-10 15:26:08,747 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [715300436] [2020-07-10 15:26:08,747 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 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:08,795 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-10 15:26:08,796 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:08,797 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 24 conjunts are in the unsatisfiable core [2020-07-10 15:26:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,820 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:08,906 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2020-07-10 15:26:08,906 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:08,915 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:08,917 INFO L544 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-07-10 15:26:08,917 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2020-07-10 15:26:08,920 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:08,921 WARN L407 uantifierElimination]: Input elimination task: ∃ [|v_#memory_$Pointer$.base_9|, |init_#t~malloc1.base|]. (and (= |#memory_$Pointer$.base| (store |v_#memory_$Pointer$.base_9| |init_#in~a.base| (store (select |v_#memory_$Pointer$.base_9| |init_#in~a.base|) (+ |init_#in~a.offset| (* init_~i~0 4)) |init_#t~malloc1.base|))) (< init_~i~0 init_~size) (= |init_#in~size| init_~size) (not (= 0 |init_#t~malloc1.base|))) [2020-07-10 15:26:08,921 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* init_~i~0 4))))) (< init_~i~0 init_~size) (= |init_#in~size| init_~size)) [2020-07-10 15:26:09,239 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:09,239 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 24 [2020-07-10 15:26:09,244 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:09,248 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-10 15:26:09,258 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:09,261 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:26:09,269 INFO L544 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-07-10 15:26:09,270 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:27 [2020-07-10 15:26:09,274 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:09,274 WARN L407 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, |main_~#a~0.base|, |main_~#a~0.offset|, v_init_~i~0_17]. (let ((.cse0 (select |#memory_$Pointer$.base| |main_~#a~0.base|))) (and (not (= 0 (select .cse0 (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (= |main_#t~mem3.base| (select .cse0 (+ (* main_~i~1 4) |main_~#a~0.offset|))) (<= 999999 v_init_~i~0_17) (< main_~i~1 1000000))) [2020-07-10 15:26:09,274 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ [|main_~#a~0.offset|, v_init_~i~0_17]. (and (or (not (= 0 |main_#t~mem3.base|)) (not (= (+ (* main_~i~1 4) |main_~#a~0.offset|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17) (< main_~i~1 1000000)) [2020-07-10 15:26:09,277 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:26:09,430 INFO L263 TraceCheckUtils]: 0: Hoare triple {3487#true} call ULTIMATE.init(); {3487#true} is VALID [2020-07-10 15:26:09,430 INFO L280 TraceCheckUtils]: 1: Hoare triple {3487#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3487#true} is VALID [2020-07-10 15:26:09,431 INFO L280 TraceCheckUtils]: 2: Hoare triple {3487#true} assume true; {3487#true} is VALID [2020-07-10 15:26:09,431 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3487#true} {3487#true} #80#return; {3487#true} is VALID [2020-07-10 15:26:09,431 INFO L263 TraceCheckUtils]: 4: Hoare triple {3487#true} call #t~ret6 := main(); {3487#true} is VALID [2020-07-10 15:26:09,431 INFO L280 TraceCheckUtils]: 5: Hoare triple {3487#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(4000000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {3487#true} is VALID [2020-07-10 15:26:09,431 INFO L263 TraceCheckUtils]: 6: Hoare triple {3487#true} call init(~#a~0.base, ~#a~0.offset, 1000000); {3487#true} is VALID [2020-07-10 15:26:09,432 INFO L280 TraceCheckUtils]: 7: Hoare triple {3487#true} ~a.base, ~a.offset := #in~a.base, #in~a.offset;~size := #in~size;havoc ~i~0;~i~0 := 0; {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-10 15:26:09,433 INFO L280 TraceCheckUtils]: 8: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-10 15:26:09,434 INFO L280 TraceCheckUtils]: 9: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-10 15:26:09,435 INFO L280 TraceCheckUtils]: 10: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-10 15:26:09,435 INFO L280 TraceCheckUtils]: 11: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-10 15:26:09,436 INFO L280 TraceCheckUtils]: 12: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-10 15:26:09,437 INFO L280 TraceCheckUtils]: 13: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-10 15:26:09,438 INFO L280 TraceCheckUtils]: 14: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-10 15:26:09,439 INFO L280 TraceCheckUtils]: 15: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-10 15:26:09,440 INFO L280 TraceCheckUtils]: 16: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-10 15:26:09,441 INFO L280 TraceCheckUtils]: 17: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} is VALID [2020-07-10 15:26:09,442 INFO L280 TraceCheckUtils]: 18: Hoare triple {3546#(and (= init_~a.base |init_#in~a.base|) (= |init_#in~size| init_~size) (= init_~a.offset |init_#in~a.offset|))} assume !!(~i~0 < ~size);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.allocOnHeap(4);call write~$Pointer$(#t~malloc1.base, #t~malloc1.offset, ~a.base, ~a.offset + 4 * ~i~0, 4); {3580#(and (= |init_#in~size| init_~size) (< init_~i~0 init_~size) (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* init_~i~0 4))))))} is VALID [2020-07-10 15:26:09,443 INFO L280 TraceCheckUtils]: 19: Hoare triple {3580#(and (= |init_#in~size| init_~size) (< init_~i~0 init_~size) (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* init_~i~0 4))))))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3584#(and (exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* v_init_~i~0_17 4))))) (<= init_~i~0 (+ v_init_~i~0_17 1)) (< v_init_~i~0_17 init_~size))) (= |init_#in~size| init_~size))} is VALID [2020-07-10 15:26:09,446 INFO L280 TraceCheckUtils]: 20: Hoare triple {3584#(and (exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* v_init_~i~0_17 4))))) (<= init_~i~0 (+ v_init_~i~0_17 1)) (< v_init_~i~0_17 init_~size))) (= |init_#in~size| init_~size))} assume !(~i~0 < ~size); {3588#(exists ((v_init_~i~0_17 Int)) (and (<= |init_#in~size| (+ v_init_~i~0_17 1)) (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* v_init_~i~0_17 4))))) (< v_init_~i~0_17 |init_#in~size|)))} is VALID [2020-07-10 15:26:09,446 INFO L280 TraceCheckUtils]: 21: Hoare triple {3588#(exists ((v_init_~i~0_17 Int)) (and (<= |init_#in~size| (+ v_init_~i~0_17 1)) (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* v_init_~i~0_17 4))))) (< v_init_~i~0_17 |init_#in~size|)))} assume true; {3588#(exists ((v_init_~i~0_17 Int)) (and (<= |init_#in~size| (+ v_init_~i~0_17 1)) (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* v_init_~i~0_17 4))))) (< v_init_~i~0_17 |init_#in~size|)))} is VALID [2020-07-10 15:26:09,448 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3588#(exists ((v_init_~i~0_17 Int)) (and (<= |init_#in~size| (+ v_init_~i~0_17 1)) (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* v_init_~i~0_17 4))))) (< v_init_~i~0_17 |init_#in~size|)))} {3487#true} #76#return; {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} is VALID [2020-07-10 15:26:09,449 INFO L280 TraceCheckUtils]: 23: Hoare triple {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} ~i~1 := 0; {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} is VALID [2020-07-10 15:26:09,449 INFO L280 TraceCheckUtils]: 24: Hoare triple {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} is VALID [2020-07-10 15:26:09,450 INFO L280 TraceCheckUtils]: 25: Hoare triple {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} is VALID [2020-07-10 15:26:09,450 INFO L280 TraceCheckUtils]: 26: Hoare triple {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} is VALID [2020-07-10 15:26:09,451 INFO L280 TraceCheckUtils]: 27: Hoare triple {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} is VALID [2020-07-10 15:26:09,452 INFO L280 TraceCheckUtils]: 28: Hoare triple {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} is VALID [2020-07-10 15:26:09,452 INFO L280 TraceCheckUtils]: 29: Hoare triple {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} is VALID [2020-07-10 15:26:09,455 INFO L280 TraceCheckUtils]: 30: Hoare triple {3595#(exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))} assume !!(~i~1 < 1000000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3620#(and (exists ((v_init_~i~0_17 Int)) (and (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17) (or (not (= 0 |main_#t~mem3.base|)) (not (= (* 4 main_~i~1) (* 4 v_init_~i~0_17)))))) (< main_~i~1 1000000))} is VALID [2020-07-10 15:26:09,456 INFO L280 TraceCheckUtils]: 31: Hoare triple {3620#(and (exists ((v_init_~i~0_17 Int)) (and (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17) (or (not (= 0 |main_#t~mem3.base|)) (not (= (* 4 main_~i~1) (* 4 v_init_~i~0_17)))))) (< main_~i~1 1000000))} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {3624#(<= main_~i~1 999998)} is VALID [2020-07-10 15:26:09,457 INFO L280 TraceCheckUtils]: 32: Hoare triple {3624#(<= main_~i~1 999998)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3628#(<= main_~i~1 999999)} is VALID [2020-07-10 15:26:09,457 INFO L280 TraceCheckUtils]: 33: Hoare triple {3628#(<= main_~i~1 999999)} assume !(~i~1 < 1000000); {3488#false} is VALID [2020-07-10 15:26:09,457 INFO L280 TraceCheckUtils]: 34: Hoare triple {3488#false} ~i~1 := 0; {3488#false} is VALID [2020-07-10 15:26:09,458 INFO L280 TraceCheckUtils]: 35: Hoare triple {3488#false} assume !!(~i~1 < 1000000); {3488#false} is VALID [2020-07-10 15:26:09,458 INFO L280 TraceCheckUtils]: 36: Hoare triple {3488#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3488#false} is VALID [2020-07-10 15:26:09,458 INFO L263 TraceCheckUtils]: 37: Hoare triple {3488#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {3488#false} is VALID [2020-07-10 15:26:09,458 INFO L280 TraceCheckUtils]: 38: Hoare triple {3488#false} ~cond := #in~cond; {3488#false} is VALID [2020-07-10 15:26:09,458 INFO L280 TraceCheckUtils]: 39: Hoare triple {3488#false} assume !(0 == ~cond); {3488#false} is VALID [2020-07-10 15:26:09,459 INFO L280 TraceCheckUtils]: 40: Hoare triple {3488#false} assume true; {3488#false} is VALID [2020-07-10 15:26:09,459 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3488#false} {3488#false} #78#return; {3488#false} is VALID [2020-07-10 15:26:09,459 INFO L280 TraceCheckUtils]: 42: Hoare triple {3488#false} havoc #t~mem5.base, #t~mem5.offset; {3488#false} is VALID [2020-07-10 15:26:09,459 INFO L280 TraceCheckUtils]: 43: Hoare triple {3488#false} #t~post4 := ~i~1;~i~1 := 1 + #t~post4;havoc #t~post4; {3488#false} is VALID [2020-07-10 15:26:09,459 INFO L280 TraceCheckUtils]: 44: Hoare triple {3488#false} assume !!(~i~1 < 1000000); {3488#false} is VALID [2020-07-10 15:26:09,459 INFO L280 TraceCheckUtils]: 45: Hoare triple {3488#false} assume 0 == ~flag~0;call #t~mem5.base, #t~mem5.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3488#false} is VALID [2020-07-10 15:26:09,460 INFO L263 TraceCheckUtils]: 46: Hoare triple {3488#false} call __VERIFIER_assert((if #t~mem5.base == 0 && #t~mem5.offset == 0 then 1 else 0)); {3488#false} is VALID [2020-07-10 15:26:09,460 INFO L280 TraceCheckUtils]: 47: Hoare triple {3488#false} ~cond := #in~cond; {3488#false} is VALID [2020-07-10 15:26:09,460 INFO L280 TraceCheckUtils]: 48: Hoare triple {3488#false} assume 0 == ~cond; {3488#false} is VALID [2020-07-10 15:26:09,460 INFO L280 TraceCheckUtils]: 49: Hoare triple {3488#false} assume !false; {3488#false} is VALID [2020-07-10 15:26:09,468 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-07-10 15:26:09,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:09,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2020-07-10 15:26:09,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68332438] [2020-07-10 15:26:09,470 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2020-07-10 15:26:09,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:09,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-10 15:26:09,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:09,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-10 15:26:09,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:09,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-10 15:26:09,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2020-07-10 15:26:09,561 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 20 states. [2020-07-10 15:26:11,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:11,440 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2020-07-10 15:26:11,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-10 15:26:11,441 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2020-07-10 15:26:11,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:11,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 15:26:11,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 54 transitions. [2020-07-10 15:26:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 15:26:11,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 54 transitions. [2020-07-10 15:26:11,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 54 transitions. [2020-07-10 15:26:11,550 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 15:26:11,551 INFO L225 Difference]: With dead ends: 69 [2020-07-10 15:26:11,551 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:26:11,553 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2020-07-10 15:26:11,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:26:11,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:26:11,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:11,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:26:11,553 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:26:11,554 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:26:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:11,554 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:26:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:26:11,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:11,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:11,554 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:26:11,554 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:26:11,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:11,555 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:26:11,555 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:26:11,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:11,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:11,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:11,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:11,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:26:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:26:11,556 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2020-07-10 15:26:11,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:11,556 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:26:11,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-10 15:26:11,556 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:26:11,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:11,757 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:11,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:26:12,025 INFO L264 CegarLoopResult]: At program point initENTRY(lines 9 16) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-10 15:26:12,025 INFO L268 CegarLoopResult]: For program point initEXIT(lines 9 16) no Hoare annotation was computed. [2020-07-10 15:26:12,025 INFO L268 CegarLoopResult]: For program point L12-2(lines 12 15) no Hoare annotation was computed. [2020-07-10 15:26:12,026 INFO L264 CegarLoopResult]: At program point L12-3(lines 12 15) the Hoare annotation is: (let ((.cse0 (= init_~a.base |init_#in~a.base|)) (.cse1 (= |init_#in~size| init_~size)) (.cse2 (= init_~a.offset |init_#in~a.offset|))) (or (and (exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ |init_#in~a.offset| (* v_init_~i~0_17 4))))) (<= init_~i~0 (+ v_init_~i~0_17 1)) (< v_init_~i~0_17 init_~size))) .cse0 .cse1 .cse2) (and (<= init_~i~0 0) (= |#valid| |old(#valid)|) .cse0 .cse1 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) .cse2 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)))) [2020-07-10 15:26:12,026 INFO L268 CegarLoopResult]: For program point L12-4(lines 9 16) no Hoare annotation was computed. [2020-07-10 15:26:12,026 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:26:12,026 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|)) [2020-07-10 15:26:12,026 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:26:12,026 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:26:12,026 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:26:12,027 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:26:12,027 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:26:12,027 INFO L268 CegarLoopResult]: For program point L33(lines 33 34) no Hoare annotation was computed. [2020-07-10 15:26:12,027 INFO L268 CegarLoopResult]: For program point L31-2(lines 31 35) no Hoare annotation was computed. [2020-07-10 15:26:12,027 INFO L264 CegarLoopResult]: At program point L31-3(lines 31 35) the Hoare annotation is: (<= 1 main_~flag~0) [2020-07-10 15:26:12,027 INFO L268 CegarLoopResult]: For program point L31-4(lines 31 35) no Hoare annotation was computed. [2020-07-10 15:26:12,027 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 17 37) no Hoare annotation was computed. [2020-07-10 15:26:12,027 INFO L264 CegarLoopResult]: At program point L23(line 23) the Hoare annotation is: (and (= 0 main_~flag~0) (= 0 |main_~#a~0.offset|)) [2020-07-10 15:26:12,028 INFO L268 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-07-10 15:26:12,028 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 17 37) no Hoare annotation was computed. [2020-07-10 15:26:12,028 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: false [2020-07-10 15:26:12,028 INFO L268 CegarLoopResult]: For program point L34-1(line 34) no Hoare annotation was computed. [2020-07-10 15:26:12,028 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 17 37) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#length)| |#length|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|)) [2020-07-10 15:26:12,028 INFO L268 CegarLoopResult]: For program point L26(lines 26 29) no Hoare annotation was computed. [2020-07-10 15:26:12,028 INFO L268 CegarLoopResult]: For program point L24-2(lines 24 30) no Hoare annotation was computed. [2020-07-10 15:26:12,028 INFO L264 CegarLoopResult]: At program point L24-3(lines 24 30) the Hoare annotation is: (let ((.cse0 (exists ((v_init_~i~0_17 Int)) (and (not (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_17 4) |main_~#a~0.offset|)))) (< v_init_~i~0_17 1000000) (<= 999999 v_init_~i~0_17)))) (.cse1 (= 0 main_~flag~0)) (.cse2 (= 0 |main_~#a~0.offset|))) (or (and .cse0 (<= main_~i~1 999999) (= 0 (select (select |#memory_$Pointer$.offset| |main_~#a~0.base|) |main_~#a~0.offset|)) (= 0 (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) |main_~#a~0.offset|)) .cse1 .cse2) (and .cse0 (= 0 main_~i~1) .cse1 .cse2) (<= 1 main_~flag~0))) [2020-07-10 15:26:12,029 INFO L268 CegarLoopResult]: For program point L24-4(lines 24 30) no Hoare annotation was computed. [2020-07-10 15:26:12,029 INFO L268 CegarLoopResult]: For program point L2-1(line 2) no Hoare annotation was computed. [2020-07-10 15:26:12,029 INFO L268 CegarLoopResult]: For program point L2-3(line 2) no Hoare annotation was computed. [2020-07-10 15:26:12,029 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(line 2) the Hoare annotation is: true [2020-07-10 15:26:12,029 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(line 2) no Hoare annotation was computed. [2020-07-10 15:26:12,029 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2020-07-10 15:26:12,029 INFO L268 CegarLoopResult]: For program point L2(line 2) no Hoare annotation was computed. [2020-07-10 15:26:12,038 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:12,039 WARN L170 areAnnotationChecker]: L2 has no Hoare annotation [2020-07-10 15:26:12,039 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2020-07-10 15:26:12,039 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2020-07-10 15:26:12,039 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-10 15:26:12,039 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:12,039 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:12,040 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:12,041 WARN L170 areAnnotationChecker]: L2 has no Hoare annotation [2020-07-10 15:26:12,041 WARN L170 areAnnotationChecker]: L2 has no Hoare annotation [2020-07-10 15:26:12,041 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2020-07-10 15:26:12,041 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-10 15:26:12,041 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:12,041 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:12,041 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:12,041 WARN L170 areAnnotationChecker]: L2-1 has no Hoare annotation [2020-07-10 15:26:12,041 WARN L170 areAnnotationChecker]: L2-1 has no Hoare annotation [2020-07-10 15:26:12,041 WARN L170 areAnnotationChecker]: L2-3 has no Hoare annotation [2020-07-10 15:26:12,041 WARN L170 areAnnotationChecker]: initEXIT has no Hoare annotation [2020-07-10 15:26:12,042 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2020-07-10 15:26:12,042 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2020-07-10 15:26:12,042 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 15:26:12,042 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:12,042 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2020-07-10 15:26:12,042 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 15:26:12,042 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 15:26:12,042 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-10 15:26:12,042 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-10 15:26:12,042 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-10 15:26:12,043 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 15:26:12,043 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2020-07-10 15:26:12,043 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2020-07-10 15:26:12,043 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-10 15:26:12,043 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 15:26:12,043 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 15:26:12,043 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:12,043 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-10 15:26:12,043 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:12,044 INFO L163 areAnnotationChecker]: CFG has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 15:26:12,053 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,053 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,054 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,054 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,054 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:26:12,054 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,054 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,055 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,055 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,056 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,056 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,056 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,057 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,057 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,058 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:26:12,058 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,058 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,058 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,059 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,059 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,059 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,059 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,059 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,062 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,062 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,063 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,063 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,063 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:26:12,064 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:26:12,064 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,064 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,064 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,064 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:26:12,065 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:26:12,065 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,065 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,066 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,066 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,067 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,067 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,067 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:26:12,067 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:26:12,067 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,068 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,068 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,068 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:26:12,068 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:26:12,068 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,069 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:26:12 BoogieIcfgContainer [2020-07-10 15:26:12,071 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:12,073 INFO L168 Benchmark]: Toolchain (without parser) took 17889.49 ms. Allocated memory was 138.9 MB in the beginning and 380.1 MB in the end (delta: 241.2 MB). Free memory was 103.3 MB in the beginning and 199.5 MB in the end (delta: -96.2 MB). Peak memory consumption was 145.0 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:12,073 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-10 15:26:12,074 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.20 ms. Allocated memory is still 138.9 MB. Free memory was 103.1 MB in the beginning and 92.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:12,075 INFO L168 Benchmark]: Boogie Preprocessor took 145.13 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.4 MB in the beginning and 180.5 MB in the end (delta: -88.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:12,075 INFO L168 Benchmark]: RCFGBuilder took 436.90 ms. Allocated memory is still 202.9 MB. Free memory was 180.5 MB in the beginning and 156.0 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:12,076 INFO L168 Benchmark]: TraceAbstraction took 17031.90 ms. Allocated memory was 202.9 MB in the beginning and 380.1 MB in the end (delta: 177.2 MB). Free memory was 156.0 MB in the beginning and 199.5 MB in the end (delta: -43.5 MB). Peak memory consumption was 133.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:12,078 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.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.20 ms. Allocated memory is still 138.9 MB. Free memory was 103.1 MB in the beginning and 92.4 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 145.13 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.4 MB in the beginning and 180.5 MB in the end (delta: -88.1 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 436.90 ms. Allocated memory is still 202.9 MB. Free memory was 180.5 MB in the beginning and 156.0 MB in the end (delta: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17031.90 ms. Allocated memory was 202.9 MB in the beginning and 380.1 MB in the end (delta: 177.2 MB). Free memory was 156.0 MB in the beginning and 199.5 MB in the end (delta: -43.5 MB). Peak memory consumption was 133.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant Derived loop invariant: 1 <= flag - InvariantResult [Line: 24]: Loop Invariant [2020-07-10 15:26:12,087 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,087 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,088 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,088 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:26:12,088 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,088 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,089 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,089 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,089 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,090 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,090 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,090 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,091 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,091 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:26:12,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,092 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,092 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,093 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,093 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,093 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,093 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((\exists v_init_~i~0_17 : int :: (!(0 == #memory_$Pointer$[a][v_init_~i~0_17 * 4 + a]) && v_init_~i~0_17 < 1000000) && 999999 <= v_init_~i~0_17) && i <= 999999) && 0 == #memory_$Pointer$[a][a]) && 0 == #memory_$Pointer$[a][a]) && 0 == flag) && 0 == a) || ((((\exists v_init_~i~0_17 : int :: (!(0 == #memory_$Pointer$[a][v_init_~i~0_17 * 4 + a]) && v_init_~i~0_17 < 1000000) && 999999 <= v_init_~i~0_17) && 0 == i) && 0 == flag) && 0 == a)) || 1 <= flag - InvariantResult [Line: 12]: Loop Invariant [2020-07-10 15:26:12,094 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,094 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:26:12,095 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:26:12,096 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,096 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,096 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,096 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:26:12,096 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:26:12,097 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,097 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,097 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,097 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,098 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_17,QUANTIFIED] [2020-07-10 15:26:12,098 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,098 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-07-10 15:26:12,099 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:26:12,099 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-07-10 15:26:12,099 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,099 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,099 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,099 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:26:12,100 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:26:12,100 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,100 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((\exists v_init_~i~0_17 : int :: (!(0 == #memory_$Pointer$[a][a + v_init_~i~0_17 * 4]) && i <= v_init_~i~0_17 + 1) && v_init_~i~0_17 < size) && a == a) && \old(size) == size) && a == a) || (((((((i <= 0 && \valid == \old(\valid)) && a == a) && \old(size) == size) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(unknown-#length-unknown) == unknown-#length-unknown) && a == a) && #memory_$Pointer$ == \old(#memory_$Pointer$)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 16.6s, OverallIterations: 11, TraceHistogramMax: 6, AutomataDifference: 7.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 276 SDtfs, 238 SDslu, 777 SDs, 0 SdLazy, 928 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 484 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 47 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 24 PreInvPairs, 37 NumberOfFragments, 186 HoareAnnotationTreeSize, 24 FomulaSimplifications, 417 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 36 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.9s InterpolantComputationTime, 682 NumberOfCodeBlocks, 666 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 662 ConstructedInterpolants, 12 QuantifiedInterpolants, 103213 SizeOfPredicates, 26 NumberOfNonLiveVariables, 1307 ConjunctsInSsa, 78 ConjunctsInUnsatCore, 20 InterpolantComputations, 5 PerfectInterpolantSequences, 207/386 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...