/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-industry-pattern/array_of_struct_ptr_flag_init.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 15:25:52,001 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 15:25:52,004 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 15:25:52,016 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 15:25:52,016 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 15:25:52,017 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 15:25:52,019 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 15:25:52,021 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 15:25:52,022 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 15:25:52,023 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 15:25:52,024 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 15:25:52,025 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 15:25:52,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 15:25:52,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 15:25:52,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 15:25:52,029 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 15:25:52,030 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 15:25:52,031 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 15:25:52,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 15:25:52,035 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 15:25:52,036 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 15:25:52,038 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 15:25:52,039 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 15:25:52,040 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 15:25:52,042 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 15:25:52,043 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 15:25:52,043 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 15:25:52,044 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 15:25:52,044 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 15:25:52,045 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 15:25:52,046 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 15:25:52,047 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 15:25:52,048 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 15:25:52,049 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 15:25:52,051 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 15:25:52,051 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 15:25:52,052 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 15:25:52,052 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 15:25:52,052 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 15:25:52,053 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 15:25:52,058 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 15:25:52,058 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,086 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 15:25:52,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 15:25:52,088 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 15:25:52,088 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 15:25:52,088 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 15:25:52,089 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 15:25:52,089 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 15:25:52,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 15:25:52,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 15:25:52,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 15:25:52,090 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 15:25:52,091 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 15:25:52,091 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 15:25:52,091 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 15:25:52,091 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 15:25:52,092 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 15:25:52,092 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 15:25:52,092 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 15:25:52,092 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 15:25:52,092 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 15:25:52,093 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 15:25:52,093 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 15:25:52,093 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 15:25:52,093 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 15:25:52,094 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 15:25:52,094 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 15:25:52,094 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 15:25:52,094 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 15:25:52,094 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 15:25:52,095 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 15:25:52,394 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 15:25:52,416 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 15:25:52,420 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 15:25:52,422 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 15:25:52,422 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 15:25:52,425 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i [2020-07-10 15:25:52,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c1bd5959/4402c1bf4bf6467c9c4ce8678d1a927b/FLAGfcd67854d [2020-07-10 15:25:52,976 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 15:25:52,976 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_flag_init.i [2020-07-10 15:25:52,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c1bd5959/4402c1bf4bf6467c9c4ce8678d1a927b/FLAGfcd67854d [2020-07-10 15:25:53,331 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c1bd5959/4402c1bf4bf6467c9c4ce8678d1a927b [2020-07-10 15:25:53,339 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 15:25:53,342 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 15:25:53,343 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 15:25:53,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 15:25:53,347 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 15:25:53,348 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:25:53" (1/1) ... [2020-07-10 15:25:53,351 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1af6619f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:53, skipping insertion in model container [2020-07-10 15:25:53,352 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:25:53" (1/1) ... [2020-07-10 15:25:53,359 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 15:25:53,382 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 15:25:53,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:25:53,587 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 15:25:53,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 15:25:53,626 INFO L208 MainTranslator]: Completed translation [2020-07-10 15:25:53,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:53 WrapperNode [2020-07-10 15:25:53,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 15:25:53,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 15:25:53,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 15:25:53,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 15:25:53,720 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:53" (1/1) ... [2020-07-10 15:25:53,720 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:53" (1/1) ... [2020-07-10 15:25:53,731 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:53" (1/1) ... [2020-07-10 15:25:53,731 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:53" (1/1) ... [2020-07-10 15:25:53,757 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:53" (1/1) ... [2020-07-10 15:25:53,766 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:53" (1/1) ... [2020-07-10 15:25:53,768 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:53" (1/1) ... [2020-07-10 15:25:53,770 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 15:25:53,776 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 15:25:53,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 15:25:53,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 15:25:53,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:53" (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:53,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 15:25:53,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 15:25:53,841 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 15:25:53,841 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-07-10 15:25:53,841 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 15:25:53,841 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-07-10 15:25:53,841 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 15:25:53,842 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 15:25:53,842 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-07-10 15:25:53,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-10 15:25:53,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-10 15:25:53,842 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 15:25:53,842 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 15:25:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-10 15:25:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 15:25:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 15:25:53,843 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 15:25:54,171 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 15:25:54,172 INFO L295 CfgBuilder]: Removed 3 assume(true) statements. [2020-07-10 15:25:54,175 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:25:54 BoogieIcfgContainer [2020-07-10 15:25:54,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 15:25:54,177 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 15:25:54,177 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 15:25:54,180 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 15:25:54,181 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:25:53" (1/3) ... [2020-07-10 15:25:54,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d93c84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:25:54, skipping insertion in model container [2020-07-10 15:25:54,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:25:53" (2/3) ... [2020-07-10 15:25:54,182 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d93c84b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:25:54, skipping insertion in model container [2020-07-10 15:25:54,182 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:25:54" (3/3) ... [2020-07-10 15:25:54,184 INFO L109 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_flag_init.i [2020-07-10 15:25:54,195 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 15:25:54,202 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 15:25:54,216 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 15:25:54,240 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 15:25:54,240 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 15:25:54,240 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 15:25:54,240 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 15:25:54,240 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 15:25:54,240 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 15:25:54,241 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 15:25:54,241 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 15:25:54,260 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2020-07-10 15:25:54,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:25:54,265 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:54,266 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:54,266 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:54,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:54,272 INFO L82 PathProgramCache]: Analyzing trace with hash -850547107, now seen corresponding path program 1 times [2020-07-10 15:25:54,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:54,282 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353691084] [2020-07-10 15:25:54,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:54,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:54,513 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:54,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 15:25:54,515 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {36#true} {36#true} #76#return; {36#true} is VALID [2020-07-10 15:25:54,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:54,556 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:54,556 INFO L280 TraceCheckUtils]: 1: Hoare triple {36#true} assume !(~i~0 < ~size); {36#true} is VALID [2020-07-10 15:25:54,557 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 15:25:54,557 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #80#return; {36#true} is VALID [2020-07-10 15:25:54,559 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:54,560 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:54,560 INFO L280 TraceCheckUtils]: 2: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 15:25:54,561 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {36#true} {36#true} #76#return; {36#true} is VALID [2020-07-10 15:25:54,561 INFO L263 TraceCheckUtils]: 4: Hoare triple {36#true} call #t~ret6 := main(); {36#true} is VALID [2020-07-10 15:25:54,562 INFO L280 TraceCheckUtils]: 5: Hoare triple {36#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {36#true} is VALID [2020-07-10 15:25:54,565 INFO L263 TraceCheckUtils]: 6: Hoare triple {36#true} call init(~#a~0.base, ~#a~0.offset, 100000); {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:54,566 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:54,566 INFO L280 TraceCheckUtils]: 8: Hoare triple {36#true} assume !(~i~0 < ~size); {36#true} is VALID [2020-07-10 15:25:54,567 INFO L280 TraceCheckUtils]: 9: Hoare triple {36#true} assume true; {36#true} is VALID [2020-07-10 15:25:54,568 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {36#true} {36#true} #80#return; {36#true} is VALID [2020-07-10 15:25:54,569 INFO L280 TraceCheckUtils]: 11: Hoare triple {36#true} ~i~1 := 0; {36#true} is VALID [2020-07-10 15:25:54,571 INFO L280 TraceCheckUtils]: 12: Hoare triple {36#true} assume !true; {37#false} is VALID [2020-07-10 15:25:54,572 INFO L280 TraceCheckUtils]: 13: Hoare triple {37#false} ~i~1 := 0; {37#false} is VALID [2020-07-10 15:25:54,572 INFO L280 TraceCheckUtils]: 14: Hoare triple {37#false} assume !!(~i~1 < 100000); {37#false} is VALID [2020-07-10 15:25:54,573 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:54,573 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:54,574 INFO L280 TraceCheckUtils]: 17: Hoare triple {37#false} ~cond := #in~cond; {37#false} is VALID [2020-07-10 15:25:54,574 INFO L280 TraceCheckUtils]: 18: Hoare triple {37#false} assume 0 == ~cond; {37#false} is VALID [2020-07-10 15:25:54,577 INFO L280 TraceCheckUtils]: 19: Hoare triple {37#false} assume !false; {37#false} is VALID [2020-07-10 15:25:54,581 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:54,582 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353691084] [2020-07-10 15:25:54,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:54,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 15:25:54,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186325104] [2020-07-10 15:25:54,595 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-07-10 15:25:54,603 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:54,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 15:25:54,666 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:54,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 15:25:54,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:54,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 15:25:54,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 15:25:54,681 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 4 states. [2020-07-10 15:25:55,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:55,055 INFO L93 Difference]: Finished difference Result 59 states and 76 transitions. [2020-07-10 15:25:55,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:25:55,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2020-07-10 15:25:55,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:55,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:25:55,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2020-07-10 15:25:55,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 15:25:55,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 76 transitions. [2020-07-10 15:25:55,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 76 transitions. [2020-07-10 15:25:55,213 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,226 INFO L225 Difference]: With dead ends: 59 [2020-07-10 15:25:55,226 INFO L226 Difference]: Without dead ends: 31 [2020-07-10 15:25:55,232 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:55,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-10 15:25:55,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2020-07-10 15:25:55,289 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:55,290 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 28 states. [2020-07-10 15:25:55,291 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 28 states. [2020-07-10 15:25:55,291 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 28 states. [2020-07-10 15:25:55,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:55,296 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-10 15:25:55,296 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2020-07-10 15:25:55,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:55,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:55,298 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 31 states. [2020-07-10 15:25:55,298 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 31 states. [2020-07-10 15:25:55,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:55,302 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-10 15:25:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2020-07-10 15:25:55,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:55,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:55,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:55,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:55,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-10 15:25:55,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2020-07-10 15:25:55,309 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 20 [2020-07-10 15:25:55,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:55,309 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2020-07-10 15:25:55,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 15:25:55,310 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2020-07-10 15:25:55,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 15:25:55,311 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:55,311 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,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 15:25:55,312 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:55,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:55,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1453375688, now seen corresponding path program 1 times [2020-07-10 15:25:55,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:55,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536071152] [2020-07-10 15:25:55,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:55,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:55,460 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:55,461 INFO L280 TraceCheckUtils]: 1: Hoare triple {228#true} assume true; {228#true} is VALID [2020-07-10 15:25:55,461 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {228#true} {228#true} #76#return; {228#true} is VALID [2020-07-10 15:25:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:55,610 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 (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:25:55,612 INFO L280 TraceCheckUtils]: 1: Hoare triple {239#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} assume !(~i~0 < ~size); {240#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:25:55,613 INFO L280 TraceCheckUtils]: 2: Hoare triple {240#(not (= |init_#in~size| 100000))} assume true; {240#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:25:55,614 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {240#(not (= |init_#in~size| 100000))} {228#true} #80#return; {229#false} is VALID [2020-07-10 15:25:55,620 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:55,621 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:55,621 INFO L280 TraceCheckUtils]: 2: Hoare triple {228#true} assume true; {228#true} is VALID [2020-07-10 15:25:55,621 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {228#true} {228#true} #76#return; {228#true} is VALID [2020-07-10 15:25:55,622 INFO L263 TraceCheckUtils]: 4: Hoare triple {228#true} call #t~ret6 := main(); {228#true} is VALID [2020-07-10 15:25:55,622 INFO L280 TraceCheckUtils]: 5: Hoare triple {228#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {228#true} is VALID [2020-07-10 15:25:55,624 INFO L263 TraceCheckUtils]: 6: Hoare triple {228#true} call init(~#a~0.base, ~#a~0.offset, 100000); {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:55,626 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 (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:25:55,628 INFO L280 TraceCheckUtils]: 8: Hoare triple {239#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} assume !(~i~0 < ~size); {240#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:25:55,631 INFO L280 TraceCheckUtils]: 9: Hoare triple {240#(not (= |init_#in~size| 100000))} assume true; {240#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:25:55,633 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {240#(not (= |init_#in~size| 100000))} {228#true} #80#return; {229#false} is VALID [2020-07-10 15:25:55,633 INFO L280 TraceCheckUtils]: 11: Hoare triple {229#false} ~i~1 := 0; {229#false} is VALID [2020-07-10 15:25:55,633 INFO L280 TraceCheckUtils]: 12: Hoare triple {229#false} assume !(~i~1 < 100000); {229#false} is VALID [2020-07-10 15:25:55,634 INFO L280 TraceCheckUtils]: 13: Hoare triple {229#false} ~i~1 := 0; {229#false} is VALID [2020-07-10 15:25:55,634 INFO L280 TraceCheckUtils]: 14: Hoare triple {229#false} assume !!(~i~1 < 100000); {229#false} is VALID [2020-07-10 15:25:55,635 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:55,635 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:55,640 INFO L280 TraceCheckUtils]: 17: Hoare triple {229#false} ~cond := #in~cond; {229#false} is VALID [2020-07-10 15:25:55,641 INFO L280 TraceCheckUtils]: 18: Hoare triple {229#false} assume 0 == ~cond; {229#false} is VALID [2020-07-10 15:25:55,641 INFO L280 TraceCheckUtils]: 19: Hoare triple {229#false} assume !false; {229#false} is VALID [2020-07-10 15:25:55,643 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,643 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536071152] [2020-07-10 15:25:55,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 15:25:55,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 15:25:55,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27733181] [2020-07-10 15:25:55,648 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-10 15:25:55,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:55,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 15:25:55,676 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,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 15:25:55,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:55,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 15:25:55,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-10 15:25:55,678 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 6 states. [2020-07-10 15:25:56,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,089 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2020-07-10 15:25:56,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 15:25:56,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2020-07-10 15:25:56,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:56,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:25:56,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2020-07-10 15:25:56,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 15:25:56,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2020-07-10 15:25:56,108 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2020-07-10 15:25:56,213 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,215 INFO L225 Difference]: With dead ends: 48 [2020-07-10 15:25:56,216 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 15:25:56,217 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,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 15:25:56,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2020-07-10 15:25:56,246 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:56,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 29 states. [2020-07-10 15:25:56,246 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 29 states. [2020-07-10 15:25:56,247 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 29 states. [2020-07-10 15:25:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,251 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-10 15:25:56,252 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-10 15:25:56,253 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:56,253 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:56,253 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand 30 states. [2020-07-10 15:25:56,253 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 30 states. [2020-07-10 15:25:56,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,259 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-10 15:25:56,262 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-10 15:25:56,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:56,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:56,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:56,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:56,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2020-07-10 15:25:56,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2020-07-10 15:25:56,269 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 20 [2020-07-10 15:25:56,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:56,269 INFO L479 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2020-07-10 15:25:56,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 15:25:56,270 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2020-07-10 15:25:56,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-10 15:25:56,273 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:56,274 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,274 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 15:25:56,274 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:56,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:56,275 INFO L82 PathProgramCache]: Analyzing trace with hash -169907062, now seen corresponding path program 1 times [2020-07-10 15:25:56,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:56,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381312882] [2020-07-10 15:25:56,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,373 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,374 INFO L280 TraceCheckUtils]: 1: Hoare triple {415#true} assume true; {415#true} is VALID [2020-07-10 15:25:56,374 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {415#true} {415#true} #76#return; {415#true} is VALID [2020-07-10 15:25:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,565 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 (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:25:56,567 INFO L280 TraceCheckUtils]: 1: Hoare triple {428#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |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); {428#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:25:56,569 INFO L280 TraceCheckUtils]: 2: Hoare triple {428#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {429#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:25:56,570 INFO L280 TraceCheckUtils]: 3: Hoare triple {429#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} assume !(~i~0 < ~size); {430#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:25:56,571 INFO L280 TraceCheckUtils]: 4: Hoare triple {430#(not (= |init_#in~size| 100000))} assume true; {430#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:25:56,574 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {430#(not (= |init_#in~size| 100000))} {415#true} #80#return; {416#false} is VALID [2020-07-10 15:25:56,579 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:56,580 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:56,580 INFO L280 TraceCheckUtils]: 2: Hoare triple {415#true} assume true; {415#true} is VALID [2020-07-10 15:25:56,580 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {415#true} {415#true} #76#return; {415#true} is VALID [2020-07-10 15:25:56,580 INFO L263 TraceCheckUtils]: 4: Hoare triple {415#true} call #t~ret6 := main(); {415#true} is VALID [2020-07-10 15:25:56,581 INFO L280 TraceCheckUtils]: 5: Hoare triple {415#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {415#true} is VALID [2020-07-10 15:25:56,585 INFO L263 TraceCheckUtils]: 6: Hoare triple {415#true} call init(~#a~0.base, ~#a~0.offset, 100000); {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:56,594 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 (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:25:56,595 INFO L280 TraceCheckUtils]: 8: Hoare triple {428#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |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); {428#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:25:56,597 INFO L280 TraceCheckUtils]: 9: Hoare triple {428#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {429#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:25:56,598 INFO L280 TraceCheckUtils]: 10: Hoare triple {429#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} assume !(~i~0 < ~size); {430#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:25:56,604 INFO L280 TraceCheckUtils]: 11: Hoare triple {430#(not (= |init_#in~size| 100000))} assume true; {430#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:25:56,605 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {430#(not (= |init_#in~size| 100000))} {415#true} #80#return; {416#false} is VALID [2020-07-10 15:25:56,606 INFO L280 TraceCheckUtils]: 13: Hoare triple {416#false} ~i~1 := 0; {416#false} is VALID [2020-07-10 15:25:56,607 INFO L280 TraceCheckUtils]: 14: Hoare triple {416#false} assume !(~i~1 < 100000); {416#false} is VALID [2020-07-10 15:25:56,608 INFO L280 TraceCheckUtils]: 15: Hoare triple {416#false} ~i~1 := 0; {416#false} is VALID [2020-07-10 15:25:56,609 INFO L280 TraceCheckUtils]: 16: Hoare triple {416#false} assume !!(~i~1 < 100000); {416#false} is VALID [2020-07-10 15:25:56,610 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:56,612 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:56,613 INFO L280 TraceCheckUtils]: 19: Hoare triple {416#false} ~cond := #in~cond; {416#false} is VALID [2020-07-10 15:25:56,614 INFO L280 TraceCheckUtils]: 20: Hoare triple {416#false} assume 0 == ~cond; {416#false} is VALID [2020-07-10 15:25:56,614 INFO L280 TraceCheckUtils]: 21: Hoare triple {416#false} assume !false; {416#false} is VALID [2020-07-10 15:25:56,616 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:56,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381312882] [2020-07-10 15:25:56,616 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434693629] [2020-07-10 15:25:56,617 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:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,668 INFO L264 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-10 15:25:56,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:56,689 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:56,762 INFO L263 TraceCheckUtils]: 0: Hoare triple {415#true} call ULTIMATE.init(); {415#true} is VALID [2020-07-10 15:25:56,762 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:56,763 INFO L280 TraceCheckUtils]: 2: Hoare triple {415#true} assume true; {415#true} is VALID [2020-07-10 15:25:56,763 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {415#true} {415#true} #76#return; {415#true} is VALID [2020-07-10 15:25:56,764 INFO L263 TraceCheckUtils]: 4: Hoare triple {415#true} call #t~ret6 := main(); {415#true} is VALID [2020-07-10 15:25:56,764 INFO L280 TraceCheckUtils]: 5: Hoare triple {415#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {415#true} is VALID [2020-07-10 15:25:56,764 INFO L263 TraceCheckUtils]: 6: Hoare triple {415#true} call init(~#a~0.base, ~#a~0.offset, 100000); {415#true} is VALID [2020-07-10 15:25:56,764 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:56,765 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:56,765 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:56,765 INFO L280 TraceCheckUtils]: 10: Hoare triple {415#true} assume !(~i~0 < ~size); {415#true} is VALID [2020-07-10 15:25:56,765 INFO L280 TraceCheckUtils]: 11: Hoare triple {415#true} assume true; {415#true} is VALID [2020-07-10 15:25:56,766 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {415#true} {415#true} #80#return; {415#true} is VALID [2020-07-10 15:25:56,770 INFO L280 TraceCheckUtils]: 13: Hoare triple {415#true} ~i~1 := 0; {473#(<= main_~i~1 0)} is VALID [2020-07-10 15:25:56,771 INFO L280 TraceCheckUtils]: 14: Hoare triple {473#(<= main_~i~1 0)} assume !(~i~1 < 100000); {416#false} is VALID [2020-07-10 15:25:56,771 INFO L280 TraceCheckUtils]: 15: Hoare triple {416#false} ~i~1 := 0; {416#false} is VALID [2020-07-10 15:25:56,771 INFO L280 TraceCheckUtils]: 16: Hoare triple {416#false} assume !!(~i~1 < 100000); {416#false} is VALID [2020-07-10 15:25:56,772 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:56,772 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:56,772 INFO L280 TraceCheckUtils]: 19: Hoare triple {416#false} ~cond := #in~cond; {416#false} is VALID [2020-07-10 15:25:56,773 INFO L280 TraceCheckUtils]: 20: Hoare triple {416#false} assume 0 == ~cond; {416#false} is VALID [2020-07-10 15:25:56,773 INFO L280 TraceCheckUtils]: 21: Hoare triple {416#false} assume !false; {416#false} is VALID [2020-07-10 15:25:56,774 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:56,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:25:56,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2020-07-10 15:25:56,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685248268] [2020-07-10 15:25:56,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:25:56,779 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:56,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:25:56,808 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:56,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:25:56,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:56,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:25:56,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-07-10 15:25:56,809 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2020-07-10 15:25:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:56,942 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2020-07-10 15:25:56,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:25:56,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2020-07-10 15:25:56,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:56,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:56,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2020-07-10 15:25:56,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:56,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 57 transitions. [2020-07-10 15:25:56,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 57 transitions. [2020-07-10 15:25:57,017 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,020 INFO L225 Difference]: With dead ends: 49 [2020-07-10 15:25:57,020 INFO L226 Difference]: Without dead ends: 37 [2020-07-10 15:25:57,021 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,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-10 15:25:57,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2020-07-10 15:25:57,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:57,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 30 states. [2020-07-10 15:25:57,043 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 30 states. [2020-07-10 15:25:57,043 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 30 states. [2020-07-10 15:25:57,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,051 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2020-07-10 15:25:57,051 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2020-07-10 15:25:57,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:57,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:57,052 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 37 states. [2020-07-10 15:25:57,053 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 37 states. [2020-07-10 15:25:57,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,056 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2020-07-10 15:25:57,056 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2020-07-10 15:25:57,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:57,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:57,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:57,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:57,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 15:25:57,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-07-10 15:25:57,059 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2020-07-10 15:25:57,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:57,059 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-07-10 15:25:57,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:25:57,059 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-07-10 15:25:57,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:25:57,060 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:57,061 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,275 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,275 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:57,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:57,276 INFO L82 PathProgramCache]: Analyzing trace with hash -203072550, now seen corresponding path program 1 times [2020-07-10 15:25:57,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:57,277 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553521423] [2020-07-10 15:25:57,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:57,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,379 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,379 INFO L280 TraceCheckUtils]: 1: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-10 15:25:57,379 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {681#true} {681#true} #76#return; {681#true} is VALID [2020-07-10 15:25:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,418 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,419 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,419 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,419 INFO L280 TraceCheckUtils]: 3: Hoare triple {681#true} assume !(~i~0 < ~size); {681#true} is VALID [2020-07-10 15:25:57,419 INFO L280 TraceCheckUtils]: 4: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-10 15:25:57,420 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {681#true} {681#true} #80#return; {681#true} is VALID [2020-07-10 15:25:57,421 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,421 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,422 INFO L280 TraceCheckUtils]: 2: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-10 15:25:57,422 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {681#true} {681#true} #76#return; {681#true} is VALID [2020-07-10 15:25:57,422 INFO L263 TraceCheckUtils]: 4: Hoare triple {681#true} call #t~ret6 := main(); {681#true} is VALID [2020-07-10 15:25:57,422 INFO L280 TraceCheckUtils]: 5: Hoare triple {681#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {681#true} is VALID [2020-07-10 15:25:57,435 INFO L263 TraceCheckUtils]: 6: Hoare triple {681#true} call init(~#a~0.base, ~#a~0.offset, 100000); {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,435 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,436 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,436 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,436 INFO L280 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(~i~0 < ~size); {681#true} is VALID [2020-07-10 15:25:57,437 INFO L280 TraceCheckUtils]: 11: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-10 15:25:57,437 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {681#true} {681#true} #80#return; {681#true} is VALID [2020-07-10 15:25:57,445 INFO L280 TraceCheckUtils]: 13: Hoare triple {681#true} ~i~1 := 0; {692#(= 0 main_~i~1)} is VALID [2020-07-10 15:25:57,446 INFO L280 TraceCheckUtils]: 14: Hoare triple {692#(= 0 main_~i~1)} assume !!(~i~1 < 100000);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,446 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,447 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,448 INFO L280 TraceCheckUtils]: 17: Hoare triple {693#(<= main_~i~1 1)} assume !(~i~1 < 100000); {682#false} is VALID [2020-07-10 15:25:57,448 INFO L280 TraceCheckUtils]: 18: Hoare triple {682#false} ~i~1 := 0; {682#false} is VALID [2020-07-10 15:25:57,448 INFO L280 TraceCheckUtils]: 19: Hoare triple {682#false} assume !!(~i~1 < 100000); {682#false} is VALID [2020-07-10 15:25:57,449 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,449 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,449 INFO L280 TraceCheckUtils]: 22: Hoare triple {682#false} ~cond := #in~cond; {682#false} is VALID [2020-07-10 15:25:57,449 INFO L280 TraceCheckUtils]: 23: Hoare triple {682#false} assume 0 == ~cond; {682#false} is VALID [2020-07-10 15:25:57,450 INFO L280 TraceCheckUtils]: 24: Hoare triple {682#false} assume !false; {682#false} is VALID [2020-07-10 15:25:57,451 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,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553521423] [2020-07-10 15:25:57,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [668982628] [2020-07-10 15:25:57,452 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,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,493 INFO L264 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-10 15:25:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:57,504 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:57,553 INFO L263 TraceCheckUtils]: 0: Hoare triple {681#true} call ULTIMATE.init(); {681#true} is VALID [2020-07-10 15:25:57,555 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,555 INFO L280 TraceCheckUtils]: 2: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-10 15:25:57,556 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {681#true} {681#true} #76#return; {681#true} is VALID [2020-07-10 15:25:57,556 INFO L263 TraceCheckUtils]: 4: Hoare triple {681#true} call #t~ret6 := main(); {681#true} is VALID [2020-07-10 15:25:57,556 INFO L280 TraceCheckUtils]: 5: Hoare triple {681#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {681#true} is VALID [2020-07-10 15:25:57,557 INFO L263 TraceCheckUtils]: 6: Hoare triple {681#true} call init(~#a~0.base, ~#a~0.offset, 100000); {681#true} is VALID [2020-07-10 15:25:57,557 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,557 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,557 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,558 INFO L280 TraceCheckUtils]: 10: Hoare triple {681#true} assume !(~i~0 < ~size); {681#true} is VALID [2020-07-10 15:25:57,558 INFO L280 TraceCheckUtils]: 11: Hoare triple {681#true} assume true; {681#true} is VALID [2020-07-10 15:25:57,560 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {681#true} {681#true} #80#return; {681#true} is VALID [2020-07-10 15:25:57,561 INFO L280 TraceCheckUtils]: 13: Hoare triple {681#true} ~i~1 := 0; {681#true} is VALID [2020-07-10 15:25:57,561 INFO L280 TraceCheckUtils]: 14: Hoare triple {681#true} assume !!(~i~1 < 100000);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,564 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,565 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,566 INFO L280 TraceCheckUtils]: 17: Hoare triple {744#(<= 1 main_~flag~0)} assume !(~i~1 < 100000); {744#(<= 1 main_~flag~0)} is VALID [2020-07-10 15:25:57,566 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,567 INFO L280 TraceCheckUtils]: 19: Hoare triple {744#(<= 1 main_~flag~0)} assume !!(~i~1 < 100000); {744#(<= 1 main_~flag~0)} is VALID [2020-07-10 15:25:57,568 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,568 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,569 INFO L280 TraceCheckUtils]: 22: Hoare triple {682#false} ~cond := #in~cond; {682#false} is VALID [2020-07-10 15:25:57,569 INFO L280 TraceCheckUtils]: 23: Hoare triple {682#false} assume 0 == ~cond; {682#false} is VALID [2020-07-10 15:25:57,569 INFO L280 TraceCheckUtils]: 24: Hoare triple {682#false} assume !false; {682#false} is VALID [2020-07-10 15:25:57,570 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,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:25:57,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2020-07-10 15:25:57,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416365584] [2020-07-10 15:25:57,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:25:57,571 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:57,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:25:57,621 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,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:25:57,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:57,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:25:57,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-10 15:25:57,636 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 3 states. [2020-07-10 15:25:57,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,732 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2020-07-10 15:25:57,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:25:57,732 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-07-10 15:25:57,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:57,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:57,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2020-07-10 15:25:57,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:25:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2020-07-10 15:25:57,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2020-07-10 15:25:57,805 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:57,806 INFO L225 Difference]: With dead ends: 48 [2020-07-10 15:25:57,806 INFO L226 Difference]: Without dead ends: 30 [2020-07-10 15:25:57,807 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:57,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-10 15:25:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2020-07-10 15:25:57,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:57,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 30 states. [2020-07-10 15:25:57,830 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 15:25:57,830 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 15:25:57,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,832 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-10 15:25:57,832 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:25:57,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:57,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:57,833 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 30 states. [2020-07-10 15:25:57,833 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 30 states. [2020-07-10 15:25:57,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:57,834 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-10 15:25:57,835 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:25:57,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:57,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:57,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:57,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 15:25:57,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2020-07-10 15:25:57,837 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 25 [2020-07-10 15:25:57,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:57,838 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2020-07-10 15:25:57,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:25:57,838 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2020-07-10 15:25:57,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-10 15:25:57,839 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:57,839 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 15:25:58,048 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,048 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:58,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:58,049 INFO L82 PathProgramCache]: Analyzing trace with hash -596099560, now seen corresponding path program 1 times [2020-07-10 15:25:58,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:58,050 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63834245] [2020-07-10 15:25:58,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:58,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,154 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,155 INFO L280 TraceCheckUtils]: 1: Hoare triple {940#true} assume true; {940#true} is VALID [2020-07-10 15:25:58,155 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {940#true} {940#true} #76#return; {940#true} is VALID [2020-07-10 15:25:58,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,183 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,183 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,183 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,183 INFO L280 TraceCheckUtils]: 3: Hoare triple {940#true} assume !(~i~0 < ~size); {940#true} is VALID [2020-07-10 15:25:58,184 INFO L280 TraceCheckUtils]: 4: Hoare triple {940#true} assume true; {940#true} is VALID [2020-07-10 15:25:58,184 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {940#true} {940#true} #80#return; {940#true} is VALID [2020-07-10 15:25:58,185 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,185 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,185 INFO L280 TraceCheckUtils]: 2: Hoare triple {940#true} assume true; {940#true} is VALID [2020-07-10 15:25:58,185 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {940#true} {940#true} #76#return; {940#true} is VALID [2020-07-10 15:25:58,186 INFO L263 TraceCheckUtils]: 4: Hoare triple {940#true} call #t~ret6 := main(); {940#true} is VALID [2020-07-10 15:25:58,186 INFO L280 TraceCheckUtils]: 5: Hoare triple {940#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {940#true} is VALID [2020-07-10 15:25:58,187 INFO L263 TraceCheckUtils]: 6: Hoare triple {940#true} call init(~#a~0.base, ~#a~0.offset, 100000); {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,188 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,188 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,188 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,188 INFO L280 TraceCheckUtils]: 10: Hoare triple {940#true} assume !(~i~0 < ~size); {940#true} is VALID [2020-07-10 15:25:58,189 INFO L280 TraceCheckUtils]: 11: Hoare triple {940#true} assume true; {940#true} is VALID [2020-07-10 15:25:58,189 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {940#true} {940#true} #80#return; {940#true} is VALID [2020-07-10 15:25:58,190 INFO L280 TraceCheckUtils]: 13: Hoare triple {940#true} ~i~1 := 0; {951#(= 0 main_~i~1)} is VALID [2020-07-10 15:25:58,190 INFO L280 TraceCheckUtils]: 14: Hoare triple {951#(= 0 main_~i~1)} assume !!(~i~1 < 100000);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,191 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,192 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,193 INFO L280 TraceCheckUtils]: 17: Hoare triple {952#(<= main_~i~1 1)} assume !(~i~1 < 100000); {941#false} is VALID [2020-07-10 15:25:58,193 INFO L280 TraceCheckUtils]: 18: Hoare triple {941#false} ~i~1 := 0; {941#false} is VALID [2020-07-10 15:25:58,193 INFO L280 TraceCheckUtils]: 19: Hoare triple {941#false} assume !!(~i~1 < 100000); {941#false} is VALID [2020-07-10 15:25:58,193 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,194 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,194 INFO L280 TraceCheckUtils]: 22: Hoare triple {941#false} ~cond := #in~cond; {941#false} is VALID [2020-07-10 15:25:58,194 INFO L280 TraceCheckUtils]: 23: Hoare triple {941#false} assume 0 == ~cond; {941#false} is VALID [2020-07-10 15:25:58,194 INFO L280 TraceCheckUtils]: 24: Hoare triple {941#false} assume !false; {941#false} is VALID [2020-07-10 15:25:58,195 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,196 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63834245] [2020-07-10 15:25:58,196 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1622884456] [2020-07-10 15:25:58,196 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,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,237 INFO L264 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-10 15:25:58,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:58,247 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:58,335 INFO L263 TraceCheckUtils]: 0: Hoare triple {940#true} call ULTIMATE.init(); {940#true} is VALID [2020-07-10 15:25:58,336 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,336 INFO L280 TraceCheckUtils]: 2: Hoare triple {940#true} assume true; {940#true} is VALID [2020-07-10 15:25:58,336 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {940#true} {940#true} #76#return; {940#true} is VALID [2020-07-10 15:25:58,336 INFO L263 TraceCheckUtils]: 4: Hoare triple {940#true} call #t~ret6 := main(); {940#true} is VALID [2020-07-10 15:25:58,337 INFO L280 TraceCheckUtils]: 5: Hoare triple {940#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {940#true} is VALID [2020-07-10 15:25:58,337 INFO L263 TraceCheckUtils]: 6: Hoare triple {940#true} call init(~#a~0.base, ~#a~0.offset, 100000); {940#true} is VALID [2020-07-10 15:25:58,338 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,341 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,342 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,343 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,343 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,344 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {990#(<= |init_#in~size| 1)} {940#true} #80#return; {941#false} is VALID [2020-07-10 15:25:58,344 INFO L280 TraceCheckUtils]: 13: Hoare triple {941#false} ~i~1 := 0; {941#false} is VALID [2020-07-10 15:25:58,345 INFO L280 TraceCheckUtils]: 14: Hoare triple {941#false} assume !!(~i~1 < 100000);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,345 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,345 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,345 INFO L280 TraceCheckUtils]: 17: Hoare triple {941#false} assume !(~i~1 < 100000); {941#false} is VALID [2020-07-10 15:25:58,345 INFO L280 TraceCheckUtils]: 18: Hoare triple {941#false} ~i~1 := 0; {941#false} is VALID [2020-07-10 15:25:58,345 INFO L280 TraceCheckUtils]: 19: Hoare triple {941#false} assume !!(~i~1 < 100000); {941#false} is VALID [2020-07-10 15:25:58,346 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,346 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,346 INFO L280 TraceCheckUtils]: 22: Hoare triple {941#false} ~cond := #in~cond; {941#false} is VALID [2020-07-10 15:25:58,346 INFO L280 TraceCheckUtils]: 23: Hoare triple {941#false} assume 0 == ~cond; {941#false} is VALID [2020-07-10 15:25:58,347 INFO L280 TraceCheckUtils]: 24: Hoare triple {941#false} assume !false; {941#false} is VALID [2020-07-10 15:25:58,347 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,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:25:58,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2020-07-10 15:25:58,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544908742] [2020-07-10 15:25:58,348 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-10 15:25:58,349 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:58,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 15:25:58,401 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,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 15:25:58,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:58,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 15:25:58,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-10 15:25:58,402 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 9 states. [2020-07-10 15:25:59,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:59,013 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2020-07-10 15:25:59,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-10 15:25:59,013 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2020-07-10 15:25:59,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:25:59,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:25:59,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2020-07-10 15:25:59,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 15:25:59,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 77 transitions. [2020-07-10 15:25:59,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 77 transitions. [2020-07-10 15:25:59,129 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,132 INFO L225 Difference]: With dead ends: 67 [2020-07-10 15:25:59,132 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 15:25:59,132 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,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 15:25:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2020-07-10 15:25:59,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:25:59,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 35 states. [2020-07-10 15:25:59,156 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 35 states. [2020-07-10 15:25:59,156 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 35 states. [2020-07-10 15:25:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:59,161 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2020-07-10 15:25:59,161 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2020-07-10 15:25:59,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:59,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:59,162 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 48 states. [2020-07-10 15:25:59,163 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 48 states. [2020-07-10 15:25:59,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:25:59,167 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2020-07-10 15:25:59,167 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2020-07-10 15:25:59,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:25:59,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:25:59,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:25:59,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:25:59,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-07-10 15:25:59,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2020-07-10 15:25:59,174 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 25 [2020-07-10 15:25:59,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:25:59,175 INFO L479 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2020-07-10 15:25:59,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 15:25:59,175 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2020-07-10 15:25:59,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 15:25:59,176 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:25:59,176 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,376 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,377 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:25:59,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:25:59,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1096950668, now seen corresponding path program 2 times [2020-07-10 15:25:59,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:25:59,378 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027399645] [2020-07-10 15:25:59,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:25:59,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:59,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:59,448 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,448 INFO L280 TraceCheckUtils]: 1: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-10 15:25:59,448 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1276#true} {1276#true} #76#return; {1276#true} is VALID [2020-07-10 15:25:59,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:59,608 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 (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:25:59,610 INFO L280 TraceCheckUtils]: 1: Hoare triple {1291#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |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); {1291#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:25:59,611 INFO L280 TraceCheckUtils]: 2: Hoare triple {1291#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1292#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:25:59,612 INFO L280 TraceCheckUtils]: 3: Hoare triple {1292#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {1292#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:25:59,614 INFO L280 TraceCheckUtils]: 4: Hoare triple {1292#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1293#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:25:59,615 INFO L280 TraceCheckUtils]: 5: Hoare triple {1293#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} assume !(~i~0 < ~size); {1294#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:25:59,616 INFO L280 TraceCheckUtils]: 6: Hoare triple {1294#(not (= |init_#in~size| 100000))} assume true; {1294#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:25:59,617 INFO L275 TraceCheckUtils]: 7: Hoare quadruple {1294#(not (= |init_#in~size| 100000))} {1276#true} #80#return; {1277#false} is VALID [2020-07-10 15:25:59,618 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,619 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,619 INFO L280 TraceCheckUtils]: 2: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-10 15:25:59,619 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1276#true} {1276#true} #76#return; {1276#true} is VALID [2020-07-10 15:25:59,620 INFO L263 TraceCheckUtils]: 4: Hoare triple {1276#true} call #t~ret6 := main(); {1276#true} is VALID [2020-07-10 15:25:59,620 INFO L280 TraceCheckUtils]: 5: Hoare triple {1276#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {1276#true} is VALID [2020-07-10 15:25:59,621 INFO L263 TraceCheckUtils]: 6: Hoare triple {1276#true} call init(~#a~0.base, ~#a~0.offset, 100000); {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,622 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 (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:25:59,624 INFO L280 TraceCheckUtils]: 8: Hoare triple {1291#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |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); {1291#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:25:59,625 INFO L280 TraceCheckUtils]: 9: Hoare triple {1291#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1292#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:25:59,627 INFO L280 TraceCheckUtils]: 10: Hoare triple {1292#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {1292#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:25:59,628 INFO L280 TraceCheckUtils]: 11: Hoare triple {1292#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1293#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:25:59,629 INFO L280 TraceCheckUtils]: 12: Hoare triple {1293#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} assume !(~i~0 < ~size); {1294#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:25:59,630 INFO L280 TraceCheckUtils]: 13: Hoare triple {1294#(not (= |init_#in~size| 100000))} assume true; {1294#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:25:59,631 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1294#(not (= |init_#in~size| 100000))} {1276#true} #80#return; {1277#false} is VALID [2020-07-10 15:25:59,631 INFO L280 TraceCheckUtils]: 15: Hoare triple {1277#false} ~i~1 := 0; {1277#false} is VALID [2020-07-10 15:25:59,631 INFO L280 TraceCheckUtils]: 16: Hoare triple {1277#false} assume !!(~i~1 < 100000);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,632 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,632 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,632 INFO L280 TraceCheckUtils]: 19: Hoare triple {1277#false} assume !!(~i~1 < 100000);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,632 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,633 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,633 INFO L280 TraceCheckUtils]: 22: Hoare triple {1277#false} assume !(~i~1 < 100000); {1277#false} is VALID [2020-07-10 15:25:59,633 INFO L280 TraceCheckUtils]: 23: Hoare triple {1277#false} ~i~1 := 0; {1277#false} is VALID [2020-07-10 15:25:59,633 INFO L280 TraceCheckUtils]: 24: Hoare triple {1277#false} assume !!(~i~1 < 100000); {1277#false} is VALID [2020-07-10 15:25:59,634 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,634 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,634 INFO L280 TraceCheckUtils]: 27: Hoare triple {1277#false} ~cond := #in~cond; {1277#false} is VALID [2020-07-10 15:25:59,634 INFO L280 TraceCheckUtils]: 28: Hoare triple {1277#false} assume 0 == ~cond; {1277#false} is VALID [2020-07-10 15:25:59,635 INFO L280 TraceCheckUtils]: 29: Hoare triple {1277#false} assume !false; {1277#false} is VALID [2020-07-10 15:25:59,636 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,636 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027399645] [2020-07-10 15:25:59,637 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [265394875] [2020-07-10 15:25:59,637 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,684 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:25:59,685 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:25:59,686 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-10 15:25:59,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:25:59,702 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:25:59,790 INFO L263 TraceCheckUtils]: 0: Hoare triple {1276#true} call ULTIMATE.init(); {1276#true} is VALID [2020-07-10 15:25:59,791 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:25:59,791 INFO L280 TraceCheckUtils]: 2: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-10 15:25:59,791 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1276#true} {1276#true} #76#return; {1276#true} is VALID [2020-07-10 15:25:59,791 INFO L263 TraceCheckUtils]: 4: Hoare triple {1276#true} call #t~ret6 := main(); {1276#true} is VALID [2020-07-10 15:25:59,792 INFO L280 TraceCheckUtils]: 5: Hoare triple {1276#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {1276#true} is VALID [2020-07-10 15:25:59,792 INFO L263 TraceCheckUtils]: 6: Hoare triple {1276#true} call init(~#a~0.base, ~#a~0.offset, 100000); {1276#true} is VALID [2020-07-10 15:25:59,792 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:25:59,792 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:25:59,793 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:25:59,793 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:25:59,793 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:25:59,793 INFO L280 TraceCheckUtils]: 12: Hoare triple {1276#true} assume !(~i~0 < ~size); {1276#true} is VALID [2020-07-10 15:25:59,793 INFO L280 TraceCheckUtils]: 13: Hoare triple {1276#true} assume true; {1276#true} is VALID [2020-07-10 15:25:59,794 INFO L275 TraceCheckUtils]: 14: Hoare quadruple {1276#true} {1276#true} #80#return; {1276#true} is VALID [2020-07-10 15:25:59,795 INFO L280 TraceCheckUtils]: 15: Hoare triple {1276#true} ~i~1 := 0; {1343#(<= main_~i~1 0)} is VALID [2020-07-10 15:25:59,795 INFO L280 TraceCheckUtils]: 16: Hoare triple {1343#(<= main_~i~1 0)} assume !!(~i~1 < 100000);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:25:59,796 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:25:59,797 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:25:59,798 INFO L280 TraceCheckUtils]: 19: Hoare triple {1353#(<= main_~i~1 1)} assume !!(~i~1 < 100000);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:25:59,799 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:25:59,799 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:25:59,800 INFO L280 TraceCheckUtils]: 22: Hoare triple {1363#(<= main_~i~1 2)} assume !(~i~1 < 100000); {1277#false} is VALID [2020-07-10 15:25:59,801 INFO L280 TraceCheckUtils]: 23: Hoare triple {1277#false} ~i~1 := 0; {1277#false} is VALID [2020-07-10 15:25:59,801 INFO L280 TraceCheckUtils]: 24: Hoare triple {1277#false} assume !!(~i~1 < 100000); {1277#false} is VALID [2020-07-10 15:25:59,801 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,801 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,801 INFO L280 TraceCheckUtils]: 27: Hoare triple {1277#false} ~cond := #in~cond; {1277#false} is VALID [2020-07-10 15:25:59,802 INFO L280 TraceCheckUtils]: 28: Hoare triple {1277#false} assume 0 == ~cond; {1277#false} is VALID [2020-07-10 15:25:59,802 INFO L280 TraceCheckUtils]: 29: Hoare triple {1277#false} assume !false; {1277#false} is VALID [2020-07-10 15:25:59,803 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:25:59,804 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:25:59,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 11 [2020-07-10 15:25:59,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310402609] [2020-07-10 15:25:59,805 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-07-10 15:25:59,805 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:25:59,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 15:25:59,865 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:25:59,865 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 15:25:59,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:25:59,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 15:25:59,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:25:59,866 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand 11 states. [2020-07-10 15:26:00,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:00,589 INFO L93 Difference]: Finished difference Result 80 states and 93 transitions. [2020-07-10 15:26:00,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:26:00,590 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2020-07-10 15:26:00,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:00,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:26:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2020-07-10 15:26:00,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 15:26:00,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 89 transitions. [2020-07-10 15:26:00,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 89 transitions. [2020-07-10 15:26:00,716 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,719 INFO L225 Difference]: With dead ends: 80 [2020-07-10 15:26:00,721 INFO L226 Difference]: Without dead ends: 58 [2020-07-10 15:26:00,721 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,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-10 15:26:00,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 40. [2020-07-10 15:26:00,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:00,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 40 states. [2020-07-10 15:26:00,751 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 40 states. [2020-07-10 15:26:00,752 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 40 states. [2020-07-10 15:26:00,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:00,754 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-07-10 15:26:00,755 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2020-07-10 15:26:00,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:00,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:00,757 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 58 states. [2020-07-10 15:26:00,757 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 58 states. [2020-07-10 15:26:00,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:00,761 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2020-07-10 15:26:00,762 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 67 transitions. [2020-07-10 15:26:00,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:00,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:00,762 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:00,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:00,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-07-10 15:26:00,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-07-10 15:26:00,765 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 30 [2020-07-10 15:26:00,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:00,765 INFO L479 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-07-10 15:26:00,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 15:26:00,766 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-07-10 15:26:00,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-07-10 15:26:00,766 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:00,767 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:00,967 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 15:26:00,968 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:00,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:00,968 INFO L82 PathProgramCache]: Analyzing trace with hash 36245332, now seen corresponding path program 3 times [2020-07-10 15:26:00,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:00,969 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093625040] [2020-07-10 15:26:00,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:00,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,026 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,026 INFO L280 TraceCheckUtils]: 1: Hoare triple {1676#true} assume true; {1676#true} is VALID [2020-07-10 15:26:01,026 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1676#true} {1676#true} #76#return; {1676#true} is VALID [2020-07-10 15:26:01,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,230 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 (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:01,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {1693#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |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); {1693#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:01,232 INFO L280 TraceCheckUtils]: 2: Hoare triple {1693#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1694#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:01,233 INFO L280 TraceCheckUtils]: 3: Hoare triple {1694#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {1694#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:01,237 INFO L280 TraceCheckUtils]: 4: Hoare triple {1694#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1695#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:01,238 INFO L280 TraceCheckUtils]: 5: Hoare triple {1695#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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 (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:01,239 INFO L280 TraceCheckUtils]: 6: Hoare triple {1695#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1696#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} is VALID [2020-07-10 15:26:01,240 INFO L280 TraceCheckUtils]: 7: Hoare triple {1696#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} assume !(~i~0 < ~size); {1697#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:01,242 INFO L280 TraceCheckUtils]: 8: Hoare triple {1697#(not (= |init_#in~size| 100000))} assume true; {1697#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:01,243 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {1697#(not (= |init_#in~size| 100000))} {1676#true} #80#return; {1677#false} is VALID [2020-07-10 15:26:01,244 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,244 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,245 INFO L280 TraceCheckUtils]: 2: Hoare triple {1676#true} assume true; {1676#true} is VALID [2020-07-10 15:26:01,245 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1676#true} {1676#true} #76#return; {1676#true} is VALID [2020-07-10 15:26:01,245 INFO L263 TraceCheckUtils]: 4: Hoare triple {1676#true} call #t~ret6 := main(); {1676#true} is VALID [2020-07-10 15:26:01,246 INFO L280 TraceCheckUtils]: 5: Hoare triple {1676#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {1676#true} is VALID [2020-07-10 15:26:01,248 INFO L263 TraceCheckUtils]: 6: Hoare triple {1676#true} call init(~#a~0.base, ~#a~0.offset, 100000); {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,249 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 (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:01,250 INFO L280 TraceCheckUtils]: 8: Hoare triple {1693#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |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); {1693#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:01,251 INFO L280 TraceCheckUtils]: 9: Hoare triple {1693#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1694#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:01,252 INFO L280 TraceCheckUtils]: 10: Hoare triple {1694#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {1694#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:01,252 INFO L280 TraceCheckUtils]: 11: Hoare triple {1694#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1695#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:01,254 INFO L280 TraceCheckUtils]: 12: Hoare triple {1695#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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 (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:01,255 INFO L280 TraceCheckUtils]: 13: Hoare triple {1695#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {1696#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} is VALID [2020-07-10 15:26:01,255 INFO L280 TraceCheckUtils]: 14: Hoare triple {1696#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} assume !(~i~0 < ~size); {1697#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:01,256 INFO L280 TraceCheckUtils]: 15: Hoare triple {1697#(not (= |init_#in~size| 100000))} assume true; {1697#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:01,257 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1697#(not (= |init_#in~size| 100000))} {1676#true} #80#return; {1677#false} is VALID [2020-07-10 15:26:01,257 INFO L280 TraceCheckUtils]: 17: Hoare triple {1677#false} ~i~1 := 0; {1677#false} is VALID [2020-07-10 15:26:01,257 INFO L280 TraceCheckUtils]: 18: Hoare triple {1677#false} assume !!(~i~1 < 100000);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,257 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,258 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,258 INFO L280 TraceCheckUtils]: 21: Hoare triple {1677#false} assume !!(~i~1 < 100000);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,258 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,258 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,258 INFO L280 TraceCheckUtils]: 24: Hoare triple {1677#false} assume !!(~i~1 < 100000);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,259 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,259 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,259 INFO L280 TraceCheckUtils]: 27: Hoare triple {1677#false} assume !(~i~1 < 100000); {1677#false} is VALID [2020-07-10 15:26:01,259 INFO L280 TraceCheckUtils]: 28: Hoare triple {1677#false} ~i~1 := 0; {1677#false} is VALID [2020-07-10 15:26:01,259 INFO L280 TraceCheckUtils]: 29: Hoare triple {1677#false} assume !!(~i~1 < 100000); {1677#false} is VALID [2020-07-10 15:26:01,260 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,260 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,260 INFO L280 TraceCheckUtils]: 32: Hoare triple {1677#false} ~cond := #in~cond; {1677#false} is VALID [2020-07-10 15:26:01,262 INFO L280 TraceCheckUtils]: 33: Hoare triple {1677#false} assume 0 == ~cond; {1677#false} is VALID [2020-07-10 15:26:01,262 INFO L280 TraceCheckUtils]: 34: Hoare triple {1677#false} assume !false; {1677#false} is VALID [2020-07-10 15:26:01,264 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,265 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093625040] [2020-07-10 15:26:01,265 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [993112908] [2020-07-10 15:26:01,265 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,326 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-10 15:26:01,326 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:01,327 INFO L264 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 21 conjunts are in the unsatisfiable core [2020-07-10 15:26:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:01,361 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:01,574 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,575 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:01,583 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:01,587 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,595 INFO L544 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:01,598 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:01,599 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,599 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2020-07-10 15:26:01,603 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:01,603 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,604 WARN L408 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 |main_#t~mem5.offset|) (= 0 |main_#t~mem5.base|)) [2020-07-10 15:26:01,682 INFO L263 TraceCheckUtils]: 0: Hoare triple {1676#true} call ULTIMATE.init(); {1676#true} is VALID [2020-07-10 15:26:01,682 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,682 INFO L280 TraceCheckUtils]: 2: Hoare triple {1676#true} assume true; {1676#true} is VALID [2020-07-10 15:26:01,683 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {1676#true} {1676#true} #76#return; {1676#true} is VALID [2020-07-10 15:26:01,683 INFO L263 TraceCheckUtils]: 4: Hoare triple {1676#true} call #t~ret6 := main(); {1676#true} is VALID [2020-07-10 15:26:01,688 INFO L280 TraceCheckUtils]: 5: Hoare triple {1676#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {1716#(= 0 |main_~#a~0.offset|)} is VALID [2020-07-10 15:26:01,689 INFO L263 TraceCheckUtils]: 6: Hoare triple {1716#(= 0 |main_~#a~0.offset|)} call init(~#a~0.base, ~#a~0.offset, 100000); {1676#true} is VALID [2020-07-10 15:26:01,689 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,689 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,689 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,690 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,690 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,690 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,690 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,690 INFO L280 TraceCheckUtils]: 14: Hoare triple {1676#true} assume !(~i~0 < ~size); {1676#true} is VALID [2020-07-10 15:26:01,691 INFO L280 TraceCheckUtils]: 15: Hoare triple {1676#true} assume true; {1676#true} is VALID [2020-07-10 15:26:01,693 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {1676#true} {1716#(= 0 |main_~#a~0.offset|)} #80#return; {1716#(= 0 |main_~#a~0.offset|)} is VALID [2020-07-10 15:26:01,693 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,695 INFO L280 TraceCheckUtils]: 18: Hoare triple {1753#(and (= 0 main_~i~1) (= 0 |main_~#a~0.offset|))} assume !!(~i~1 < 100000);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,695 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,696 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,697 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 < 100000);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,697 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,704 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,705 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 < 100000);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,705 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,706 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,707 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 < 100000); {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,707 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,708 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 < 100000); {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,711 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,712 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,713 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,713 INFO L280 TraceCheckUtils]: 33: Hoare triple {1804#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1677#false} is VALID [2020-07-10 15:26:01,713 INFO L280 TraceCheckUtils]: 34: Hoare triple {1677#false} assume !false; {1677#false} is VALID [2020-07-10 15:26:01,718 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,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:01,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2020-07-10 15:26:01,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102975575] [2020-07-10 15:26:01,720 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2020-07-10 15:26:01,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:01,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-10 15:26:01,789 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:01,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-10 15:26:01,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:01,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-10 15:26:01,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2020-07-10 15:26:01,791 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 17 states. [2020-07-10 15:26:02,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:02,795 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2020-07-10 15:26:02,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-07-10 15:26:02,796 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 35 [2020-07-10 15:26:02,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:02,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 15:26:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 74 transitions. [2020-07-10 15:26:02,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 15:26:02,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 74 transitions. [2020-07-10 15:26:02,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 74 transitions. [2020-07-10 15:26:02,903 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:02,906 INFO L225 Difference]: With dead ends: 77 [2020-07-10 15:26:02,906 INFO L226 Difference]: Without dead ends: 52 [2020-07-10 15:26:02,907 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:02,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-10 15:26:02,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2020-07-10 15:26:02,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:02,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 49 states. [2020-07-10 15:26:02,961 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 49 states. [2020-07-10 15:26:02,961 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 49 states. [2020-07-10 15:26:02,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:02,963 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-07-10 15:26:02,963 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-07-10 15:26:02,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:02,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:02,964 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 52 states. [2020-07-10 15:26:02,964 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 52 states. [2020-07-10 15:26:02,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:02,966 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2020-07-10 15:26:02,966 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2020-07-10 15:26:02,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:02,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:02,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:02,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:02,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-10 15:26:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2020-07-10 15:26:02,969 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 35 [2020-07-10 15:26:02,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:02,970 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2020-07-10 15:26:02,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-10 15:26:02,970 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2020-07-10 15:26:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-10 15:26:02,971 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:02,971 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,182 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,182 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:03,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:03,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1657174857, now seen corresponding path program 1 times [2020-07-10 15:26:03,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:03,184 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99523992] [2020-07-10 15:26:03,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:03,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,243 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,243 INFO L280 TraceCheckUtils]: 1: Hoare triple {2104#true} assume true; {2104#true} is VALID [2020-07-10 15:26:03,243 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2104#true} {2104#true} #76#return; {2104#true} is VALID [2020-07-10 15:26:03,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,552 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 (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:03,554 INFO L280 TraceCheckUtils]: 1: Hoare triple {2123#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |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); {2123#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:03,558 INFO L280 TraceCheckUtils]: 2: Hoare triple {2123#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2124#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:03,560 INFO L280 TraceCheckUtils]: 3: Hoare triple {2124#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {2124#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:03,561 INFO L280 TraceCheckUtils]: 4: Hoare triple {2124#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2125#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:03,563 INFO L280 TraceCheckUtils]: 5: Hoare triple {2125#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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 (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:03,564 INFO L280 TraceCheckUtils]: 6: Hoare triple {2125#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2126#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} is VALID [2020-07-10 15:26:03,565 INFO L280 TraceCheckUtils]: 7: Hoare triple {2126#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {2126#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} is VALID [2020-07-10 15:26:03,566 INFO L280 TraceCheckUtils]: 8: Hoare triple {2126#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2127#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:03,567 INFO L280 TraceCheckUtils]: 9: Hoare triple {2127#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} assume !(~i~0 < ~size); {2128#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:03,567 INFO L280 TraceCheckUtils]: 10: Hoare triple {2128#(not (= |init_#in~size| 100000))} assume true; {2128#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:03,568 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2128#(not (= |init_#in~size| 100000))} {2104#true} #80#return; {2105#false} is VALID [2020-07-10 15:26:03,569 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,570 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,570 INFO L280 TraceCheckUtils]: 2: Hoare triple {2104#true} assume true; {2104#true} is VALID [2020-07-10 15:26:03,570 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2104#true} {2104#true} #76#return; {2104#true} is VALID [2020-07-10 15:26:03,570 INFO L263 TraceCheckUtils]: 4: Hoare triple {2104#true} call #t~ret6 := main(); {2104#true} is VALID [2020-07-10 15:26:03,570 INFO L280 TraceCheckUtils]: 5: Hoare triple {2104#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {2104#true} is VALID [2020-07-10 15:26:03,571 INFO L263 TraceCheckUtils]: 6: Hoare triple {2104#true} call init(~#a~0.base, ~#a~0.offset, 100000); {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,572 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 (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:03,573 INFO L280 TraceCheckUtils]: 8: Hoare triple {2123#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |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); {2123#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:03,574 INFO L280 TraceCheckUtils]: 9: Hoare triple {2123#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2124#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:03,575 INFO L280 TraceCheckUtils]: 10: Hoare triple {2124#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {2124#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:03,584 INFO L280 TraceCheckUtils]: 11: Hoare triple {2124#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2125#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:03,585 INFO L280 TraceCheckUtils]: 12: Hoare triple {2125#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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 (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:03,586 INFO L280 TraceCheckUtils]: 13: Hoare triple {2125#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2126#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} is VALID [2020-07-10 15:26:03,587 INFO L280 TraceCheckUtils]: 14: Hoare triple {2126#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {2126#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} is VALID [2020-07-10 15:26:03,588 INFO L280 TraceCheckUtils]: 15: Hoare triple {2126#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2127#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:03,589 INFO L280 TraceCheckUtils]: 16: Hoare triple {2127#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} assume !(~i~0 < ~size); {2128#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:03,590 INFO L280 TraceCheckUtils]: 17: Hoare triple {2128#(not (= |init_#in~size| 100000))} assume true; {2128#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:03,591 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2128#(not (= |init_#in~size| 100000))} {2104#true} #80#return; {2105#false} is VALID [2020-07-10 15:26:03,591 INFO L280 TraceCheckUtils]: 19: Hoare triple {2105#false} ~i~1 := 0; {2105#false} is VALID [2020-07-10 15:26:03,591 INFO L280 TraceCheckUtils]: 20: Hoare triple {2105#false} assume !!(~i~1 < 100000);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,592 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,592 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,592 INFO L280 TraceCheckUtils]: 23: Hoare triple {2105#false} assume !!(~i~1 < 100000);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,592 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,592 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,593 INFO L280 TraceCheckUtils]: 26: Hoare triple {2105#false} assume !!(~i~1 < 100000);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,593 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,593 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,593 INFO L280 TraceCheckUtils]: 29: Hoare triple {2105#false} assume !(~i~1 < 100000); {2105#false} is VALID [2020-07-10 15:26:03,593 INFO L280 TraceCheckUtils]: 30: Hoare triple {2105#false} ~i~1 := 0; {2105#false} is VALID [2020-07-10 15:26:03,594 INFO L280 TraceCheckUtils]: 31: Hoare triple {2105#false} assume !!(~i~1 < 100000); {2105#false} is VALID [2020-07-10 15:26:03,594 INFO L280 TraceCheckUtils]: 32: Hoare triple {2105#false} assume !(0 == ~flag~0); {2105#false} is VALID [2020-07-10 15:26:03,594 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,594 INFO L280 TraceCheckUtils]: 34: Hoare triple {2105#false} assume !!(~i~1 < 100000); {2105#false} is VALID [2020-07-10 15:26:03,594 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,595 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,595 INFO L280 TraceCheckUtils]: 37: Hoare triple {2105#false} ~cond := #in~cond; {2105#false} is VALID [2020-07-10 15:26:03,595 INFO L280 TraceCheckUtils]: 38: Hoare triple {2105#false} assume 0 == ~cond; {2105#false} is VALID [2020-07-10 15:26:03,595 INFO L280 TraceCheckUtils]: 39: Hoare triple {2105#false} assume !false; {2105#false} is VALID [2020-07-10 15:26:03,598 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,598 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99523992] [2020-07-10 15:26:03,599 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49281383] [2020-07-10 15:26:03,599 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,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,650 INFO L264 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-10 15:26:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:03,664 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:03,709 INFO L263 TraceCheckUtils]: 0: Hoare triple {2104#true} call ULTIMATE.init(); {2104#true} is VALID [2020-07-10 15:26:03,710 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,710 INFO L280 TraceCheckUtils]: 2: Hoare triple {2104#true} assume true; {2104#true} is VALID [2020-07-10 15:26:03,710 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2104#true} {2104#true} #76#return; {2104#true} is VALID [2020-07-10 15:26:03,710 INFO L263 TraceCheckUtils]: 4: Hoare triple {2104#true} call #t~ret6 := main(); {2104#true} is VALID [2020-07-10 15:26:03,711 INFO L280 TraceCheckUtils]: 5: Hoare triple {2104#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {2147#(= 0 main_~flag~0)} is VALID [2020-07-10 15:26:03,712 INFO L263 TraceCheckUtils]: 6: Hoare triple {2147#(= 0 main_~flag~0)} call init(~#a~0.base, ~#a~0.offset, 100000); {2104#true} is VALID [2020-07-10 15:26:03,712 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,712 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,712 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,712 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,713 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,713 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,713 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,713 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,714 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,714 INFO L280 TraceCheckUtils]: 16: Hoare triple {2104#true} assume !(~i~0 < ~size); {2104#true} is VALID [2020-07-10 15:26:03,714 INFO L280 TraceCheckUtils]: 17: Hoare triple {2104#true} assume true; {2104#true} is VALID [2020-07-10 15:26:03,715 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2104#true} {2147#(= 0 main_~flag~0)} #80#return; {2147#(= 0 main_~flag~0)} is VALID [2020-07-10 15:26:03,716 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,716 INFO L280 TraceCheckUtils]: 20: Hoare triple {2147#(= 0 main_~flag~0)} assume !!(~i~1 < 100000);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,717 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,717 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,718 INFO L280 TraceCheckUtils]: 23: Hoare triple {2147#(= 0 main_~flag~0)} assume !!(~i~1 < 100000);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,719 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,719 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,720 INFO L280 TraceCheckUtils]: 26: Hoare triple {2147#(= 0 main_~flag~0)} assume !!(~i~1 < 100000);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,721 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,721 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,722 INFO L280 TraceCheckUtils]: 29: Hoare triple {2147#(= 0 main_~flag~0)} assume !(~i~1 < 100000); {2147#(= 0 main_~flag~0)} is VALID [2020-07-10 15:26:03,722 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,723 INFO L280 TraceCheckUtils]: 31: Hoare triple {2147#(= 0 main_~flag~0)} assume !!(~i~1 < 100000); {2147#(= 0 main_~flag~0)} is VALID [2020-07-10 15:26:03,723 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,724 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,724 INFO L280 TraceCheckUtils]: 34: Hoare triple {2105#false} assume !!(~i~1 < 100000); {2105#false} is VALID [2020-07-10 15:26:03,724 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,724 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,725 INFO L280 TraceCheckUtils]: 37: Hoare triple {2105#false} ~cond := #in~cond; {2105#false} is VALID [2020-07-10 15:26:03,725 INFO L280 TraceCheckUtils]: 38: Hoare triple {2105#false} assume 0 == ~cond; {2105#false} is VALID [2020-07-10 15:26:03,725 INFO L280 TraceCheckUtils]: 39: Hoare triple {2105#false} assume !false; {2105#false} is VALID [2020-07-10 15:26:03,726 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,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-10 15:26:03,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2020-07-10 15:26:03,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962834119] [2020-07-10 15:26:03,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-07-10 15:26:03,728 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:03,728 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 15:26:03,762 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,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 15:26:03,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:03,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 15:26:03,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-10 15:26:03,763 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand 3 states. [2020-07-10 15:26:03,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:03,849 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2020-07-10 15:26:03,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 15:26:03,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2020-07-10 15:26:03,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:03,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2020-07-10 15:26:03,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 15:26:03,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 43 transitions. [2020-07-10 15:26:03,853 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 43 transitions. [2020-07-10 15:26:03,906 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:03,908 INFO L225 Difference]: With dead ends: 60 [2020-07-10 15:26:03,908 INFO L226 Difference]: Without dead ends: 49 [2020-07-10 15:26:03,909 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:03,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2020-07-10 15:26:03,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2020-07-10 15:26:03,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:03,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 49 states. [2020-07-10 15:26:03,964 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-10 15:26:03,964 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-10 15:26:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:03,966 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-10 15:26:03,967 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-10 15:26:03,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:03,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:03,967 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 49 states. [2020-07-10 15:26:03,967 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 49 states. [2020-07-10 15:26:03,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:03,969 INFO L93 Difference]: Finished difference Result 49 states and 51 transitions. [2020-07-10 15:26:03,970 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-10 15:26:03,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:03,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:03,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:03,970 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:03,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-07-10 15:26:03,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2020-07-10 15:26:03,973 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 40 [2020-07-10 15:26:03,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:03,973 INFO L479 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2020-07-10 15:26:03,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 15:26:03,973 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2020-07-10 15:26:03,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-10 15:26:03,974 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:03,974 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,186 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,187 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:04,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:04,188 INFO L82 PathProgramCache]: Analyzing trace with hash -283893320, now seen corresponding path program 1 times [2020-07-10 15:26:04,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:04,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210323588] [2020-07-10 15:26:04,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:04,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,246 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,246 INFO L280 TraceCheckUtils]: 1: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-10 15:26:04,246 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2501#true} {2501#true} #76#return; {2501#true} is VALID [2020-07-10 15:26:04,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,527 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 (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:04,528 INFO L280 TraceCheckUtils]: 1: Hoare triple {2524#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |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); {2524#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:04,529 INFO L280 TraceCheckUtils]: 2: Hoare triple {2524#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2525#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:04,530 INFO L280 TraceCheckUtils]: 3: Hoare triple {2525#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {2525#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:04,531 INFO L280 TraceCheckUtils]: 4: Hoare triple {2525#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2526#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:04,532 INFO L280 TraceCheckUtils]: 5: Hoare triple {2526#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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 (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:04,533 INFO L280 TraceCheckUtils]: 6: Hoare triple {2526#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2527#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} is VALID [2020-07-10 15:26:04,535 INFO L280 TraceCheckUtils]: 7: Hoare triple {2527#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {2527#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} is VALID [2020-07-10 15:26:04,536 INFO L280 TraceCheckUtils]: 8: Hoare triple {2527#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2528#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:04,537 INFO L280 TraceCheckUtils]: 9: Hoare triple {2528#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} assume !(~i~0 < ~size); {2529#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:04,537 INFO L280 TraceCheckUtils]: 10: Hoare triple {2529#(not (= |init_#in~size| 100000))} assume true; {2529#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:04,538 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {2529#(not (= |init_#in~size| 100000))} {2501#true} #80#return; {2502#false} is VALID [2020-07-10 15:26:04,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,544 INFO L280 TraceCheckUtils]: 0: Hoare triple {2501#true} ~cond := #in~cond; {2501#true} is VALID [2020-07-10 15:26:04,544 INFO L280 TraceCheckUtils]: 1: Hoare triple {2501#true} assume !(0 == ~cond); {2501#true} is VALID [2020-07-10 15:26:04,544 INFO L280 TraceCheckUtils]: 2: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-10 15:26:04,545 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2501#true} {2502#false} #82#return; {2502#false} is VALID [2020-07-10 15:26:04,546 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,546 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,546 INFO L280 TraceCheckUtils]: 2: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-10 15:26:04,546 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2501#true} {2501#true} #76#return; {2501#true} is VALID [2020-07-10 15:26:04,546 INFO L263 TraceCheckUtils]: 4: Hoare triple {2501#true} call #t~ret6 := main(); {2501#true} is VALID [2020-07-10 15:26:04,547 INFO L280 TraceCheckUtils]: 5: Hoare triple {2501#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {2501#true} is VALID [2020-07-10 15:26:04,548 INFO L263 TraceCheckUtils]: 6: Hoare triple {2501#true} call init(~#a~0.base, ~#a~0.offset, 100000); {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,549 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 (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:04,550 INFO L280 TraceCheckUtils]: 8: Hoare triple {2524#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |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); {2524#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:04,551 INFO L280 TraceCheckUtils]: 9: Hoare triple {2524#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2525#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:04,552 INFO L280 TraceCheckUtils]: 10: Hoare triple {2525#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {2525#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:04,553 INFO L280 TraceCheckUtils]: 11: Hoare triple {2525#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2526#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:04,554 INFO L280 TraceCheckUtils]: 12: Hoare triple {2526#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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 (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:04,556 INFO L280 TraceCheckUtils]: 13: Hoare triple {2526#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2527#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} is VALID [2020-07-10 15:26:04,557 INFO L280 TraceCheckUtils]: 14: Hoare triple {2527#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {2527#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} is VALID [2020-07-10 15:26:04,558 INFO L280 TraceCheckUtils]: 15: Hoare triple {2527#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {2528#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:04,559 INFO L280 TraceCheckUtils]: 16: Hoare triple {2528#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} assume !(~i~0 < ~size); {2529#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:04,559 INFO L280 TraceCheckUtils]: 17: Hoare triple {2529#(not (= |init_#in~size| 100000))} assume true; {2529#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:04,560 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2529#(not (= |init_#in~size| 100000))} {2501#true} #80#return; {2502#false} is VALID [2020-07-10 15:26:04,561 INFO L280 TraceCheckUtils]: 19: Hoare triple {2502#false} ~i~1 := 0; {2502#false} is VALID [2020-07-10 15:26:04,561 INFO L280 TraceCheckUtils]: 20: Hoare triple {2502#false} assume !!(~i~1 < 100000);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,561 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,561 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,561 INFO L280 TraceCheckUtils]: 23: Hoare triple {2502#false} assume !!(~i~1 < 100000);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,562 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,562 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,562 INFO L280 TraceCheckUtils]: 26: Hoare triple {2502#false} assume !!(~i~1 < 100000);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,564 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,564 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,565 INFO L280 TraceCheckUtils]: 29: Hoare triple {2502#false} assume !(~i~1 < 100000); {2502#false} is VALID [2020-07-10 15:26:04,565 INFO L280 TraceCheckUtils]: 30: Hoare triple {2502#false} ~i~1 := 0; {2502#false} is VALID [2020-07-10 15:26:04,565 INFO L280 TraceCheckUtils]: 31: Hoare triple {2502#false} assume !!(~i~1 < 100000); {2502#false} is VALID [2020-07-10 15:26:04,565 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,565 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,566 INFO L280 TraceCheckUtils]: 34: Hoare triple {2501#true} ~cond := #in~cond; {2501#true} is VALID [2020-07-10 15:26:04,566 INFO L280 TraceCheckUtils]: 35: Hoare triple {2501#true} assume !(0 == ~cond); {2501#true} is VALID [2020-07-10 15:26:04,566 INFO L280 TraceCheckUtils]: 36: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-10 15:26:04,568 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2501#true} {2502#false} #82#return; {2502#false} is VALID [2020-07-10 15:26:04,569 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,569 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,569 INFO L280 TraceCheckUtils]: 40: Hoare triple {2502#false} assume !!(~i~1 < 100000); {2502#false} is VALID [2020-07-10 15:26:04,569 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,569 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,569 INFO L280 TraceCheckUtils]: 43: Hoare triple {2502#false} ~cond := #in~cond; {2502#false} is VALID [2020-07-10 15:26:04,570 INFO L280 TraceCheckUtils]: 44: Hoare triple {2502#false} assume 0 == ~cond; {2502#false} is VALID [2020-07-10 15:26:04,570 INFO L280 TraceCheckUtils]: 45: Hoare triple {2502#false} assume !false; {2502#false} is VALID [2020-07-10 15:26:04,576 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,578 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210323588] [2020-07-10 15:26:04,579 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507130858] [2020-07-10 15:26:04,579 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,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,642 INFO L264 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-10 15:26:04,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:04,656 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:04,872 INFO L263 TraceCheckUtils]: 0: Hoare triple {2501#true} call ULTIMATE.init(); {2501#true} is VALID [2020-07-10 15:26:04,872 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:04,872 INFO L280 TraceCheckUtils]: 2: Hoare triple {2501#true} assume true; {2501#true} is VALID [2020-07-10 15:26:04,872 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2501#true} {2501#true} #76#return; {2501#true} is VALID [2020-07-10 15:26:04,873 INFO L263 TraceCheckUtils]: 4: Hoare triple {2501#true} call #t~ret6 := main(); {2501#true} is VALID [2020-07-10 15:26:04,873 INFO L280 TraceCheckUtils]: 5: Hoare triple {2501#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {2501#true} is VALID [2020-07-10 15:26:04,873 INFO L263 TraceCheckUtils]: 6: Hoare triple {2501#true} call init(~#a~0.base, ~#a~0.offset, 100000); {2501#true} is VALID [2020-07-10 15:26:04,874 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:04,875 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:04,876 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:04,878 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:04,879 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:04,880 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:04,881 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:04,882 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:04,883 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:04,884 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:04,885 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:04,886 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {2586#(<= |init_#in~size| 4)} {2501#true} #80#return; {2502#false} is VALID [2020-07-10 15:26:04,886 INFO L280 TraceCheckUtils]: 19: Hoare triple {2502#false} ~i~1 := 0; {2502#false} is VALID [2020-07-10 15:26:04,886 INFO L280 TraceCheckUtils]: 20: Hoare triple {2502#false} assume !!(~i~1 < 100000);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,886 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,886 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,887 INFO L280 TraceCheckUtils]: 23: Hoare triple {2502#false} assume !!(~i~1 < 100000);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,887 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,887 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,887 INFO L280 TraceCheckUtils]: 26: Hoare triple {2502#false} assume !!(~i~1 < 100000);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,887 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,887 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,887 INFO L280 TraceCheckUtils]: 29: Hoare triple {2502#false} assume !(~i~1 < 100000); {2502#false} is VALID [2020-07-10 15:26:04,887 INFO L280 TraceCheckUtils]: 30: Hoare triple {2502#false} ~i~1 := 0; {2502#false} is VALID [2020-07-10 15:26:04,888 INFO L280 TraceCheckUtils]: 31: Hoare triple {2502#false} assume !!(~i~1 < 100000); {2502#false} is VALID [2020-07-10 15:26:04,888 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,888 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:04,888 INFO L280 TraceCheckUtils]: 34: Hoare triple {2502#false} ~cond := #in~cond; {2502#false} is VALID [2020-07-10 15:26:04,888 INFO L280 TraceCheckUtils]: 35: Hoare triple {2502#false} assume !(0 == ~cond); {2502#false} is VALID [2020-07-10 15:26:04,888 INFO L280 TraceCheckUtils]: 36: Hoare triple {2502#false} assume true; {2502#false} is VALID [2020-07-10 15:26:04,888 INFO L275 TraceCheckUtils]: 37: Hoare quadruple {2502#false} {2502#false} #82#return; {2502#false} is VALID [2020-07-10 15:26:04,889 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,889 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,889 INFO L280 TraceCheckUtils]: 40: Hoare triple {2502#false} assume !!(~i~1 < 100000); {2502#false} is VALID [2020-07-10 15:26:04,889 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,889 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,889 INFO L280 TraceCheckUtils]: 43: Hoare triple {2502#false} ~cond := #in~cond; {2502#false} is VALID [2020-07-10 15:26:04,889 INFO L280 TraceCheckUtils]: 44: Hoare triple {2502#false} assume 0 == ~cond; {2502#false} is VALID [2020-07-10 15:26:04,889 INFO L280 TraceCheckUtils]: 45: Hoare triple {2502#false} assume !false; {2502#false} is VALID [2020-07-10 15:26:04,891 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:04,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:04,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 16 [2020-07-10 15:26:04,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599806092] [2020-07-10 15:26:04,892 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2020-07-10 15:26:04,893 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:04,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-10 15:26:04,971 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:04,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-10 15:26:04,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:04,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-10 15:26:04,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2020-07-10 15:26:04,972 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 16 states. [2020-07-10 15:26:05,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:05,777 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2020-07-10 15:26:05,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 15:26:05,777 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 46 [2020-07-10 15:26:05,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 15:26:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2020-07-10 15:26:05,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-10 15:26:05,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 60 transitions. [2020-07-10 15:26:05,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 60 transitions. [2020-07-10 15:26:05,870 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,872 INFO L225 Difference]: With dead ends: 84 [2020-07-10 15:26:05,872 INFO L226 Difference]: Without dead ends: 52 [2020-07-10 15:26:05,873 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,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2020-07-10 15:26:05,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2020-07-10 15:26:05,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:05,925 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 51 states. [2020-07-10 15:26:05,925 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 51 states. [2020-07-10 15:26:05,925 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 51 states. [2020-07-10 15:26:05,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:05,927 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-10 15:26:05,928 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-10 15:26:05,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:05,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:05,928 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 52 states. [2020-07-10 15:26:05,928 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 52 states. [2020-07-10 15:26:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:05,931 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2020-07-10 15:26:05,931 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2020-07-10 15:26:05,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:05,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:05,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:05,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:05,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2020-07-10 15:26:05,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2020-07-10 15:26:05,933 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 46 [2020-07-10 15:26:05,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:05,934 INFO L479 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2020-07-10 15:26:05,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-10 15:26:05,934 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2020-07-10 15:26:05,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-07-10 15:26:05,935 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:05,935 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,136 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,137 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:06,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:06,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1920057082, now seen corresponding path program 2 times [2020-07-10 15:26:06,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:06,138 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721118710] [2020-07-10 15:26:06,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:06,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,196 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,196 INFO L280 TraceCheckUtils]: 1: Hoare triple {2983#true} assume true; {2983#true} is VALID [2020-07-10 15:26:06,196 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2983#true} {2983#true} #76#return; {2983#true} is VALID [2020-07-10 15:26:06,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,496 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 (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:06,498 INFO L280 TraceCheckUtils]: 1: Hoare triple {3008#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |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); {3008#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:06,498 INFO L280 TraceCheckUtils]: 2: Hoare triple {3008#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3009#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:06,499 INFO L280 TraceCheckUtils]: 3: Hoare triple {3009#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {3009#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:06,500 INFO L280 TraceCheckUtils]: 4: Hoare triple {3009#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3010#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:06,501 INFO L280 TraceCheckUtils]: 5: Hoare triple {3010#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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 (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:06,503 INFO L280 TraceCheckUtils]: 6: Hoare triple {3010#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3011#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} is VALID [2020-07-10 15:26:06,504 INFO L280 TraceCheckUtils]: 7: Hoare triple {3011#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {3011#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} is VALID [2020-07-10 15:26:06,505 INFO L280 TraceCheckUtils]: 8: Hoare triple {3011#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3012#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:06,506 INFO L280 TraceCheckUtils]: 9: Hoare triple {3012#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |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); {3012#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:06,507 INFO L280 TraceCheckUtils]: 10: Hoare triple {3012#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3013#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 5)))} is VALID [2020-07-10 15:26:06,508 INFO L280 TraceCheckUtils]: 11: Hoare triple {3013#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 5)))} assume !(~i~0 < ~size); {3014#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:06,508 INFO L280 TraceCheckUtils]: 12: Hoare triple {3014#(not (= |init_#in~size| 100000))} assume true; {3014#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:06,509 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {3014#(not (= |init_#in~size| 100000))} {2983#true} #80#return; {2984#false} is VALID [2020-07-10 15:26:06,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,514 INFO L280 TraceCheckUtils]: 0: Hoare triple {2983#true} ~cond := #in~cond; {2983#true} is VALID [2020-07-10 15:26:06,514 INFO L280 TraceCheckUtils]: 1: Hoare triple {2983#true} assume !(0 == ~cond); {2983#true} is VALID [2020-07-10 15:26:06,514 INFO L280 TraceCheckUtils]: 2: Hoare triple {2983#true} assume true; {2983#true} is VALID [2020-07-10 15:26:06,514 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2983#true} {2984#false} #82#return; {2984#false} is VALID [2020-07-10 15:26:06,515 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,515 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,515 INFO L280 TraceCheckUtils]: 2: Hoare triple {2983#true} assume true; {2983#true} is VALID [2020-07-10 15:26:06,515 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2983#true} {2983#true} #76#return; {2983#true} is VALID [2020-07-10 15:26:06,515 INFO L263 TraceCheckUtils]: 4: Hoare triple {2983#true} call #t~ret6 := main(); {2983#true} is VALID [2020-07-10 15:26:06,516 INFO L280 TraceCheckUtils]: 5: Hoare triple {2983#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {2983#true} is VALID [2020-07-10 15:26:06,516 INFO L263 TraceCheckUtils]: 6: Hoare triple {2983#true} call init(~#a~0.base, ~#a~0.offset, 100000); {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,517 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 (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:06,518 INFO L280 TraceCheckUtils]: 8: Hoare triple {3008#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |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); {3008#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:06,520 INFO L280 TraceCheckUtils]: 9: Hoare triple {3008#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3009#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:06,521 INFO L280 TraceCheckUtils]: 10: Hoare triple {3009#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {3009#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:06,521 INFO L280 TraceCheckUtils]: 11: Hoare triple {3009#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3010#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:06,522 INFO L280 TraceCheckUtils]: 12: Hoare triple {3010#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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 (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:06,523 INFO L280 TraceCheckUtils]: 13: Hoare triple {3010#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3011#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} is VALID [2020-07-10 15:26:06,524 INFO L280 TraceCheckUtils]: 14: Hoare triple {3011#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {3011#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} is VALID [2020-07-10 15:26:06,524 INFO L280 TraceCheckUtils]: 15: Hoare triple {3011#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3012#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:06,525 INFO L280 TraceCheckUtils]: 16: Hoare triple {3012#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |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); {3012#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:06,526 INFO L280 TraceCheckUtils]: 17: Hoare triple {3012#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3013#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 5)))} is VALID [2020-07-10 15:26:06,526 INFO L280 TraceCheckUtils]: 18: Hoare triple {3013#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 5)))} assume !(~i~0 < ~size); {3014#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:06,527 INFO L280 TraceCheckUtils]: 19: Hoare triple {3014#(not (= |init_#in~size| 100000))} assume true; {3014#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:06,527 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3014#(not (= |init_#in~size| 100000))} {2983#true} #80#return; {2984#false} is VALID [2020-07-10 15:26:06,527 INFO L280 TraceCheckUtils]: 21: Hoare triple {2984#false} ~i~1 := 0; {2984#false} is VALID [2020-07-10 15:26:06,528 INFO L280 TraceCheckUtils]: 22: Hoare triple {2984#false} assume !!(~i~1 < 100000);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,528 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,528 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,528 INFO L280 TraceCheckUtils]: 25: Hoare triple {2984#false} assume !!(~i~1 < 100000);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,528 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,528 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,528 INFO L280 TraceCheckUtils]: 28: Hoare triple {2984#false} assume !!(~i~1 < 100000);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,528 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,529 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,529 INFO L280 TraceCheckUtils]: 31: Hoare triple {2984#false} assume !(~i~1 < 100000); {2984#false} is VALID [2020-07-10 15:26:06,529 INFO L280 TraceCheckUtils]: 32: Hoare triple {2984#false} ~i~1 := 0; {2984#false} is VALID [2020-07-10 15:26:06,529 INFO L280 TraceCheckUtils]: 33: Hoare triple {2984#false} assume !!(~i~1 < 100000); {2984#false} is VALID [2020-07-10 15:26:06,529 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,529 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,530 INFO L280 TraceCheckUtils]: 36: Hoare triple {2983#true} ~cond := #in~cond; {2983#true} is VALID [2020-07-10 15:26:06,530 INFO L280 TraceCheckUtils]: 37: Hoare triple {2983#true} assume !(0 == ~cond); {2983#true} is VALID [2020-07-10 15:26:06,530 INFO L280 TraceCheckUtils]: 38: Hoare triple {2983#true} assume true; {2983#true} is VALID [2020-07-10 15:26:06,531 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2983#true} {2984#false} #82#return; {2984#false} is VALID [2020-07-10 15:26:06,531 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,531 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,532 INFO L280 TraceCheckUtils]: 42: Hoare triple {2984#false} assume !!(~i~1 < 100000); {2984#false} is VALID [2020-07-10 15:26:06,532 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,532 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,533 INFO L280 TraceCheckUtils]: 45: Hoare triple {2984#false} ~cond := #in~cond; {2984#false} is VALID [2020-07-10 15:26:06,533 INFO L280 TraceCheckUtils]: 46: Hoare triple {2984#false} assume 0 == ~cond; {2984#false} is VALID [2020-07-10 15:26:06,533 INFO L280 TraceCheckUtils]: 47: Hoare triple {2984#false} assume !false; {2984#false} is VALID [2020-07-10 15:26:06,536 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,537 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721118710] [2020-07-10 15:26:06,537 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477034785] [2020-07-10 15:26:06,537 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,602 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 15:26:06,603 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:06,604 INFO L264 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-10 15:26:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:06,636 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:06,893 INFO L263 TraceCheckUtils]: 0: Hoare triple {2983#true} call ULTIMATE.init(); {2983#true} is VALID [2020-07-10 15:26:06,893 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,894 INFO L280 TraceCheckUtils]: 2: Hoare triple {2983#true} assume true; {2983#true} is VALID [2020-07-10 15:26:06,894 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {2983#true} {2983#true} #76#return; {2983#true} is VALID [2020-07-10 15:26:06,894 INFO L263 TraceCheckUtils]: 4: Hoare triple {2983#true} call #t~ret6 := main(); {2983#true} is VALID [2020-07-10 15:26:06,894 INFO L280 TraceCheckUtils]: 5: Hoare triple {2983#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {2983#true} is VALID [2020-07-10 15:26:06,894 INFO L263 TraceCheckUtils]: 6: Hoare triple {2983#true} call init(~#a~0.base, ~#a~0.offset, 100000); {2983#true} is VALID [2020-07-10 15:26:06,898 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,908 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,912 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,913 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,914 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,914 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,915 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,917 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,918 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,919 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,920 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,921 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,921 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,923 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {3078#(<= |init_#in~size| 5)} {2983#true} #80#return; {2984#false} is VALID [2020-07-10 15:26:06,923 INFO L280 TraceCheckUtils]: 21: Hoare triple {2984#false} ~i~1 := 0; {2984#false} is VALID [2020-07-10 15:26:06,923 INFO L280 TraceCheckUtils]: 22: Hoare triple {2984#false} assume !!(~i~1 < 100000);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,923 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,923 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,924 INFO L280 TraceCheckUtils]: 25: Hoare triple {2984#false} assume !!(~i~1 < 100000);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,924 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,924 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,924 INFO L280 TraceCheckUtils]: 28: Hoare triple {2984#false} assume !!(~i~1 < 100000);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,924 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,924 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,924 INFO L280 TraceCheckUtils]: 31: Hoare triple {2984#false} assume !(~i~1 < 100000); {2984#false} is VALID [2020-07-10 15:26:06,924 INFO L280 TraceCheckUtils]: 32: Hoare triple {2984#false} ~i~1 := 0; {2984#false} is VALID [2020-07-10 15:26:06,925 INFO L280 TraceCheckUtils]: 33: Hoare triple {2984#false} assume !!(~i~1 < 100000); {2984#false} is VALID [2020-07-10 15:26:06,925 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,925 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,925 INFO L280 TraceCheckUtils]: 36: Hoare triple {2984#false} ~cond := #in~cond; {2984#false} is VALID [2020-07-10 15:26:06,925 INFO L280 TraceCheckUtils]: 37: Hoare triple {2984#false} assume !(0 == ~cond); {2984#false} is VALID [2020-07-10 15:26:06,925 INFO L280 TraceCheckUtils]: 38: Hoare triple {2984#false} assume true; {2984#false} is VALID [2020-07-10 15:26:06,925 INFO L275 TraceCheckUtils]: 39: Hoare quadruple {2984#false} {2984#false} #82#return; {2984#false} is VALID [2020-07-10 15:26:06,925 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,926 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,926 INFO L280 TraceCheckUtils]: 42: Hoare triple {2984#false} assume !!(~i~1 < 100000); {2984#false} is VALID [2020-07-10 15:26:06,926 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,926 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,926 INFO L280 TraceCheckUtils]: 45: Hoare triple {2984#false} ~cond := #in~cond; {2984#false} is VALID [2020-07-10 15:26:06,926 INFO L280 TraceCheckUtils]: 46: Hoare triple {2984#false} assume 0 == ~cond; {2984#false} is VALID [2020-07-10 15:26:06,926 INFO L280 TraceCheckUtils]: 47: Hoare triple {2984#false} assume !false; {2984#false} is VALID [2020-07-10 15:26:06,928 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,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:06,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9] total 18 [2020-07-10 15:26:06,929 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622736305] [2020-07-10 15:26:06,929 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2020-07-10 15:26:06,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:06,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-10 15:26:07,010 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,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-10 15:26:07,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:07,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-10 15:26:07,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2020-07-10 15:26:07,011 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand 18 states. [2020-07-10 15:26:08,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:08,001 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2020-07-10 15:26:08,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 15:26:08,001 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 48 [2020-07-10 15:26:08,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:08,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:26:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2020-07-10 15:26:08,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 15:26:08,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 62 transitions. [2020-07-10 15:26:08,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 62 transitions. [2020-07-10 15:26:08,086 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,088 INFO L225 Difference]: With dead ends: 86 [2020-07-10 15:26:08,088 INFO L226 Difference]: Without dead ends: 54 [2020-07-10 15:26:08,090 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,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-10 15:26:08,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2020-07-10 15:26:08,154 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:08,154 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 53 states. [2020-07-10 15:26:08,154 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 53 states. [2020-07-10 15:26:08,154 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 53 states. [2020-07-10 15:26:08,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:08,155 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2020-07-10 15:26:08,156 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2020-07-10 15:26:08,156 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:08,156 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:08,156 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 54 states. [2020-07-10 15:26:08,156 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 54 states. [2020-07-10 15:26:08,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:08,158 INFO L93 Difference]: Finished difference Result 54 states and 56 transitions. [2020-07-10 15:26:08,158 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2020-07-10 15:26:08,158 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:08,158 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:08,158 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:08,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:08,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-07-10 15:26:08,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2020-07-10 15:26:08,160 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 48 [2020-07-10 15:26:08,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:08,160 INFO L479 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2020-07-10 15:26:08,161 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-10 15:26:08,161 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2020-07-10 15:26:08,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-07-10 15:26:08,161 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 15:26:08,161 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,371 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,372 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 15:26:08,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 15:26:08,373 INFO L82 PathProgramCache]: Analyzing trace with hash -1797450820, now seen corresponding path program 3 times [2020-07-10 15:26:08,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 15:26:08,373 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112231921] [2020-07-10 15:26:08,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 15:26:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,418 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,418 INFO L280 TraceCheckUtils]: 1: Hoare triple {3487#true} assume true; {3487#true} is VALID [2020-07-10 15:26:08,418 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3487#true} {3487#true} #76#return; {3487#true} is VALID [2020-07-10 15:26:08,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,806 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 (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:08,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {3514#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |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); {3514#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:08,808 INFO L280 TraceCheckUtils]: 2: Hoare triple {3514#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3515#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:08,809 INFO L280 TraceCheckUtils]: 3: Hoare triple {3515#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {3515#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:08,810 INFO L280 TraceCheckUtils]: 4: Hoare triple {3515#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3516#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:08,811 INFO L280 TraceCheckUtils]: 5: Hoare triple {3516#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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 (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:08,812 INFO L280 TraceCheckUtils]: 6: Hoare triple {3516#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3517#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} is VALID [2020-07-10 15:26:08,813 INFO L280 TraceCheckUtils]: 7: Hoare triple {3517#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {3517#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} is VALID [2020-07-10 15:26:08,813 INFO L280 TraceCheckUtils]: 8: Hoare triple {3517#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3518#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:08,815 INFO L280 TraceCheckUtils]: 9: Hoare triple {3518#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |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); {3518#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:08,815 INFO L280 TraceCheckUtils]: 10: Hoare triple {3518#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3519#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 5)))} is VALID [2020-07-10 15:26:08,816 INFO L280 TraceCheckUtils]: 11: Hoare triple {3519#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 5)))} 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 (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 5)))} is VALID [2020-07-10 15:26:08,817 INFO L280 TraceCheckUtils]: 12: Hoare triple {3519#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 5)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3520#(and (or (not (= 100000 init_~size)) (<= init_~i~0 6)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:08,818 INFO L280 TraceCheckUtils]: 13: Hoare triple {3520#(and (or (not (= 100000 init_~size)) (<= init_~i~0 6)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} assume !(~i~0 < ~size); {3521#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:08,818 INFO L280 TraceCheckUtils]: 14: Hoare triple {3521#(not (= |init_#in~size| 100000))} assume true; {3521#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:08,819 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {3521#(not (= |init_#in~size| 100000))} {3487#true} #80#return; {3488#false} is VALID [2020-07-10 15:26:08,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,825 INFO L280 TraceCheckUtils]: 0: Hoare triple {3487#true} ~cond := #in~cond; {3487#true} is VALID [2020-07-10 15:26:08,825 INFO L280 TraceCheckUtils]: 1: Hoare triple {3487#true} assume !(0 == ~cond); {3487#true} is VALID [2020-07-10 15:26:08,826 INFO L280 TraceCheckUtils]: 2: Hoare triple {3487#true} assume true; {3487#true} is VALID [2020-07-10 15:26:08,826 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3487#true} {3488#false} #82#return; {3488#false} is VALID [2020-07-10 15:26:08,827 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,827 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,827 INFO L280 TraceCheckUtils]: 2: Hoare triple {3487#true} assume true; {3487#true} is VALID [2020-07-10 15:26:08,827 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3487#true} {3487#true} #76#return; {3487#true} is VALID [2020-07-10 15:26:08,827 INFO L263 TraceCheckUtils]: 4: Hoare triple {3487#true} call #t~ret6 := main(); {3487#true} is VALID [2020-07-10 15:26:08,827 INFO L280 TraceCheckUtils]: 5: Hoare triple {3487#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {3487#true} is VALID [2020-07-10 15:26:08,828 INFO L263 TraceCheckUtils]: 6: Hoare triple {3487#true} call init(~#a~0.base, ~#a~0.offset, 100000); {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,829 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 (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:08,830 INFO L280 TraceCheckUtils]: 8: Hoare triple {3514#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |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); {3514#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:08,830 INFO L280 TraceCheckUtils]: 9: Hoare triple {3514#(and (or (not (= 100000 init_~size)) (<= init_~i~0 0)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3515#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:08,832 INFO L280 TraceCheckUtils]: 10: Hoare triple {3515#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {3515#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} is VALID [2020-07-10 15:26:08,832 INFO L280 TraceCheckUtils]: 11: Hoare triple {3515#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 1)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3516#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:08,833 INFO L280 TraceCheckUtils]: 12: Hoare triple {3516#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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 (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} is VALID [2020-07-10 15:26:08,834 INFO L280 TraceCheckUtils]: 13: Hoare triple {3516#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 2)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3517#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} is VALID [2020-07-10 15:26:08,835 INFO L280 TraceCheckUtils]: 14: Hoare triple {3517#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 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); {3517#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} is VALID [2020-07-10 15:26:08,836 INFO L280 TraceCheckUtils]: 15: Hoare triple {3517#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 3)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3518#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:08,837 INFO L280 TraceCheckUtils]: 16: Hoare triple {3518#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |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); {3518#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:08,839 INFO L280 TraceCheckUtils]: 17: Hoare triple {3518#(and (or (not (= 100000 init_~size)) (<= init_~i~0 4)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3519#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 5)))} is VALID [2020-07-10 15:26:08,840 INFO L280 TraceCheckUtils]: 18: Hoare triple {3519#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 5)))} 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 (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 5)))} is VALID [2020-07-10 15:26:08,841 INFO L280 TraceCheckUtils]: 19: Hoare triple {3519#(and (or (= 100000 init_~size) (= |init_#in~size| init_~size)) (or (not (= 100000 init_~size)) (<= init_~i~0 5)))} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {3520#(and (or (not (= 100000 init_~size)) (<= init_~i~0 6)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} is VALID [2020-07-10 15:26:08,842 INFO L280 TraceCheckUtils]: 20: Hoare triple {3520#(and (or (not (= 100000 init_~size)) (<= init_~i~0 6)) (or (= 100000 init_~size) (= |init_#in~size| init_~size)))} assume !(~i~0 < ~size); {3521#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:08,842 INFO L280 TraceCheckUtils]: 21: Hoare triple {3521#(not (= |init_#in~size| 100000))} assume true; {3521#(not (= |init_#in~size| 100000))} is VALID [2020-07-10 15:26:08,843 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {3521#(not (= |init_#in~size| 100000))} {3487#true} #80#return; {3488#false} is VALID [2020-07-10 15:26:08,844 INFO L280 TraceCheckUtils]: 23: Hoare triple {3488#false} ~i~1 := 0; {3488#false} is VALID [2020-07-10 15:26:08,844 INFO L280 TraceCheckUtils]: 24: Hoare triple {3488#false} assume !!(~i~1 < 100000);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,844 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,844 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,845 INFO L280 TraceCheckUtils]: 27: Hoare triple {3488#false} assume !!(~i~1 < 100000);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,845 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,845 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,845 INFO L280 TraceCheckUtils]: 30: Hoare triple {3488#false} assume !!(~i~1 < 100000);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,845 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,846 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,846 INFO L280 TraceCheckUtils]: 33: Hoare triple {3488#false} assume !(~i~1 < 100000); {3488#false} is VALID [2020-07-10 15:26:08,846 INFO L280 TraceCheckUtils]: 34: Hoare triple {3488#false} ~i~1 := 0; {3488#false} is VALID [2020-07-10 15:26:08,846 INFO L280 TraceCheckUtils]: 35: Hoare triple {3488#false} assume !!(~i~1 < 100000); {3488#false} is VALID [2020-07-10 15:26:08,847 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,847 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,847 INFO L280 TraceCheckUtils]: 38: Hoare triple {3487#true} ~cond := #in~cond; {3487#true} is VALID [2020-07-10 15:26:08,847 INFO L280 TraceCheckUtils]: 39: Hoare triple {3487#true} assume !(0 == ~cond); {3487#true} is VALID [2020-07-10 15:26:08,847 INFO L280 TraceCheckUtils]: 40: Hoare triple {3487#true} assume true; {3487#true} is VALID [2020-07-10 15:26:08,848 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3487#true} {3488#false} #82#return; {3488#false} is VALID [2020-07-10 15:26:08,848 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,848 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,848 INFO L280 TraceCheckUtils]: 44: Hoare triple {3488#false} assume !!(~i~1 < 100000); {3488#false} is VALID [2020-07-10 15:26:08,849 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,849 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,849 INFO L280 TraceCheckUtils]: 47: Hoare triple {3488#false} ~cond := #in~cond; {3488#false} is VALID [2020-07-10 15:26:08,849 INFO L280 TraceCheckUtils]: 48: Hoare triple {3488#false} assume 0 == ~cond; {3488#false} is VALID [2020-07-10 15:26:08,849 INFO L280 TraceCheckUtils]: 49: Hoare triple {3488#false} assume !false; {3488#false} is VALID [2020-07-10 15:26:08,869 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,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112231921] [2020-07-10 15:26:08,869 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231410818] [2020-07-10 15:26:08,869 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,914 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-07-10 15:26:08,914 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 15:26:08,915 INFO L264 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 24 conjunts are in the unsatisfiable core [2020-07-10 15:26:08,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 15:26:08,931 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 15:26:09,004 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:09,004 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-07-10 15:26:09,013 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:09,019 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:09,020 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2020-07-10 15:26:09,023 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:09,023 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:09,023 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,367 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:09,368 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,372 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-10 15:26:09,376 INFO L544 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-07-10 15:26:09,389 INFO L624 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-07-10 15:26:09,392 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:26:09,406 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,406 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:27 [2020-07-10 15:26:09,410 WARN L406 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2020-07-10 15:26:09,410 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|)))) (< main_~i~1 100000) (= |main_#t~mem3.base| (select .cse0 (+ (* main_~i~1 4) |main_~#a~0.offset|))) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000))) [2020-07-10 15:26:09,410 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|)))) (< main_~i~1 100000) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)) [2020-07-10 15:26:09,413 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-10 15:26:09,577 INFO L263 TraceCheckUtils]: 0: Hoare triple {3487#true} call ULTIMATE.init(); {3487#true} is VALID [2020-07-10 15:26:09,577 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,578 INFO L280 TraceCheckUtils]: 2: Hoare triple {3487#true} assume true; {3487#true} is VALID [2020-07-10 15:26:09,578 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {3487#true} {3487#true} #76#return; {3487#true} is VALID [2020-07-10 15:26:09,578 INFO L263 TraceCheckUtils]: 4: Hoare triple {3487#true} call #t~ret6 := main(); {3487#true} is VALID [2020-07-10 15:26:09,578 INFO L280 TraceCheckUtils]: 5: Hoare triple {3487#true} call ~#a~0.base, ~#a~0.offset := #Ultimate.allocOnStack(400000);havoc ~i~1;havoc ~flag~0;~flag~0 := 0; {3487#true} is VALID [2020-07-10 15:26:09,578 INFO L263 TraceCheckUtils]: 6: Hoare triple {3487#true} call init(~#a~0.base, ~#a~0.offset, 100000); {3487#true} is VALID [2020-07-10 15:26:09,579 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,581 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,582 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,583 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,584 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,585 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,586 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,587 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,588 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,589 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,590 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,592 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,594 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,597 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,598 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,600 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} #80#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|)))) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)))} is VALID [2020-07-10 15:26:09,601 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|)))) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)))} ~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|)))) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)))} is VALID [2020-07-10 15:26:09,601 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|)))) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)))} assume !!(~i~1 < 100000);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|)))) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)))} is VALID [2020-07-10 15:26:09,602 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|)))) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)))} 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|)))) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)))} is VALID [2020-07-10 15:26:09,602 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|)))) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)))} #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|)))) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)))} is VALID [2020-07-10 15:26:09,603 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|)))) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)))} assume !!(~i~1 < 100000);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|)))) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)))} is VALID [2020-07-10 15:26:09,604 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|)))) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)))} 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|)))) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)))} is VALID [2020-07-10 15:26:09,605 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|)))) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)))} #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|)))) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)))} is VALID [2020-07-10 15:26:09,608 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|)))) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)))} assume !!(~i~1 < 100000);call #t~mem3.base, #t~mem3.offset := read~$Pointer$(~#a~0.base, ~#a~0.offset + 4 * ~i~1, 4); {3620#(and (< main_~i~1 100000) (exists ((v_init_~i~0_17 Int)) (and (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000) (or (not (= 0 |main_#t~mem3.base|)) (not (= (* 4 main_~i~1) (* 4 v_init_~i~0_17)))))))} is VALID [2020-07-10 15:26:09,609 INFO L280 TraceCheckUtils]: 31: Hoare triple {3620#(and (< main_~i~1 100000) (exists ((v_init_~i~0_17 Int)) (and (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000) (or (not (= 0 |main_#t~mem3.base|)) (not (= (* 4 main_~i~1) (* 4 v_init_~i~0_17)))))))} assume !(#t~mem3.base != 0 || #t~mem3.offset != 0);havoc #t~mem3.base, #t~mem3.offset; {3624#(<= main_~i~1 99998)} is VALID [2020-07-10 15:26:09,610 INFO L280 TraceCheckUtils]: 32: Hoare triple {3624#(<= main_~i~1 99998)} #t~post2 := ~i~1;~i~1 := 1 + #t~post2;havoc #t~post2; {3628#(<= main_~i~1 99999)} is VALID [2020-07-10 15:26:09,611 INFO L280 TraceCheckUtils]: 33: Hoare triple {3628#(<= main_~i~1 99999)} assume !(~i~1 < 100000); {3488#false} is VALID [2020-07-10 15:26:09,611 INFO L280 TraceCheckUtils]: 34: Hoare triple {3488#false} ~i~1 := 0; {3488#false} is VALID [2020-07-10 15:26:09,611 INFO L280 TraceCheckUtils]: 35: Hoare triple {3488#false} assume !!(~i~1 < 100000); {3488#false} is VALID [2020-07-10 15:26:09,612 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,612 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,612 INFO L280 TraceCheckUtils]: 38: Hoare triple {3488#false} ~cond := #in~cond; {3488#false} is VALID [2020-07-10 15:26:09,612 INFO L280 TraceCheckUtils]: 39: Hoare triple {3488#false} assume !(0 == ~cond); {3488#false} is VALID [2020-07-10 15:26:09,612 INFO L280 TraceCheckUtils]: 40: Hoare triple {3488#false} assume true; {3488#false} is VALID [2020-07-10 15:26:09,612 INFO L275 TraceCheckUtils]: 41: Hoare quadruple {3488#false} {3488#false} #82#return; {3488#false} is VALID [2020-07-10 15:26:09,613 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,613 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,613 INFO L280 TraceCheckUtils]: 44: Hoare triple {3488#false} assume !!(~i~1 < 100000); {3488#false} is VALID [2020-07-10 15:26:09,613 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,613 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,613 INFO L280 TraceCheckUtils]: 47: Hoare triple {3488#false} ~cond := #in~cond; {3488#false} is VALID [2020-07-10 15:26:09,614 INFO L280 TraceCheckUtils]: 48: Hoare triple {3488#false} assume 0 == ~cond; {3488#false} is VALID [2020-07-10 15:26:09,614 INFO L280 TraceCheckUtils]: 49: Hoare triple {3488#false} assume !false; {3488#false} is VALID [2020-07-10 15:26:09,622 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,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 15:26:09,623 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2020-07-10 15:26:09,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227954444] [2020-07-10 15:26:09,625 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2020-07-10 15:26:09,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 15:26:09,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-10 15:26:09,713 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,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-10 15:26:09,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 15:26:09,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-10 15:26:09,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2020-07-10 15:26:09,714 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 20 states. [2020-07-10 15:26:11,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:11,628 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2020-07-10 15:26:11,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-10 15:26:11,628 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 50 [2020-07-10 15:26:11,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 15:26:11,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 15:26:11,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 54 transitions. [2020-07-10 15:26:11,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-10 15:26:11,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 54 transitions. [2020-07-10 15:26:11,632 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 54 transitions. [2020-07-10 15:26:11,734 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,735 INFO L225 Difference]: With dead ends: 69 [2020-07-10 15:26:11,735 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 15:26:11,737 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 323 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=325, Invalid=1397, Unknown=0, NotChecked=0, Total=1722 [2020-07-10 15:26:11,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 15:26:11,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 15:26:11,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 15:26:11,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 15:26:11,738 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:26:11,738 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:26:11,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:11,739 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:26:11,739 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:26:11,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:11,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:11,739 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 15:26:11,739 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 15:26:11,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 15:26:11,740 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 15:26:11,740 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:26:11,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:11,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 15:26:11,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 15:26:11,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 15:26:11,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 15:26:11,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 15:26:11,740 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 50 [2020-07-10 15:26:11,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 15:26:11,741 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 15:26:11,741 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-10 15:26:11,741 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 15:26:11,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 15:26:11,941 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,948 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 15:26:12,297 WARN L193 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41 [2020-07-10 15:26:12,306 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,306 INFO L268 CegarLoopResult]: For program point initEXIT(lines 9 16) no Hoare annotation was computed. [2020-07-10 15:26:12,307 INFO L268 CegarLoopResult]: For program point L12-2(lines 12 15) no Hoare annotation was computed. [2020-07-10 15:26:12,307 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,307 INFO L268 CegarLoopResult]: For program point L12-4(lines 9 16) no Hoare annotation was computed. [2020-07-10 15:26:12,307 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:26:12,307 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,308 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:26:12,308 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 15:26:12,308 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 15:26:12,309 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 15:26:12,309 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 15:26:12,310 INFO L268 CegarLoopResult]: For program point L33(lines 33 34) no Hoare annotation was computed. [2020-07-10 15:26:12,310 INFO L268 CegarLoopResult]: For program point L31-2(lines 31 35) no Hoare annotation was computed. [2020-07-10 15:26:12,310 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,310 INFO L268 CegarLoopResult]: For program point L31-4(lines 31 35) no Hoare annotation was computed. [2020-07-10 15:26:12,310 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 17 37) no Hoare annotation was computed. [2020-07-10 15:26:12,310 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,310 INFO L268 CegarLoopResult]: For program point L23-1(line 23) no Hoare annotation was computed. [2020-07-10 15:26:12,311 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 17 37) no Hoare annotation was computed. [2020-07-10 15:26:12,311 INFO L264 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: false [2020-07-10 15:26:12,311 INFO L268 CegarLoopResult]: For program point L34-1(line 34) no Hoare annotation was computed. [2020-07-10 15:26:12,311 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,311 INFO L268 CegarLoopResult]: For program point L26(lines 26 29) no Hoare annotation was computed. [2020-07-10 15:26:12,311 INFO L268 CegarLoopResult]: For program point L24-2(lines 24 30) no Hoare annotation was computed. [2020-07-10 15:26:12,312 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|)))) (<= 99999 v_init_~i~0_17) (< v_init_~i~0_17 100000)))) (.cse1 (= 0 main_~flag~0)) (.cse2 (= 0 |main_~#a~0.offset|))) (or (and .cse0 (= 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|)) (<= main_~i~1 99999) .cse1 .cse2) (and .cse0 (= 0 main_~i~1) .cse1 .cse2) (<= 1 main_~flag~0))) [2020-07-10 15:26:12,312 INFO L268 CegarLoopResult]: For program point L24-4(lines 24 30) no Hoare annotation was computed. [2020-07-10 15:26:12,312 INFO L268 CegarLoopResult]: For program point L4-3(line 4) no Hoare annotation was computed. [2020-07-10 15:26:12,312 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(line 4) the Hoare annotation is: true [2020-07-10 15:26:12,312 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(line 4) no Hoare annotation was computed. [2020-07-10 15:26:12,313 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 15:26:12,313 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-10 15:26:12,315 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4) no Hoare annotation was computed. [2020-07-10 15:26:12,323 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:12,325 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:26:12,325 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2020-07-10 15:26:12,325 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2020-07-10 15:26:12,325 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-10 15:26:12,325 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-10 15:26:12,325 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:12,326 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:12,327 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:26:12,327 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 15:26:12,328 WARN L170 areAnnotationChecker]: L12-4 has no Hoare annotation [2020-07-10 15:26:12,328 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2020-07-10 15:26:12,328 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 15:26:12,328 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 15:26:12,328 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2020-07-10 15:26:12,328 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-10 15:26:12,328 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-10 15:26:12,328 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-10 15:26:12,328 WARN L170 areAnnotationChecker]: initEXIT has no Hoare annotation [2020-07-10 15:26:12,329 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2020-07-10 15:26:12,329 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2020-07-10 15:26:12,329 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 15:26:12,329 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-10 15:26:12,329 WARN L170 areAnnotationChecker]: L24-4 has no Hoare annotation [2020-07-10 15:26:12,329 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 15:26:12,329 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2020-07-10 15:26:12,329 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-10 15:26:12,329 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-10 15:26:12,329 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-10 15:26:12,330 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 15:26:12,330 WARN L170 areAnnotationChecker]: L24-2 has no Hoare annotation [2020-07-10 15:26:12,330 WARN L170 areAnnotationChecker]: L31-2 has no Hoare annotation [2020-07-10 15:26:12,330 WARN L170 areAnnotationChecker]: L31-4 has no Hoare annotation [2020-07-10 15:26:12,330 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 15:26:12,330 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2020-07-10 15:26:12,330 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-10 15:26:12,330 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2020-07-10 15:26:12,330 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 15:26:12,331 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,345 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,346 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,347 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,347 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,347 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,348 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,349 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,349 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,349 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,349 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,350 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,350 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,350 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,351 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,356 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,356 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,356 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,356 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,357 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,357 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,358 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,358 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,358 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,358 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,359 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,359 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,359 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,359 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,371 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,372 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,372 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,374 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,374 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,374 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,376 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,376 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,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,376 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:26:12,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:26:12,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,377 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,378 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,380 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,380 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,380 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,381 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,382 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,382 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,382 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,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,384 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,385 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:26:12,385 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:26:12,385 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,385 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,388 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,388 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 15:26:12,390 INFO L168 Benchmark]: Toolchain (without parser) took 19048.87 ms. Allocated memory was 137.4 MB in the beginning and 393.7 MB in the end (delta: 256.4 MB). Free memory was 101.0 MB in the beginning and 134.0 MB in the end (delta: -33.0 MB). Peak memory consumption was 223.4 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:12,390 INFO L168 Benchmark]: CDTParser took 0.58 ms. Allocated memory is still 137.4 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 15:26:12,395 INFO L168 Benchmark]: CACSL2BoogieTranslator took 284.90 ms. Allocated memory is still 137.4 MB. Free memory was 101.0 MB in the beginning and 90.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:12,396 INFO L168 Benchmark]: Boogie Preprocessor took 141.98 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 90.0 MB in the beginning and 178.8 MB in the end (delta: -88.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:12,396 INFO L168 Benchmark]: RCFGBuilder took 399.45 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 155.3 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:12,397 INFO L168 Benchmark]: TraceAbstraction took 18210.77 ms. Allocated memory was 201.3 MB in the beginning and 393.7 MB in the end (delta: 192.4 MB). Free memory was 154.3 MB in the beginning and 134.0 MB in the end (delta: 20.3 MB). Peak memory consumption was 212.7 MB. Max. memory is 7.1 GB. [2020-07-10 15:26:12,401 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.58 ms. Allocated memory is still 137.4 MB. Free memory is still 118.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 284.90 ms. Allocated memory is still 137.4 MB. Free memory was 101.0 MB in the beginning and 90.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 141.98 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 90.0 MB in the beginning and 178.8 MB in the end (delta: -88.8 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 399.45 ms. Allocated memory is still 201.3 MB. Free memory was 178.8 MB in the beginning and 155.3 MB in the end (delta: 23.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18210.77 ms. Allocated memory was 201.3 MB in the beginning and 393.7 MB in the end (delta: 192.4 MB). Free memory was 154.3 MB in the beginning and 134.0 MB in the end (delta: 20.3 MB). Peak memory consumption was 212.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: 4]: 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,412 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,412 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,412 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,412 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,413 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,413 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,416 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,416 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,416 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,417 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,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,417 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,418 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,418 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,419 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,419 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,419 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,419 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,420 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,421 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,421 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,422 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,422 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,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,422 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,423 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,423 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]) && 99999 <= v_init_~i~0_17) && v_init_~i~0_17 < 100000) && 0 == #memory_$Pointer$[a][a]) && 0 == #memory_$Pointer$[a][a]) && i <= 99999) && 0 == flag) && 0 == a) || ((((\exists v_init_~i~0_17 : int :: (!(0 == #memory_$Pointer$[a][v_init_~i~0_17 * 4 + a]) && 99999 <= v_init_~i~0_17) && v_init_~i~0_17 < 100000) && 0 == i) && 0 == flag) && 0 == a)) || 1 <= flag - InvariantResult [Line: 12]: Loop Invariant [2020-07-10 15:26:12,426 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,426 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,427 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,427 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,427 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,427 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,428 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,428 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,428 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,429 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:26:12,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:26:12,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,430 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,431 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,431 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,431 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,431 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,431 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,432 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,432 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,432 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,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,432 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,435 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,435 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:26:12,436 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-10 15:26:12,436 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-07-10 15:26:12,436 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: 17.7s, OverallIterations: 11, TraceHistogramMax: 6, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 276 SDtfs, 238 SDslu, 777 SDs, 0 SdLazy, 928 SolverSat, 126 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 484 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 4.9s 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.4s SatisfiabilityAnalysisTime, 5.2s 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...