/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 17:35:48,278 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 17:35:48,281 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 17:35:48,295 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 17:35:48,295 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 17:35:48,296 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 17:35:48,298 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 17:35:48,300 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 17:35:48,301 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 17:35:48,302 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 17:35:48,303 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 17:35:48,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 17:35:48,305 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 17:35:48,306 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 17:35:48,307 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 17:35:48,308 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 17:35:48,309 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 17:35:48,310 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 17:35:48,312 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 17:35:48,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 17:35:48,316 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 17:35:48,317 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 17:35:48,318 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 17:35:48,318 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 17:35:48,321 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 17:35:48,321 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 17:35:48,321 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 17:35:48,322 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 17:35:48,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 17:35:48,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 17:35:48,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 17:35:48,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 17:35:48,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 17:35:48,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 17:35:48,327 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 17:35:48,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 17:35:48,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 17:35:48,328 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 17:35:48,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 17:35:48,330 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 17:35:48,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 17:35:48,331 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-08 17:35:48,341 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 17:35:48,342 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 17:35:48,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 17:35:48,343 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 17:35:48,344 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 17:35:48,344 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 17:35:48,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 17:35:48,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 17:35:48,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 17:35:48,345 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 17:35:48,345 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 17:35:48,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 17:35:48,345 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 17:35:48,345 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 17:35:48,346 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 17:35:48,346 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-08 17:35:48,346 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 17:35:48,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 17:35:48,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 17:35:48,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 17:35:48,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-08 17:35:48,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 17:35:48,348 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-08 17:35:48,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 17:35:48,676 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 17:35:48,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 17:35:48,681 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 17:35:48,682 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 17:35:48,682 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i [2020-07-08 17:35:48,753 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dcf78b15/c4ff6dec42d6401e9e1cedea51d1afb5/FLAGeb6264862 [2020-07-08 17:35:49,306 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 17:35:49,307 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i [2020-07-08 17:35:49,316 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dcf78b15/c4ff6dec42d6401e9e1cedea51d1afb5/FLAGeb6264862 [2020-07-08 17:35:49,614 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2dcf78b15/c4ff6dec42d6401e9e1cedea51d1afb5 [2020-07-08 17:35:49,626 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 17:35:49,628 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 17:35:49,629 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 17:35:49,630 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 17:35:49,634 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 17:35:49,636 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:35:49" (1/1) ... [2020-07-08 17:35:49,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dc01980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:49, skipping insertion in model container [2020-07-08 17:35:49,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 05:35:49" (1/1) ... [2020-07-08 17:35:49,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 17:35:49,670 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 17:35:49,898 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:35:49,912 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 17:35:49,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 17:35:49,969 INFO L208 MainTranslator]: Completed translation [2020-07-08 17:35:49,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:49 WrapperNode [2020-07-08 17:35:49,969 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 17:35:49,970 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 17:35:49,971 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 17:35:49,971 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 17:35:50,094 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:49" (1/1) ... [2020-07-08 17:35:50,094 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:49" (1/1) ... [2020-07-08 17:35:50,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:49" (1/1) ... [2020-07-08 17:35:50,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:49" (1/1) ... [2020-07-08 17:35:50,129 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:49" (1/1) ... [2020-07-08 17:35:50,141 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:49" (1/1) ... [2020-07-08 17:35:50,144 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:49" (1/1) ... [2020-07-08 17:35:50,148 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 17:35:50,149 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 17:35:50,149 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 17:35:50,149 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 17:35:50,150 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 17:35:50,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 17:35:50,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 17:35:50,239 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 17:35:50,239 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2020-07-08 17:35:50,239 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2020-07-08 17:35:50,239 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 17:35:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 17:35:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 17:35:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-08 17:35:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2020-07-08 17:35:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-08 17:35:50,240 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2020-07-08 17:35:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-08 17:35:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 17:35:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-08 17:35:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-08 17:35:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 17:35:50,241 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 17:35:51,014 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 17:35:51,014 INFO L295 CfgBuilder]: Removed 10 assume(true) statements. [2020-07-08 17:35:51,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:35:51 BoogieIcfgContainer [2020-07-08 17:35:51,021 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 17:35:51,022 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 17:35:51,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 17:35:51,027 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 17:35:51,027 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 05:35:49" (1/3) ... [2020-07-08 17:35:51,028 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733e0232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:35:51, skipping insertion in model container [2020-07-08 17:35:51,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 05:35:49" (2/3) ... [2020-07-08 17:35:51,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@733e0232 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 05:35:51, skipping insertion in model container [2020-07-08 17:35:51,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 05:35:51" (3/3) ... [2020-07-08 17:35:51,032 INFO L109 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2020-07-08 17:35:51,044 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-08 17:35:51,054 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 17:35:51,067 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 17:35:51,088 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 17:35:51,089 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 17:35:51,089 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-08 17:35:51,089 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 17:35:51,089 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 17:35:51,090 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 17:35:51,090 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 17:35:51,090 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 17:35:51,109 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2020-07-08 17:35:51,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 17:35:51,123 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:35:51,124 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] [2020-07-08 17:35:51,125 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:35:51,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:35:51,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1588916751, now seen corresponding path program 1 times [2020-07-08 17:35:51,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:35:51,142 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [599524161] [2020-07-08 17:35:51,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:35:51,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:35:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:35:51,425 INFO L280 TraceCheckUtils]: 0: Hoare triple {142#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {135#true} is VALID [2020-07-08 17:35:51,426 INFO L280 TraceCheckUtils]: 1: Hoare triple {135#true} #valid := #valid[0 := 0]; {135#true} is VALID [2020-07-08 17:35:51,427 INFO L280 TraceCheckUtils]: 2: Hoare triple {135#true} assume 0 < #StackHeapBarrier; {135#true} is VALID [2020-07-08 17:35:51,427 INFO L280 TraceCheckUtils]: 3: Hoare triple {135#true} assume true; {135#true} is VALID [2020-07-08 17:35:51,428 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {135#true} {135#true} #247#return; {135#true} is VALID [2020-07-08 17:35:51,433 INFO L263 TraceCheckUtils]: 0: Hoare triple {135#true} call ULTIMATE.init(); {142#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:35:51,433 INFO L280 TraceCheckUtils]: 1: Hoare triple {142#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {135#true} is VALID [2020-07-08 17:35:51,434 INFO L280 TraceCheckUtils]: 2: Hoare triple {135#true} #valid := #valid[0 := 0]; {135#true} is VALID [2020-07-08 17:35:51,434 INFO L280 TraceCheckUtils]: 3: Hoare triple {135#true} assume 0 < #StackHeapBarrier; {135#true} is VALID [2020-07-08 17:35:51,435 INFO L280 TraceCheckUtils]: 4: Hoare triple {135#true} assume true; {135#true} is VALID [2020-07-08 17:35:51,435 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {135#true} {135#true} #247#return; {135#true} is VALID [2020-07-08 17:35:51,435 INFO L263 TraceCheckUtils]: 6: Hoare triple {135#true} call #t~ret23 := main(); {135#true} is VALID [2020-07-08 17:35:51,436 INFO L280 TraceCheckUtils]: 7: Hoare triple {135#true} ~n~0 := 0; {135#true} is VALID [2020-07-08 17:35:51,436 INFO L280 TraceCheckUtils]: 8: Hoare triple {135#true} SUMMARY for call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000); srcloc: L18 {135#true} is VALID [2020-07-08 17:35:51,437 INFO L280 TraceCheckUtils]: 9: Hoare triple {135#true} havoc ~x~0; {135#true} is VALID [2020-07-08 17:35:51,437 INFO L280 TraceCheckUtils]: 10: Hoare triple {135#true} havoc ~y~0; {135#true} is VALID [2020-07-08 17:35:51,437 INFO L280 TraceCheckUtils]: 11: Hoare triple {135#true} ~x~0 := 0; {135#true} is VALID [2020-07-08 17:35:51,441 INFO L280 TraceCheckUtils]: 12: Hoare triple {135#true} assume !true; {136#false} is VALID [2020-07-08 17:35:51,441 INFO L280 TraceCheckUtils]: 13: Hoare triple {136#false} ~x~0 := 0; {136#false} is VALID [2020-07-08 17:35:51,441 INFO L280 TraceCheckUtils]: 14: Hoare triple {136#false} assume !!(~x~0 < ~n~0); {136#false} is VALID [2020-07-08 17:35:51,442 INFO L280 TraceCheckUtils]: 15: Hoare triple {136#false} ~y~0 := 1 + ~x~0; {136#false} is VALID [2020-07-08 17:35:51,442 INFO L280 TraceCheckUtils]: 16: Hoare triple {136#false} assume !!(~y~0 < ~n~0); {136#false} is VALID [2020-07-08 17:35:51,443 INFO L280 TraceCheckUtils]: 17: Hoare triple {136#false} SUMMARY for call #t~mem6 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L30 {136#false} is VALID [2020-07-08 17:35:51,443 INFO L280 TraceCheckUtils]: 18: Hoare triple {136#false} SUMMARY for call #t~mem7 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); srcloc: L30-1 {136#false} is VALID [2020-07-08 17:35:51,444 INFO L263 TraceCheckUtils]: 19: Hoare triple {136#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {136#false} is VALID [2020-07-08 17:35:51,444 INFO L280 TraceCheckUtils]: 20: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2020-07-08 17:35:51,444 INFO L280 TraceCheckUtils]: 21: Hoare triple {136#false} assume 0 == ~cond; {136#false} is VALID [2020-07-08 17:35:51,445 INFO L280 TraceCheckUtils]: 22: Hoare triple {136#false} assume !false; {136#false} is VALID [2020-07-08 17:35:51,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:35:51,449 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:35:51,452 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [599524161] [2020-07-08 17:35:51,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:35:51,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 17:35:51,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452248222] [2020-07-08 17:35:51,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 17:35:51,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:35:51,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 17:35:51,525 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:35:51,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 17:35:51,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:35:51,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 17:35:51,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 17:35:51,541 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 3 states. [2020-07-08 17:35:52,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:35:52,495 INFO L93 Difference]: Finished difference Result 245 states and 295 transitions. [2020-07-08 17:35:52,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 17:35:52,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-08 17:35:52,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:35:52,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 17:35:52,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2020-07-08 17:35:52,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 17:35:52,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2020-07-08 17:35:52,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 295 transitions. [2020-07-08 17:35:52,976 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:35:52,998 INFO L225 Difference]: With dead ends: 245 [2020-07-08 17:35:52,998 INFO L226 Difference]: Without dead ends: 123 [2020-07-08 17:35:53,004 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 17:35:53,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-07-08 17:35:53,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-07-08 17:35:53,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:35:53,178 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 123 states. [2020-07-08 17:35:53,179 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 123 states. [2020-07-08 17:35:53,179 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 123 states. [2020-07-08 17:35:53,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:35:53,192 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2020-07-08 17:35:53,192 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2020-07-08 17:35:53,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:35:53,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:35:53,195 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 123 states. [2020-07-08 17:35:53,195 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 123 states. [2020-07-08 17:35:53,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:35:53,206 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2020-07-08 17:35:53,206 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2020-07-08 17:35:53,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:35:53,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:35:53,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:35:53,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:35:53,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-07-08 17:35:53,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2020-07-08 17:35:53,219 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 23 [2020-07-08 17:35:53,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:35:53,220 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2020-07-08 17:35:53,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 17:35:53,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 123 states and 136 transitions. [2020-07-08 17:35:53,405 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:35:53,406 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2020-07-08 17:35:53,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-08 17:35:53,407 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:35:53,408 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] [2020-07-08 17:35:53,408 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 17:35:53,409 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:35:53,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:35:53,409 INFO L82 PathProgramCache]: Analyzing trace with hash -119454780, now seen corresponding path program 1 times [2020-07-08 17:35:53,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:35:53,410 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1259226164] [2020-07-08 17:35:53,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:35:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:35:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:35:53,502 INFO L280 TraceCheckUtils]: 0: Hoare triple {1135#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1127#true} is VALID [2020-07-08 17:35:53,502 INFO L280 TraceCheckUtils]: 1: Hoare triple {1127#true} #valid := #valid[0 := 0]; {1127#true} is VALID [2020-07-08 17:35:53,503 INFO L280 TraceCheckUtils]: 2: Hoare triple {1127#true} assume 0 < #StackHeapBarrier; {1127#true} is VALID [2020-07-08 17:35:53,503 INFO L280 TraceCheckUtils]: 3: Hoare triple {1127#true} assume true; {1127#true} is VALID [2020-07-08 17:35:53,503 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1127#true} {1127#true} #247#return; {1127#true} is VALID [2020-07-08 17:35:53,505 INFO L263 TraceCheckUtils]: 0: Hoare triple {1127#true} call ULTIMATE.init(); {1135#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:35:53,505 INFO L280 TraceCheckUtils]: 1: Hoare triple {1135#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {1127#true} is VALID [2020-07-08 17:35:53,505 INFO L280 TraceCheckUtils]: 2: Hoare triple {1127#true} #valid := #valid[0 := 0]; {1127#true} is VALID [2020-07-08 17:35:53,505 INFO L280 TraceCheckUtils]: 3: Hoare triple {1127#true} assume 0 < #StackHeapBarrier; {1127#true} is VALID [2020-07-08 17:35:53,506 INFO L280 TraceCheckUtils]: 4: Hoare triple {1127#true} assume true; {1127#true} is VALID [2020-07-08 17:35:53,506 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1127#true} {1127#true} #247#return; {1127#true} is VALID [2020-07-08 17:35:53,506 INFO L263 TraceCheckUtils]: 6: Hoare triple {1127#true} call #t~ret23 := main(); {1127#true} is VALID [2020-07-08 17:35:53,506 INFO L280 TraceCheckUtils]: 7: Hoare triple {1127#true} ~n~0 := 0; {1127#true} is VALID [2020-07-08 17:35:53,507 INFO L280 TraceCheckUtils]: 8: Hoare triple {1127#true} SUMMARY for call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000); srcloc: L18 {1127#true} is VALID [2020-07-08 17:35:53,507 INFO L280 TraceCheckUtils]: 9: Hoare triple {1127#true} havoc ~x~0; {1127#true} is VALID [2020-07-08 17:35:53,507 INFO L280 TraceCheckUtils]: 10: Hoare triple {1127#true} havoc ~y~0; {1127#true} is VALID [2020-07-08 17:35:53,508 INFO L280 TraceCheckUtils]: 11: Hoare triple {1127#true} ~x~0 := 0; {1134#(= 0 main_~x~0)} is VALID [2020-07-08 17:35:53,509 INFO L280 TraceCheckUtils]: 12: Hoare triple {1134#(= 0 main_~x~0)} assume !(~x~0 < 100000); {1128#false} is VALID [2020-07-08 17:35:53,509 INFO L280 TraceCheckUtils]: 13: Hoare triple {1128#false} ~x~0 := 0; {1128#false} is VALID [2020-07-08 17:35:53,509 INFO L280 TraceCheckUtils]: 14: Hoare triple {1128#false} assume !!(~x~0 < ~n~0); {1128#false} is VALID [2020-07-08 17:35:53,510 INFO L280 TraceCheckUtils]: 15: Hoare triple {1128#false} ~y~0 := 1 + ~x~0; {1128#false} is VALID [2020-07-08 17:35:53,510 INFO L280 TraceCheckUtils]: 16: Hoare triple {1128#false} assume !!(~y~0 < ~n~0); {1128#false} is VALID [2020-07-08 17:35:53,510 INFO L280 TraceCheckUtils]: 17: Hoare triple {1128#false} SUMMARY for call #t~mem6 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L30 {1128#false} is VALID [2020-07-08 17:35:53,511 INFO L280 TraceCheckUtils]: 18: Hoare triple {1128#false} SUMMARY for call #t~mem7 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); srcloc: L30-1 {1128#false} is VALID [2020-07-08 17:35:53,511 INFO L263 TraceCheckUtils]: 19: Hoare triple {1128#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {1128#false} is VALID [2020-07-08 17:35:53,511 INFO L280 TraceCheckUtils]: 20: Hoare triple {1128#false} ~cond := #in~cond; {1128#false} is VALID [2020-07-08 17:35:53,512 INFO L280 TraceCheckUtils]: 21: Hoare triple {1128#false} assume 0 == ~cond; {1128#false} is VALID [2020-07-08 17:35:53,512 INFO L280 TraceCheckUtils]: 22: Hoare triple {1128#false} assume !false; {1128#false} is VALID [2020-07-08 17:35:53,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:35:53,514 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:35:53,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1259226164] [2020-07-08 17:35:53,514 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:35:53,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-08 17:35:53,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900075988] [2020-07-08 17:35:53,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-08 17:35:53,516 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:35:53,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-08 17:35:53,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:35:53,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-08 17:35:53,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:35:53,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-08 17:35:53,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 17:35:53,547 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 4 states. [2020-07-08 17:35:54,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:35:54,522 INFO L93 Difference]: Finished difference Result 303 states and 342 transitions. [2020-07-08 17:35:54,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-08 17:35:54,523 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-08 17:35:54,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:35:54,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 17:35:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2020-07-08 17:35:54,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-08 17:35:54,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2020-07-08 17:35:54,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 342 transitions. [2020-07-08 17:35:54,908 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 342 edges. 342 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:35:54,924 INFO L225 Difference]: With dead ends: 303 [2020-07-08 17:35:54,924 INFO L226 Difference]: Without dead ends: 199 [2020-07-08 17:35:54,928 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-08 17:35:54,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-07-08 17:35:55,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 124. [2020-07-08 17:35:55,078 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:35:55,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand 124 states. [2020-07-08 17:35:55,079 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 124 states. [2020-07-08 17:35:55,079 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 124 states. [2020-07-08 17:35:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:35:55,098 INFO L93 Difference]: Finished difference Result 199 states and 225 transitions. [2020-07-08 17:35:55,098 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 225 transitions. [2020-07-08 17:35:55,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:35:55,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:35:55,102 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 199 states. [2020-07-08 17:35:55,102 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 199 states. [2020-07-08 17:35:55,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:35:55,120 INFO L93 Difference]: Finished difference Result 199 states and 225 transitions. [2020-07-08 17:35:55,120 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 225 transitions. [2020-07-08 17:35:55,122 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:35:55,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:35:55,122 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:35:55,123 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:35:55,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-07-08 17:35:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2020-07-08 17:35:55,132 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 23 [2020-07-08 17:35:55,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:35:55,132 INFO L479 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2020-07-08 17:35:55,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-08 17:35:55,132 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 124 states and 137 transitions. [2020-07-08 17:35:55,288 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:35:55,288 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2020-07-08 17:35:55,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 17:35:55,289 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:35:55,290 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:35:55,290 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 17:35:55,290 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:35:55,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:35:55,291 INFO L82 PathProgramCache]: Analyzing trace with hash -395870253, now seen corresponding path program 1 times [2020-07-08 17:35:55,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:35:55,291 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [880832919] [2020-07-08 17:35:55,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:35:55,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:35:55,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:35:55,434 INFO L280 TraceCheckUtils]: 0: Hoare triple {2400#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2390#true} is VALID [2020-07-08 17:35:55,434 INFO L280 TraceCheckUtils]: 1: Hoare triple {2390#true} #valid := #valid[0 := 0]; {2390#true} is VALID [2020-07-08 17:35:55,435 INFO L280 TraceCheckUtils]: 2: Hoare triple {2390#true} assume 0 < #StackHeapBarrier; {2390#true} is VALID [2020-07-08 17:35:55,435 INFO L280 TraceCheckUtils]: 3: Hoare triple {2390#true} assume true; {2390#true} is VALID [2020-07-08 17:35:55,435 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2390#true} {2390#true} #247#return; {2390#true} is VALID [2020-07-08 17:35:55,437 INFO L263 TraceCheckUtils]: 0: Hoare triple {2390#true} call ULTIMATE.init(); {2400#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:35:55,437 INFO L280 TraceCheckUtils]: 1: Hoare triple {2400#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {2390#true} is VALID [2020-07-08 17:35:55,437 INFO L280 TraceCheckUtils]: 2: Hoare triple {2390#true} #valid := #valid[0 := 0]; {2390#true} is VALID [2020-07-08 17:35:55,438 INFO L280 TraceCheckUtils]: 3: Hoare triple {2390#true} assume 0 < #StackHeapBarrier; {2390#true} is VALID [2020-07-08 17:35:55,438 INFO L280 TraceCheckUtils]: 4: Hoare triple {2390#true} assume true; {2390#true} is VALID [2020-07-08 17:35:55,438 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2390#true} {2390#true} #247#return; {2390#true} is VALID [2020-07-08 17:35:55,439 INFO L263 TraceCheckUtils]: 6: Hoare triple {2390#true} call #t~ret23 := main(); {2390#true} is VALID [2020-07-08 17:35:55,439 INFO L280 TraceCheckUtils]: 7: Hoare triple {2390#true} ~n~0 := 0; {2390#true} is VALID [2020-07-08 17:35:55,439 INFO L280 TraceCheckUtils]: 8: Hoare triple {2390#true} SUMMARY for call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000); srcloc: L18 {2390#true} is VALID [2020-07-08 17:35:55,440 INFO L280 TraceCheckUtils]: 9: Hoare triple {2390#true} havoc ~x~0; {2390#true} is VALID [2020-07-08 17:35:55,440 INFO L280 TraceCheckUtils]: 10: Hoare triple {2390#true} havoc ~y~0; {2390#true} is VALID [2020-07-08 17:35:55,441 INFO L280 TraceCheckUtils]: 11: Hoare triple {2390#true} ~x~0 := 0; {2397#(= 0 main_~x~0)} is VALID [2020-07-08 17:35:55,442 INFO L280 TraceCheckUtils]: 12: Hoare triple {2397#(= 0 main_~x~0)} assume !!(~x~0 < 100000); {2397#(= 0 main_~x~0)} is VALID [2020-07-08 17:35:55,443 INFO L280 TraceCheckUtils]: 13: Hoare triple {2397#(= 0 main_~x~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {2397#(= 0 main_~x~0)} is VALID [2020-07-08 17:35:55,443 INFO L280 TraceCheckUtils]: 14: Hoare triple {2397#(= 0 main_~x~0)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {2397#(= 0 main_~x~0)} is VALID [2020-07-08 17:35:55,444 INFO L280 TraceCheckUtils]: 15: Hoare triple {2397#(= 0 main_~x~0)} havoc #t~nondet3; {2397#(= 0 main_~x~0)} is VALID [2020-07-08 17:35:55,445 INFO L280 TraceCheckUtils]: 16: Hoare triple {2397#(= 0 main_~x~0)} #t~post2 := ~x~0; {2398#(= |main_#t~post2| 0)} is VALID [2020-07-08 17:35:55,446 INFO L280 TraceCheckUtils]: 17: Hoare triple {2398#(= |main_#t~post2| 0)} ~x~0 := 1 + #t~post2; {2399#(<= main_~x~0 1)} is VALID [2020-07-08 17:35:55,447 INFO L280 TraceCheckUtils]: 18: Hoare triple {2399#(<= main_~x~0 1)} havoc #t~post2; {2399#(<= main_~x~0 1)} is VALID [2020-07-08 17:35:55,447 INFO L280 TraceCheckUtils]: 19: Hoare triple {2399#(<= main_~x~0 1)} assume !(~x~0 < 100000); {2391#false} is VALID [2020-07-08 17:35:55,448 INFO L280 TraceCheckUtils]: 20: Hoare triple {2391#false} ~x~0 := 0; {2391#false} is VALID [2020-07-08 17:35:55,448 INFO L280 TraceCheckUtils]: 21: Hoare triple {2391#false} assume !!(~x~0 < ~n~0); {2391#false} is VALID [2020-07-08 17:35:55,448 INFO L280 TraceCheckUtils]: 22: Hoare triple {2391#false} ~y~0 := 1 + ~x~0; {2391#false} is VALID [2020-07-08 17:35:55,449 INFO L280 TraceCheckUtils]: 23: Hoare triple {2391#false} assume !!(~y~0 < ~n~0); {2391#false} is VALID [2020-07-08 17:35:55,449 INFO L280 TraceCheckUtils]: 24: Hoare triple {2391#false} SUMMARY for call #t~mem6 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L30 {2391#false} is VALID [2020-07-08 17:35:55,449 INFO L280 TraceCheckUtils]: 25: Hoare triple {2391#false} SUMMARY for call #t~mem7 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); srcloc: L30-1 {2391#false} is VALID [2020-07-08 17:35:55,450 INFO L263 TraceCheckUtils]: 26: Hoare triple {2391#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {2391#false} is VALID [2020-07-08 17:35:55,450 INFO L280 TraceCheckUtils]: 27: Hoare triple {2391#false} ~cond := #in~cond; {2391#false} is VALID [2020-07-08 17:35:55,450 INFO L280 TraceCheckUtils]: 28: Hoare triple {2391#false} assume 0 == ~cond; {2391#false} is VALID [2020-07-08 17:35:55,451 INFO L280 TraceCheckUtils]: 29: Hoare triple {2391#false} assume !false; {2391#false} is VALID [2020-07-08 17:35:55,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:35:55,453 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:35:55,453 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [880832919] [2020-07-08 17:35:55,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:35:55,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-08 17:35:55,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000465753] [2020-07-08 17:35:55,454 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-08 17:35:55,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:35:55,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-08 17:35:55,485 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:35:55,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-08 17:35:55,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:35:55,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-08 17:35:55,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-08 17:35:55,487 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand 6 states. [2020-07-08 17:35:56,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:35:56,831 INFO L93 Difference]: Finished difference Result 310 states and 349 transitions. [2020-07-08 17:35:56,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 17:35:56,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-08 17:35:56,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:35:56,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 17:35:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 349 transitions. [2020-07-08 17:35:56,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-08 17:35:56,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 349 transitions. [2020-07-08 17:35:56,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 349 transitions. [2020-07-08 17:35:57,221 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 349 edges. 349 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:35:57,228 INFO L225 Difference]: With dead ends: 310 [2020-07-08 17:35:57,228 INFO L226 Difference]: Without dead ends: 206 [2020-07-08 17:35:57,229 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-07-08 17:35:57,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-08 17:35:57,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 131. [2020-07-08 17:35:57,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:35:57,330 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 131 states. [2020-07-08 17:35:57,330 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 131 states. [2020-07-08 17:35:57,330 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 131 states. [2020-07-08 17:35:57,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:35:57,344 INFO L93 Difference]: Finished difference Result 206 states and 232 transitions. [2020-07-08 17:35:57,345 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 232 transitions. [2020-07-08 17:35:57,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:35:57,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:35:57,346 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 206 states. [2020-07-08 17:35:57,347 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 206 states. [2020-07-08 17:35:57,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:35:57,357 INFO L93 Difference]: Finished difference Result 206 states and 232 transitions. [2020-07-08 17:35:57,357 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 232 transitions. [2020-07-08 17:35:57,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:35:57,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:35:57,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:35:57,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:35:57,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-07-08 17:35:57,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2020-07-08 17:35:57,364 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 30 [2020-07-08 17:35:57,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:35:57,364 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2020-07-08 17:35:57,364 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-08 17:35:57,365 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 131 states and 144 transitions. [2020-07-08 17:35:57,545 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:35:57,546 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2020-07-08 17:35:57,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-08 17:35:57,547 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:35:57,548 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:35:57,548 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-08 17:35:57,548 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:35:57,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:35:57,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1926718692, now seen corresponding path program 2 times [2020-07-08 17:35:57,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:35:57,549 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1219822546] [2020-07-08 17:35:57,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:35:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:35:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:35:57,703 INFO L280 TraceCheckUtils]: 0: Hoare triple {3713#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3701#true} is VALID [2020-07-08 17:35:57,703 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} #valid := #valid[0 := 0]; {3701#true} is VALID [2020-07-08 17:35:57,704 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume 0 < #StackHeapBarrier; {3701#true} is VALID [2020-07-08 17:35:57,704 INFO L280 TraceCheckUtils]: 3: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-08 17:35:57,704 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3701#true} {3701#true} #247#return; {3701#true} is VALID [2020-07-08 17:35:57,706 INFO L263 TraceCheckUtils]: 0: Hoare triple {3701#true} call ULTIMATE.init(); {3713#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:35:57,706 INFO L280 TraceCheckUtils]: 1: Hoare triple {3713#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {3701#true} is VALID [2020-07-08 17:35:57,706 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} #valid := #valid[0 := 0]; {3701#true} is VALID [2020-07-08 17:35:57,707 INFO L280 TraceCheckUtils]: 3: Hoare triple {3701#true} assume 0 < #StackHeapBarrier; {3701#true} is VALID [2020-07-08 17:35:57,707 INFO L280 TraceCheckUtils]: 4: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-08 17:35:57,707 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3701#true} {3701#true} #247#return; {3701#true} is VALID [2020-07-08 17:35:57,707 INFO L263 TraceCheckUtils]: 6: Hoare triple {3701#true} call #t~ret23 := main(); {3701#true} is VALID [2020-07-08 17:35:57,708 INFO L280 TraceCheckUtils]: 7: Hoare triple {3701#true} ~n~0 := 0; {3701#true} is VALID [2020-07-08 17:35:57,708 INFO L280 TraceCheckUtils]: 8: Hoare triple {3701#true} SUMMARY for call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000); srcloc: L18 {3701#true} is VALID [2020-07-08 17:35:57,708 INFO L280 TraceCheckUtils]: 9: Hoare triple {3701#true} havoc ~x~0; {3701#true} is VALID [2020-07-08 17:35:57,709 INFO L280 TraceCheckUtils]: 10: Hoare triple {3701#true} havoc ~y~0; {3701#true} is VALID [2020-07-08 17:35:57,710 INFO L280 TraceCheckUtils]: 11: Hoare triple {3701#true} ~x~0 := 0; {3708#(= 0 main_~x~0)} is VALID [2020-07-08 17:35:57,712 INFO L280 TraceCheckUtils]: 12: Hoare triple {3708#(= 0 main_~x~0)} assume !!(~x~0 < 100000); {3708#(= 0 main_~x~0)} is VALID [2020-07-08 17:35:57,713 INFO L280 TraceCheckUtils]: 13: Hoare triple {3708#(= 0 main_~x~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3708#(= 0 main_~x~0)} is VALID [2020-07-08 17:35:57,714 INFO L280 TraceCheckUtils]: 14: Hoare triple {3708#(= 0 main_~x~0)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {3708#(= 0 main_~x~0)} is VALID [2020-07-08 17:35:57,714 INFO L280 TraceCheckUtils]: 15: Hoare triple {3708#(= 0 main_~x~0)} havoc #t~nondet3; {3708#(= 0 main_~x~0)} is VALID [2020-07-08 17:35:57,715 INFO L280 TraceCheckUtils]: 16: Hoare triple {3708#(= 0 main_~x~0)} #t~post2 := ~x~0; {3709#(= |main_#t~post2| 0)} is VALID [2020-07-08 17:35:57,715 INFO L280 TraceCheckUtils]: 17: Hoare triple {3709#(= |main_#t~post2| 0)} ~x~0 := 1 + #t~post2; {3710#(<= main_~x~0 1)} is VALID [2020-07-08 17:35:57,716 INFO L280 TraceCheckUtils]: 18: Hoare triple {3710#(<= main_~x~0 1)} havoc #t~post2; {3710#(<= main_~x~0 1)} is VALID [2020-07-08 17:35:57,716 INFO L280 TraceCheckUtils]: 19: Hoare triple {3710#(<= main_~x~0 1)} assume !!(~x~0 < 100000); {3710#(<= main_~x~0 1)} is VALID [2020-07-08 17:35:57,717 INFO L280 TraceCheckUtils]: 20: Hoare triple {3710#(<= main_~x~0 1)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {3710#(<= main_~x~0 1)} is VALID [2020-07-08 17:35:57,717 INFO L280 TraceCheckUtils]: 21: Hoare triple {3710#(<= main_~x~0 1)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {3710#(<= main_~x~0 1)} is VALID [2020-07-08 17:35:57,722 INFO L280 TraceCheckUtils]: 22: Hoare triple {3710#(<= main_~x~0 1)} havoc #t~nondet3; {3710#(<= main_~x~0 1)} is VALID [2020-07-08 17:35:57,729 INFO L280 TraceCheckUtils]: 23: Hoare triple {3710#(<= main_~x~0 1)} #t~post2 := ~x~0; {3711#(<= |main_#t~post2| 1)} is VALID [2020-07-08 17:35:57,730 INFO L280 TraceCheckUtils]: 24: Hoare triple {3711#(<= |main_#t~post2| 1)} ~x~0 := 1 + #t~post2; {3712#(<= main_~x~0 2)} is VALID [2020-07-08 17:35:57,735 INFO L280 TraceCheckUtils]: 25: Hoare triple {3712#(<= main_~x~0 2)} havoc #t~post2; {3712#(<= main_~x~0 2)} is VALID [2020-07-08 17:35:57,742 INFO L280 TraceCheckUtils]: 26: Hoare triple {3712#(<= main_~x~0 2)} assume !(~x~0 < 100000); {3702#false} is VALID [2020-07-08 17:35:57,743 INFO L280 TraceCheckUtils]: 27: Hoare triple {3702#false} ~x~0 := 0; {3702#false} is VALID [2020-07-08 17:35:57,743 INFO L280 TraceCheckUtils]: 28: Hoare triple {3702#false} assume !!(~x~0 < ~n~0); {3702#false} is VALID [2020-07-08 17:35:57,746 INFO L280 TraceCheckUtils]: 29: Hoare triple {3702#false} ~y~0 := 1 + ~x~0; {3702#false} is VALID [2020-07-08 17:35:57,747 INFO L280 TraceCheckUtils]: 30: Hoare triple {3702#false} assume !!(~y~0 < ~n~0); {3702#false} is VALID [2020-07-08 17:35:57,747 INFO L280 TraceCheckUtils]: 31: Hoare triple {3702#false} SUMMARY for call #t~mem6 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L30 {3702#false} is VALID [2020-07-08 17:35:57,748 INFO L280 TraceCheckUtils]: 32: Hoare triple {3702#false} SUMMARY for call #t~mem7 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); srcloc: L30-1 {3702#false} is VALID [2020-07-08 17:35:57,748 INFO L263 TraceCheckUtils]: 33: Hoare triple {3702#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {3702#false} is VALID [2020-07-08 17:35:57,748 INFO L280 TraceCheckUtils]: 34: Hoare triple {3702#false} ~cond := #in~cond; {3702#false} is VALID [2020-07-08 17:35:57,748 INFO L280 TraceCheckUtils]: 35: Hoare triple {3702#false} assume 0 == ~cond; {3702#false} is VALID [2020-07-08 17:35:57,749 INFO L280 TraceCheckUtils]: 36: Hoare triple {3702#false} assume !false; {3702#false} is VALID [2020-07-08 17:35:57,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:35:57,751 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:35:57,752 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1219822546] [2020-07-08 17:35:57,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:35:57,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-08 17:35:57,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701665143] [2020-07-08 17:35:57,753 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2020-07-08 17:35:57,754 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:35:57,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 17:35:57,798 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:35:57,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 17:35:57,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:35:57,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 17:35:57,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-08 17:35:57,800 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand 8 states. [2020-07-08 17:35:59,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:35:59,196 INFO L93 Difference]: Finished difference Result 317 states and 356 transitions. [2020-07-08 17:35:59,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-08 17:35:59,196 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2020-07-08 17:35:59,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:35:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 17:35:59,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 356 transitions. [2020-07-08 17:35:59,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 17:35:59,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 356 transitions. [2020-07-08 17:35:59,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 356 transitions. [2020-07-08 17:35:59,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:35:59,610 INFO L225 Difference]: With dead ends: 317 [2020-07-08 17:35:59,610 INFO L226 Difference]: Without dead ends: 213 [2020-07-08 17:35:59,612 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-07-08 17:35:59,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-07-08 17:35:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 138. [2020-07-08 17:35:59,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:35:59,753 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand 138 states. [2020-07-08 17:35:59,753 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 138 states. [2020-07-08 17:35:59,754 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 138 states. [2020-07-08 17:35:59,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:35:59,766 INFO L93 Difference]: Finished difference Result 213 states and 239 transitions. [2020-07-08 17:35:59,767 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 239 transitions. [2020-07-08 17:35:59,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:35:59,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:35:59,769 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 213 states. [2020-07-08 17:35:59,769 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 213 states. [2020-07-08 17:35:59,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:35:59,780 INFO L93 Difference]: Finished difference Result 213 states and 239 transitions. [2020-07-08 17:35:59,780 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 239 transitions. [2020-07-08 17:35:59,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:35:59,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:35:59,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:35:59,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:35:59,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-07-08 17:35:59,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 151 transitions. [2020-07-08 17:35:59,789 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 151 transitions. Word has length 37 [2020-07-08 17:35:59,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:35:59,789 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 151 transitions. [2020-07-08 17:35:59,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 17:35:59,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 138 states and 151 transitions. [2020-07-08 17:35:59,962 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:35:59,962 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 151 transitions. [2020-07-08 17:35:59,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-08 17:35:59,964 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:35:59,964 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1] [2020-07-08 17:35:59,964 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 17:35:59,965 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:35:59,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:35:59,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1889524403, now seen corresponding path program 3 times [2020-07-08 17:35:59,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:35:59,966 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [425878307] [2020-07-08 17:35:59,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:36:00,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:00,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:00,158 INFO L280 TraceCheckUtils]: 0: Hoare triple {5069#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5060#true} is VALID [2020-07-08 17:36:00,159 INFO L280 TraceCheckUtils]: 1: Hoare triple {5060#true} #valid := #valid[0 := 0]; {5060#true} is VALID [2020-07-08 17:36:00,159 INFO L280 TraceCheckUtils]: 2: Hoare triple {5060#true} assume 0 < #StackHeapBarrier; {5060#true} is VALID [2020-07-08 17:36:00,159 INFO L280 TraceCheckUtils]: 3: Hoare triple {5060#true} assume true; {5060#true} is VALID [2020-07-08 17:36:00,160 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5060#true} {5060#true} #247#return; {5060#true} is VALID [2020-07-08 17:36:00,161 INFO L263 TraceCheckUtils]: 0: Hoare triple {5060#true} call ULTIMATE.init(); {5069#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:36:00,161 INFO L280 TraceCheckUtils]: 1: Hoare triple {5069#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {5060#true} is VALID [2020-07-08 17:36:00,162 INFO L280 TraceCheckUtils]: 2: Hoare triple {5060#true} #valid := #valid[0 := 0]; {5060#true} is VALID [2020-07-08 17:36:00,162 INFO L280 TraceCheckUtils]: 3: Hoare triple {5060#true} assume 0 < #StackHeapBarrier; {5060#true} is VALID [2020-07-08 17:36:00,162 INFO L280 TraceCheckUtils]: 4: Hoare triple {5060#true} assume true; {5060#true} is VALID [2020-07-08 17:36:00,162 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5060#true} {5060#true} #247#return; {5060#true} is VALID [2020-07-08 17:36:00,162 INFO L263 TraceCheckUtils]: 6: Hoare triple {5060#true} call #t~ret23 := main(); {5060#true} is VALID [2020-07-08 17:36:00,163 INFO L280 TraceCheckUtils]: 7: Hoare triple {5060#true} ~n~0 := 0; {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,164 INFO L280 TraceCheckUtils]: 8: Hoare triple {5067#(= 0 main_~n~0)} SUMMARY for call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000); srcloc: L18 {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,164 INFO L280 TraceCheckUtils]: 9: Hoare triple {5067#(= 0 main_~n~0)} havoc ~x~0; {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,165 INFO L280 TraceCheckUtils]: 10: Hoare triple {5067#(= 0 main_~n~0)} havoc ~y~0; {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,165 INFO L280 TraceCheckUtils]: 11: Hoare triple {5067#(= 0 main_~n~0)} ~x~0 := 0; {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,166 INFO L280 TraceCheckUtils]: 12: Hoare triple {5067#(= 0 main_~n~0)} assume !!(~x~0 < 100000); {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,167 INFO L280 TraceCheckUtils]: 13: Hoare triple {5067#(= 0 main_~n~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,167 INFO L280 TraceCheckUtils]: 14: Hoare triple {5067#(= 0 main_~n~0)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,168 INFO L280 TraceCheckUtils]: 15: Hoare triple {5067#(= 0 main_~n~0)} havoc #t~nondet3; {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,168 INFO L280 TraceCheckUtils]: 16: Hoare triple {5067#(= 0 main_~n~0)} #t~post2 := ~x~0; {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,170 INFO L280 TraceCheckUtils]: 17: Hoare triple {5067#(= 0 main_~n~0)} ~x~0 := 1 + #t~post2; {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,171 INFO L280 TraceCheckUtils]: 18: Hoare triple {5067#(= 0 main_~n~0)} havoc #t~post2; {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,172 INFO L280 TraceCheckUtils]: 19: Hoare triple {5067#(= 0 main_~n~0)} assume !!(~x~0 < 100000); {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,173 INFO L280 TraceCheckUtils]: 20: Hoare triple {5067#(= 0 main_~n~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,173 INFO L280 TraceCheckUtils]: 21: Hoare triple {5067#(= 0 main_~n~0)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,174 INFO L280 TraceCheckUtils]: 22: Hoare triple {5067#(= 0 main_~n~0)} havoc #t~nondet3; {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,175 INFO L280 TraceCheckUtils]: 23: Hoare triple {5067#(= 0 main_~n~0)} #t~post2 := ~x~0; {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,176 INFO L280 TraceCheckUtils]: 24: Hoare triple {5067#(= 0 main_~n~0)} ~x~0 := 1 + #t~post2; {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,176 INFO L280 TraceCheckUtils]: 25: Hoare triple {5067#(= 0 main_~n~0)} havoc #t~post2; {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,178 INFO L280 TraceCheckUtils]: 26: Hoare triple {5067#(= 0 main_~n~0)} assume !!(~x~0 < 100000); {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,180 INFO L280 TraceCheckUtils]: 27: Hoare triple {5067#(= 0 main_~n~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,185 INFO L280 TraceCheckUtils]: 28: Hoare triple {5067#(= 0 main_~n~0)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,186 INFO L280 TraceCheckUtils]: 29: Hoare triple {5067#(= 0 main_~n~0)} havoc #t~nondet3; {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,186 INFO L280 TraceCheckUtils]: 30: Hoare triple {5067#(= 0 main_~n~0)} #t~post2 := ~x~0; {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,187 INFO L280 TraceCheckUtils]: 31: Hoare triple {5067#(= 0 main_~n~0)} ~x~0 := 1 + #t~post2; {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,187 INFO L280 TraceCheckUtils]: 32: Hoare triple {5067#(= 0 main_~n~0)} havoc #t~post2; {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,188 INFO L280 TraceCheckUtils]: 33: Hoare triple {5067#(= 0 main_~n~0)} assume !(~x~0 < 100000); {5067#(= 0 main_~n~0)} is VALID [2020-07-08 17:36:00,189 INFO L280 TraceCheckUtils]: 34: Hoare triple {5067#(= 0 main_~n~0)} ~x~0 := 0; {5068#(and (= 0 main_~n~0) (= 0 main_~x~0))} is VALID [2020-07-08 17:36:00,189 INFO L280 TraceCheckUtils]: 35: Hoare triple {5068#(and (= 0 main_~n~0) (= 0 main_~x~0))} assume !!(~x~0 < ~n~0); {5061#false} is VALID [2020-07-08 17:36:00,189 INFO L280 TraceCheckUtils]: 36: Hoare triple {5061#false} ~y~0 := 1 + ~x~0; {5061#false} is VALID [2020-07-08 17:36:00,190 INFO L280 TraceCheckUtils]: 37: Hoare triple {5061#false} assume !!(~y~0 < ~n~0); {5061#false} is VALID [2020-07-08 17:36:00,190 INFO L280 TraceCheckUtils]: 38: Hoare triple {5061#false} SUMMARY for call #t~mem6 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L30 {5061#false} is VALID [2020-07-08 17:36:00,190 INFO L280 TraceCheckUtils]: 39: Hoare triple {5061#false} SUMMARY for call #t~mem7 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); srcloc: L30-1 {5061#false} is VALID [2020-07-08 17:36:00,191 INFO L263 TraceCheckUtils]: 40: Hoare triple {5061#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {5061#false} is VALID [2020-07-08 17:36:00,191 INFO L280 TraceCheckUtils]: 41: Hoare triple {5061#false} ~cond := #in~cond; {5061#false} is VALID [2020-07-08 17:36:00,191 INFO L280 TraceCheckUtils]: 42: Hoare triple {5061#false} assume 0 == ~cond; {5061#false} is VALID [2020-07-08 17:36:00,191 INFO L280 TraceCheckUtils]: 43: Hoare triple {5061#false} assume !false; {5061#false} is VALID [2020-07-08 17:36:00,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:36:00,194 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:36:00,195 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [425878307] [2020-07-08 17:36:00,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:36:00,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 17:36:00,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72797820] [2020-07-08 17:36:00,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2020-07-08 17:36:00,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:36:00,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 17:36:00,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:00,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 17:36:00,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:36:00,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 17:36:00,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-08 17:36:00,227 INFO L87 Difference]: Start difference. First operand 138 states and 151 transitions. Second operand 5 states. [2020-07-08 17:36:00,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:00,981 INFO L93 Difference]: Finished difference Result 248 states and 276 transitions. [2020-07-08 17:36:00,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 17:36:00,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2020-07-08 17:36:00,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:36:00,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:36:00,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 267 transitions. [2020-07-08 17:36:00,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:36:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 267 transitions. [2020-07-08 17:36:00,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 267 transitions. [2020-07-08 17:36:01,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:01,290 INFO L225 Difference]: With dead ends: 248 [2020-07-08 17:36:01,290 INFO L226 Difference]: Without dead ends: 143 [2020-07-08 17:36:01,291 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-08 17:36:01,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-07-08 17:36:01,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2020-07-08 17:36:01,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:36:01,425 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 137 states. [2020-07-08 17:36:01,425 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 137 states. [2020-07-08 17:36:01,425 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 137 states. [2020-07-08 17:36:01,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:01,439 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2020-07-08 17:36:01,439 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2020-07-08 17:36:01,440 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:01,440 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:01,440 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 143 states. [2020-07-08 17:36:01,440 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 143 states. [2020-07-08 17:36:01,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:01,446 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2020-07-08 17:36:01,446 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2020-07-08 17:36:01,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:01,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:01,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:36:01,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:36:01,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-07-08 17:36:01,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2020-07-08 17:36:01,453 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 44 [2020-07-08 17:36:01,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:36:01,453 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2020-07-08 17:36:01,453 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 17:36:01,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 137 states and 149 transitions. [2020-07-08 17:36:01,616 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:01,617 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2020-07-08 17:36:01,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-07-08 17:36:01,619 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:36:01,620 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:36:01,620 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-08 17:36:01,620 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:36:01,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:36:01,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1581132658, now seen corresponding path program 1 times [2020-07-08 17:36:01,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:36:01,621 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1327565793] [2020-07-08 17:36:01,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:36:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:01,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:01,806 INFO L280 TraceCheckUtils]: 0: Hoare triple {6160#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6130#true} is VALID [2020-07-08 17:36:01,807 INFO L280 TraceCheckUtils]: 1: Hoare triple {6130#true} #valid := #valid[0 := 0]; {6130#true} is VALID [2020-07-08 17:36:01,807 INFO L280 TraceCheckUtils]: 2: Hoare triple {6130#true} assume 0 < #StackHeapBarrier; {6130#true} is VALID [2020-07-08 17:36:01,808 INFO L280 TraceCheckUtils]: 3: Hoare triple {6130#true} assume true; {6130#true} is VALID [2020-07-08 17:36:01,808 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6130#true} {6130#true} #247#return; {6130#true} is VALID [2020-07-08 17:36:01,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:01,815 INFO L280 TraceCheckUtils]: 0: Hoare triple {6130#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {6130#true} is VALID [2020-07-08 17:36:01,816 INFO L280 TraceCheckUtils]: 1: Hoare triple {6130#true} ~size := #in~size; {6130#true} is VALID [2020-07-08 17:36:01,816 INFO L280 TraceCheckUtils]: 2: Hoare triple {6130#true} ~value := #in~value; {6130#true} is VALID [2020-07-08 17:36:01,817 INFO L280 TraceCheckUtils]: 3: Hoare triple {6130#true} havoc ~i~0; {6130#true} is VALID [2020-07-08 17:36:01,817 INFO L280 TraceCheckUtils]: 4: Hoare triple {6130#true} ~i~0 := 0; {6130#true} is VALID [2020-07-08 17:36:01,818 INFO L280 TraceCheckUtils]: 5: Hoare triple {6130#true} assume !(~i~0 < ~size); {6130#true} is VALID [2020-07-08 17:36:01,818 INFO L280 TraceCheckUtils]: 6: Hoare triple {6130#true} #res := 0; {6130#true} is VALID [2020-07-08 17:36:01,818 INFO L280 TraceCheckUtils]: 7: Hoare triple {6130#true} assume true; {6130#true} is VALID [2020-07-08 17:36:01,819 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {6130#true} {6131#false} #253#return; {6131#false} is VALID [2020-07-08 17:36:01,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:01,839 INFO L280 TraceCheckUtils]: 0: Hoare triple {6161#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {6130#true} is VALID [2020-07-08 17:36:01,839 INFO L280 TraceCheckUtils]: 1: Hoare triple {6130#true} ~size := #in~size; {6130#true} is VALID [2020-07-08 17:36:01,840 INFO L280 TraceCheckUtils]: 2: Hoare triple {6130#true} ~value := #in~value; {6130#true} is VALID [2020-07-08 17:36:01,840 INFO L280 TraceCheckUtils]: 3: Hoare triple {6130#true} SUMMARY for call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4); srcloc: L6 {6130#true} is VALID [2020-07-08 17:36:01,841 INFO L280 TraceCheckUtils]: 4: Hoare triple {6130#true} #res := 1 + ~size; {6130#true} is VALID [2020-07-08 17:36:01,841 INFO L280 TraceCheckUtils]: 5: Hoare triple {6130#true} assume true; {6130#true} is VALID [2020-07-08 17:36:01,842 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {6130#true} {6131#false} #255#return; {6131#false} is VALID [2020-07-08 17:36:01,843 INFO L263 TraceCheckUtils]: 0: Hoare triple {6130#true} call ULTIMATE.init(); {6160#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:36:01,844 INFO L280 TraceCheckUtils]: 1: Hoare triple {6160#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {6130#true} is VALID [2020-07-08 17:36:01,844 INFO L280 TraceCheckUtils]: 2: Hoare triple {6130#true} #valid := #valid[0 := 0]; {6130#true} is VALID [2020-07-08 17:36:01,844 INFO L280 TraceCheckUtils]: 3: Hoare triple {6130#true} assume 0 < #StackHeapBarrier; {6130#true} is VALID [2020-07-08 17:36:01,845 INFO L280 TraceCheckUtils]: 4: Hoare triple {6130#true} assume true; {6130#true} is VALID [2020-07-08 17:36:01,845 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6130#true} {6130#true} #247#return; {6130#true} is VALID [2020-07-08 17:36:01,845 INFO L263 TraceCheckUtils]: 6: Hoare triple {6130#true} call #t~ret23 := main(); {6130#true} is VALID [2020-07-08 17:36:01,846 INFO L280 TraceCheckUtils]: 7: Hoare triple {6130#true} ~n~0 := 0; {6130#true} is VALID [2020-07-08 17:36:01,846 INFO L280 TraceCheckUtils]: 8: Hoare triple {6130#true} SUMMARY for call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000); srcloc: L18 {6130#true} is VALID [2020-07-08 17:36:01,846 INFO L280 TraceCheckUtils]: 9: Hoare triple {6130#true} havoc ~x~0; {6130#true} is VALID [2020-07-08 17:36:01,847 INFO L280 TraceCheckUtils]: 10: Hoare triple {6130#true} havoc ~y~0; {6130#true} is VALID [2020-07-08 17:36:01,848 INFO L280 TraceCheckUtils]: 11: Hoare triple {6130#true} ~x~0 := 0; {6137#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:01,848 INFO L280 TraceCheckUtils]: 12: Hoare triple {6137#(= 0 main_~x~0)} assume !!(~x~0 < 100000); {6137#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:01,849 INFO L280 TraceCheckUtils]: 13: Hoare triple {6137#(= 0 main_~x~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {6137#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:01,850 INFO L280 TraceCheckUtils]: 14: Hoare triple {6137#(= 0 main_~x~0)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {6137#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:01,851 INFO L280 TraceCheckUtils]: 15: Hoare triple {6137#(= 0 main_~x~0)} havoc #t~nondet3; {6137#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:01,852 INFO L280 TraceCheckUtils]: 16: Hoare triple {6137#(= 0 main_~x~0)} #t~post2 := ~x~0; {6138#(= |main_#t~post2| 0)} is VALID [2020-07-08 17:36:01,853 INFO L280 TraceCheckUtils]: 17: Hoare triple {6138#(= |main_#t~post2| 0)} ~x~0 := 1 + #t~post2; {6139#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:01,854 INFO L280 TraceCheckUtils]: 18: Hoare triple {6139#(<= main_~x~0 1)} havoc #t~post2; {6139#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:01,854 INFO L280 TraceCheckUtils]: 19: Hoare triple {6139#(<= main_~x~0 1)} assume !!(~x~0 < 100000); {6139#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:01,855 INFO L280 TraceCheckUtils]: 20: Hoare triple {6139#(<= main_~x~0 1)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {6139#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:01,856 INFO L280 TraceCheckUtils]: 21: Hoare triple {6139#(<= main_~x~0 1)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {6139#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:01,857 INFO L280 TraceCheckUtils]: 22: Hoare triple {6139#(<= main_~x~0 1)} havoc #t~nondet3; {6139#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:01,857 INFO L280 TraceCheckUtils]: 23: Hoare triple {6139#(<= main_~x~0 1)} #t~post2 := ~x~0; {6140#(<= |main_#t~post2| 1)} is VALID [2020-07-08 17:36:01,859 INFO L280 TraceCheckUtils]: 24: Hoare triple {6140#(<= |main_#t~post2| 1)} ~x~0 := 1 + #t~post2; {6141#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:01,859 INFO L280 TraceCheckUtils]: 25: Hoare triple {6141#(<= main_~x~0 2)} havoc #t~post2; {6141#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:01,860 INFO L280 TraceCheckUtils]: 26: Hoare triple {6141#(<= main_~x~0 2)} assume !!(~x~0 < 100000); {6141#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:01,861 INFO L280 TraceCheckUtils]: 27: Hoare triple {6141#(<= main_~x~0 2)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {6141#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:01,862 INFO L280 TraceCheckUtils]: 28: Hoare triple {6141#(<= main_~x~0 2)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {6141#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:01,862 INFO L280 TraceCheckUtils]: 29: Hoare triple {6141#(<= main_~x~0 2)} havoc #t~nondet3; {6141#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:01,863 INFO L280 TraceCheckUtils]: 30: Hoare triple {6141#(<= main_~x~0 2)} #t~post2 := ~x~0; {6142#(<= |main_#t~post2| 2)} is VALID [2020-07-08 17:36:01,864 INFO L280 TraceCheckUtils]: 31: Hoare triple {6142#(<= |main_#t~post2| 2)} ~x~0 := 1 + #t~post2; {6143#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:01,865 INFO L280 TraceCheckUtils]: 32: Hoare triple {6143#(<= main_~x~0 3)} havoc #t~post2; {6143#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:01,866 INFO L280 TraceCheckUtils]: 33: Hoare triple {6143#(<= main_~x~0 3)} assume !(~x~0 < 100000); {6131#false} is VALID [2020-07-08 17:36:01,867 INFO L280 TraceCheckUtils]: 34: Hoare triple {6131#false} ~x~0 := 0; {6131#false} is VALID [2020-07-08 17:36:01,867 INFO L280 TraceCheckUtils]: 35: Hoare triple {6131#false} assume !(~x~0 < ~n~0); {6131#false} is VALID [2020-07-08 17:36:01,867 INFO L280 TraceCheckUtils]: 36: Hoare triple {6131#false} SUMMARY for call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000); srcloc: L28-6 {6131#false} is VALID [2020-07-08 17:36:01,868 INFO L280 TraceCheckUtils]: 37: Hoare triple {6131#false} havoc ~v~0; {6131#false} is VALID [2020-07-08 17:36:01,868 INFO L280 TraceCheckUtils]: 38: Hoare triple {6131#false} ~v~0 := 0; {6131#false} is VALID [2020-07-08 17:36:01,868 INFO L280 TraceCheckUtils]: 39: Hoare triple {6131#false} assume !(~v~0 < 100000); {6131#false} is VALID [2020-07-08 17:36:01,869 INFO L280 TraceCheckUtils]: 40: Hoare triple {6131#false} ~v~0 := 0; {6131#false} is VALID [2020-07-08 17:36:01,869 INFO L280 TraceCheckUtils]: 41: Hoare triple {6131#false} assume !!(~v~0 < 100000); {6131#false} is VALID [2020-07-08 17:36:01,869 INFO L280 TraceCheckUtils]: 42: Hoare triple {6131#false} SUMMARY for call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); srcloc: L41 {6131#false} is VALID [2020-07-08 17:36:01,870 INFO L263 TraceCheckUtils]: 43: Hoare triple {6131#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {6130#true} is VALID [2020-07-08 17:36:01,870 INFO L280 TraceCheckUtils]: 44: Hoare triple {6130#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {6130#true} is VALID [2020-07-08 17:36:01,871 INFO L280 TraceCheckUtils]: 45: Hoare triple {6130#true} ~size := #in~size; {6130#true} is VALID [2020-07-08 17:36:01,871 INFO L280 TraceCheckUtils]: 46: Hoare triple {6130#true} ~value := #in~value; {6130#true} is VALID [2020-07-08 17:36:01,871 INFO L280 TraceCheckUtils]: 47: Hoare triple {6130#true} havoc ~i~0; {6130#true} is VALID [2020-07-08 17:36:01,872 INFO L280 TraceCheckUtils]: 48: Hoare triple {6130#true} ~i~0 := 0; {6130#true} is VALID [2020-07-08 17:36:01,872 INFO L280 TraceCheckUtils]: 49: Hoare triple {6130#true} assume !(~i~0 < ~size); {6130#true} is VALID [2020-07-08 17:36:01,872 INFO L280 TraceCheckUtils]: 50: Hoare triple {6130#true} #res := 0; {6130#true} is VALID [2020-07-08 17:36:01,873 INFO L280 TraceCheckUtils]: 51: Hoare triple {6130#true} assume true; {6130#true} is VALID [2020-07-08 17:36:01,873 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {6130#true} {6131#false} #253#return; {6131#false} is VALID [2020-07-08 17:36:01,873 INFO L280 TraceCheckUtils]: 53: Hoare triple {6131#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {6131#false} is VALID [2020-07-08 17:36:01,874 INFO L280 TraceCheckUtils]: 54: Hoare triple {6131#false} assume 0 != #t~ret12; {6131#false} is VALID [2020-07-08 17:36:01,874 INFO L280 TraceCheckUtils]: 55: Hoare triple {6131#false} havoc #t~mem11; {6131#false} is VALID [2020-07-08 17:36:01,874 INFO L280 TraceCheckUtils]: 56: Hoare triple {6131#false} havoc #t~ret12; {6131#false} is VALID [2020-07-08 17:36:01,875 INFO L280 TraceCheckUtils]: 57: Hoare triple {6131#false} SUMMARY for call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); srcloc: L42 {6131#false} is VALID [2020-07-08 17:36:01,875 INFO L263 TraceCheckUtils]: 58: Hoare triple {6131#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {6161#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-08 17:36:01,875 INFO L280 TraceCheckUtils]: 59: Hoare triple {6161#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {6130#true} is VALID [2020-07-08 17:36:01,876 INFO L280 TraceCheckUtils]: 60: Hoare triple {6130#true} ~size := #in~size; {6130#true} is VALID [2020-07-08 17:36:01,876 INFO L280 TraceCheckUtils]: 61: Hoare triple {6130#true} ~value := #in~value; {6130#true} is VALID [2020-07-08 17:36:01,876 INFO L280 TraceCheckUtils]: 62: Hoare triple {6130#true} SUMMARY for call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4); srcloc: L6 {6130#true} is VALID [2020-07-08 17:36:01,877 INFO L280 TraceCheckUtils]: 63: Hoare triple {6130#true} #res := 1 + ~size; {6130#true} is VALID [2020-07-08 17:36:01,877 INFO L280 TraceCheckUtils]: 64: Hoare triple {6130#true} assume true; {6130#true} is VALID [2020-07-08 17:36:01,877 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {6130#true} {6131#false} #255#return; {6131#false} is VALID [2020-07-08 17:36:01,878 INFO L280 TraceCheckUtils]: 66: Hoare triple {6131#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {6131#false} is VALID [2020-07-08 17:36:01,878 INFO L280 TraceCheckUtils]: 67: Hoare triple {6131#false} ~n~0 := #t~ret14; {6131#false} is VALID [2020-07-08 17:36:01,878 INFO L280 TraceCheckUtils]: 68: Hoare triple {6131#false} havoc #t~mem13; {6131#false} is VALID [2020-07-08 17:36:01,878 INFO L280 TraceCheckUtils]: 69: Hoare triple {6131#false} havoc #t~ret14; {6131#false} is VALID [2020-07-08 17:36:01,879 INFO L280 TraceCheckUtils]: 70: Hoare triple {6131#false} ~x~0 := 0; {6131#false} is VALID [2020-07-08 17:36:01,879 INFO L280 TraceCheckUtils]: 71: Hoare triple {6131#false} assume !!(~x~0 < ~n~0); {6131#false} is VALID [2020-07-08 17:36:01,880 INFO L280 TraceCheckUtils]: 72: Hoare triple {6131#false} ~y~0 := 1 + ~x~0; {6131#false} is VALID [2020-07-08 17:36:01,880 INFO L280 TraceCheckUtils]: 73: Hoare triple {6131#false} assume !!(~y~0 < ~n~0); {6131#false} is VALID [2020-07-08 17:36:01,880 INFO L280 TraceCheckUtils]: 74: Hoare triple {6131#false} SUMMARY for call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L46 {6131#false} is VALID [2020-07-08 17:36:01,881 INFO L280 TraceCheckUtils]: 75: Hoare triple {6131#false} SUMMARY for call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); srcloc: L46-1 {6131#false} is VALID [2020-07-08 17:36:01,881 INFO L263 TraceCheckUtils]: 76: Hoare triple {6131#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {6131#false} is VALID [2020-07-08 17:36:01,882 INFO L280 TraceCheckUtils]: 77: Hoare triple {6131#false} ~cond := #in~cond; {6131#false} is VALID [2020-07-08 17:36:01,882 INFO L280 TraceCheckUtils]: 78: Hoare triple {6131#false} assume 0 == ~cond; {6131#false} is VALID [2020-07-08 17:36:01,882 INFO L280 TraceCheckUtils]: 79: Hoare triple {6131#false} assume !false; {6131#false} is VALID [2020-07-08 17:36:01,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:36:01,923 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:36:01,923 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1327565793] [2020-07-08 17:36:01,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:36:01,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-08 17:36:01,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611077244] [2020-07-08 17:36:01,925 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2020-07-08 17:36:01,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:36:01,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-08 17:36:02,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:02,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-08 17:36:02,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:36:02,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-08 17:36:02,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-08 17:36:02,010 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand 11 states. [2020-07-08 17:36:04,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:04,028 INFO L93 Difference]: Finished difference Result 298 states and 331 transitions. [2020-07-08 17:36:04,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-08 17:36:04,029 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2020-07-08 17:36:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:36:04,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 17:36:04,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 303 transitions. [2020-07-08 17:36:04,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-08 17:36:04,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 303 transitions. [2020-07-08 17:36:04,042 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 303 transitions. [2020-07-08 17:36:04,356 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 303 edges. 303 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:04,361 INFO L225 Difference]: With dead ends: 298 [2020-07-08 17:36:04,361 INFO L226 Difference]: Without dead ends: 195 [2020-07-08 17:36:04,362 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=249, Unknown=0, NotChecked=0, Total=342 [2020-07-08 17:36:04,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2020-07-08 17:36:04,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 144. [2020-07-08 17:36:04,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:36:04,553 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand 144 states. [2020-07-08 17:36:04,553 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand 144 states. [2020-07-08 17:36:04,554 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 144 states. [2020-07-08 17:36:04,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:04,561 INFO L93 Difference]: Finished difference Result 195 states and 216 transitions. [2020-07-08 17:36:04,561 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 216 transitions. [2020-07-08 17:36:04,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:04,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:04,562 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 195 states. [2020-07-08 17:36:04,563 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 195 states. [2020-07-08 17:36:04,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:04,570 INFO L93 Difference]: Finished difference Result 195 states and 216 transitions. [2020-07-08 17:36:04,570 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 216 transitions. [2020-07-08 17:36:04,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:04,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:04,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:36:04,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:36:04,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-07-08 17:36:04,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2020-07-08 17:36:04,577 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 80 [2020-07-08 17:36:04,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:36:04,577 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2020-07-08 17:36:04,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-08 17:36:04,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 144 states and 156 transitions. [2020-07-08 17:36:04,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:04,785 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2020-07-08 17:36:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-07-08 17:36:04,787 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:36:04,787 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:36:04,789 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-08 17:36:04,789 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:36:04,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:36:04,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2142538913, now seen corresponding path program 2 times [2020-07-08 17:36:04,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:36:04,790 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1958903605] [2020-07-08 17:36:04,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:36:04,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:05,065 INFO L280 TraceCheckUtils]: 0: Hoare triple {7487#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {7455#true} is VALID [2020-07-08 17:36:05,065 INFO L280 TraceCheckUtils]: 1: Hoare triple {7455#true} #valid := #valid[0 := 0]; {7455#true} is VALID [2020-07-08 17:36:05,065 INFO L280 TraceCheckUtils]: 2: Hoare triple {7455#true} assume 0 < #StackHeapBarrier; {7455#true} is VALID [2020-07-08 17:36:05,066 INFO L280 TraceCheckUtils]: 3: Hoare triple {7455#true} assume true; {7455#true} is VALID [2020-07-08 17:36:05,066 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {7455#true} {7455#true} #247#return; {7455#true} is VALID [2020-07-08 17:36:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:05,076 INFO L280 TraceCheckUtils]: 0: Hoare triple {7455#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {7455#true} is VALID [2020-07-08 17:36:05,076 INFO L280 TraceCheckUtils]: 1: Hoare triple {7455#true} ~size := #in~size; {7455#true} is VALID [2020-07-08 17:36:05,077 INFO L280 TraceCheckUtils]: 2: Hoare triple {7455#true} ~value := #in~value; {7455#true} is VALID [2020-07-08 17:36:05,077 INFO L280 TraceCheckUtils]: 3: Hoare triple {7455#true} havoc ~i~0; {7455#true} is VALID [2020-07-08 17:36:05,078 INFO L280 TraceCheckUtils]: 4: Hoare triple {7455#true} ~i~0 := 0; {7455#true} is VALID [2020-07-08 17:36:05,078 INFO L280 TraceCheckUtils]: 5: Hoare triple {7455#true} assume !(~i~0 < ~size); {7455#true} is VALID [2020-07-08 17:36:05,078 INFO L280 TraceCheckUtils]: 6: Hoare triple {7455#true} #res := 0; {7455#true} is VALID [2020-07-08 17:36:05,078 INFO L280 TraceCheckUtils]: 7: Hoare triple {7455#true} assume true; {7455#true} is VALID [2020-07-08 17:36:05,079 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {7455#true} {7456#false} #253#return; {7456#false} is VALID [2020-07-08 17:36:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:05,103 INFO L280 TraceCheckUtils]: 0: Hoare triple {7488#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {7455#true} is VALID [2020-07-08 17:36:05,103 INFO L280 TraceCheckUtils]: 1: Hoare triple {7455#true} ~size := #in~size; {7455#true} is VALID [2020-07-08 17:36:05,104 INFO L280 TraceCheckUtils]: 2: Hoare triple {7455#true} ~value := #in~value; {7455#true} is VALID [2020-07-08 17:36:05,104 INFO L280 TraceCheckUtils]: 3: Hoare triple {7455#true} SUMMARY for call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4); srcloc: L6 {7455#true} is VALID [2020-07-08 17:36:05,104 INFO L280 TraceCheckUtils]: 4: Hoare triple {7455#true} #res := 1 + ~size; {7455#true} is VALID [2020-07-08 17:36:05,105 INFO L280 TraceCheckUtils]: 5: Hoare triple {7455#true} assume true; {7455#true} is VALID [2020-07-08 17:36:05,105 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {7455#true} {7456#false} #255#return; {7456#false} is VALID [2020-07-08 17:36:05,108 INFO L263 TraceCheckUtils]: 0: Hoare triple {7455#true} call ULTIMATE.init(); {7487#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:36:05,108 INFO L280 TraceCheckUtils]: 1: Hoare triple {7487#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {7455#true} is VALID [2020-07-08 17:36:05,109 INFO L280 TraceCheckUtils]: 2: Hoare triple {7455#true} #valid := #valid[0 := 0]; {7455#true} is VALID [2020-07-08 17:36:05,109 INFO L280 TraceCheckUtils]: 3: Hoare triple {7455#true} assume 0 < #StackHeapBarrier; {7455#true} is VALID [2020-07-08 17:36:05,109 INFO L280 TraceCheckUtils]: 4: Hoare triple {7455#true} assume true; {7455#true} is VALID [2020-07-08 17:36:05,110 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {7455#true} {7455#true} #247#return; {7455#true} is VALID [2020-07-08 17:36:05,110 INFO L263 TraceCheckUtils]: 6: Hoare triple {7455#true} call #t~ret23 := main(); {7455#true} is VALID [2020-07-08 17:36:05,115 INFO L280 TraceCheckUtils]: 7: Hoare triple {7455#true} ~n~0 := 0; {7455#true} is VALID [2020-07-08 17:36:05,116 INFO L280 TraceCheckUtils]: 8: Hoare triple {7455#true} SUMMARY for call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000); srcloc: L18 {7455#true} is VALID [2020-07-08 17:36:05,116 INFO L280 TraceCheckUtils]: 9: Hoare triple {7455#true} havoc ~x~0; {7455#true} is VALID [2020-07-08 17:36:05,117 INFO L280 TraceCheckUtils]: 10: Hoare triple {7455#true} havoc ~y~0; {7455#true} is VALID [2020-07-08 17:36:05,122 INFO L280 TraceCheckUtils]: 11: Hoare triple {7455#true} ~x~0 := 0; {7462#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:05,122 INFO L280 TraceCheckUtils]: 12: Hoare triple {7462#(= 0 main_~x~0)} assume !!(~x~0 < 100000); {7462#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:05,123 INFO L280 TraceCheckUtils]: 13: Hoare triple {7462#(= 0 main_~x~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {7462#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:05,124 INFO L280 TraceCheckUtils]: 14: Hoare triple {7462#(= 0 main_~x~0)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {7462#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:05,125 INFO L280 TraceCheckUtils]: 15: Hoare triple {7462#(= 0 main_~x~0)} havoc #t~nondet3; {7462#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:05,126 INFO L280 TraceCheckUtils]: 16: Hoare triple {7462#(= 0 main_~x~0)} #t~post2 := ~x~0; {7463#(= |main_#t~post2| 0)} is VALID [2020-07-08 17:36:05,127 INFO L280 TraceCheckUtils]: 17: Hoare triple {7463#(= |main_#t~post2| 0)} ~x~0 := 1 + #t~post2; {7464#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:05,128 INFO L280 TraceCheckUtils]: 18: Hoare triple {7464#(<= main_~x~0 1)} havoc #t~post2; {7464#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:05,129 INFO L280 TraceCheckUtils]: 19: Hoare triple {7464#(<= main_~x~0 1)} assume !!(~x~0 < 100000); {7464#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:05,130 INFO L280 TraceCheckUtils]: 20: Hoare triple {7464#(<= main_~x~0 1)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {7464#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:05,130 INFO L280 TraceCheckUtils]: 21: Hoare triple {7464#(<= main_~x~0 1)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {7464#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:05,131 INFO L280 TraceCheckUtils]: 22: Hoare triple {7464#(<= main_~x~0 1)} havoc #t~nondet3; {7464#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:05,132 INFO L280 TraceCheckUtils]: 23: Hoare triple {7464#(<= main_~x~0 1)} #t~post2 := ~x~0; {7465#(<= |main_#t~post2| 1)} is VALID [2020-07-08 17:36:05,133 INFO L280 TraceCheckUtils]: 24: Hoare triple {7465#(<= |main_#t~post2| 1)} ~x~0 := 1 + #t~post2; {7466#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:05,134 INFO L280 TraceCheckUtils]: 25: Hoare triple {7466#(<= main_~x~0 2)} havoc #t~post2; {7466#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:05,135 INFO L280 TraceCheckUtils]: 26: Hoare triple {7466#(<= main_~x~0 2)} assume !!(~x~0 < 100000); {7466#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:05,136 INFO L280 TraceCheckUtils]: 27: Hoare triple {7466#(<= main_~x~0 2)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {7466#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:05,137 INFO L280 TraceCheckUtils]: 28: Hoare triple {7466#(<= main_~x~0 2)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {7466#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:05,138 INFO L280 TraceCheckUtils]: 29: Hoare triple {7466#(<= main_~x~0 2)} havoc #t~nondet3; {7466#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:05,139 INFO L280 TraceCheckUtils]: 30: Hoare triple {7466#(<= main_~x~0 2)} #t~post2 := ~x~0; {7467#(<= |main_#t~post2| 2)} is VALID [2020-07-08 17:36:05,142 INFO L280 TraceCheckUtils]: 31: Hoare triple {7467#(<= |main_#t~post2| 2)} ~x~0 := 1 + #t~post2; {7468#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:05,144 INFO L280 TraceCheckUtils]: 32: Hoare triple {7468#(<= main_~x~0 3)} havoc #t~post2; {7468#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:05,144 INFO L280 TraceCheckUtils]: 33: Hoare triple {7468#(<= main_~x~0 3)} assume !!(~x~0 < 100000); {7468#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:05,145 INFO L280 TraceCheckUtils]: 34: Hoare triple {7468#(<= main_~x~0 3)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {7468#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:05,146 INFO L280 TraceCheckUtils]: 35: Hoare triple {7468#(<= main_~x~0 3)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {7468#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:05,147 INFO L280 TraceCheckUtils]: 36: Hoare triple {7468#(<= main_~x~0 3)} havoc #t~nondet3; {7468#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:05,148 INFO L280 TraceCheckUtils]: 37: Hoare triple {7468#(<= main_~x~0 3)} #t~post2 := ~x~0; {7469#(<= |main_#t~post2| 3)} is VALID [2020-07-08 17:36:05,149 INFO L280 TraceCheckUtils]: 38: Hoare triple {7469#(<= |main_#t~post2| 3)} ~x~0 := 1 + #t~post2; {7470#(<= main_~x~0 4)} is VALID [2020-07-08 17:36:05,150 INFO L280 TraceCheckUtils]: 39: Hoare triple {7470#(<= main_~x~0 4)} havoc #t~post2; {7470#(<= main_~x~0 4)} is VALID [2020-07-08 17:36:05,151 INFO L280 TraceCheckUtils]: 40: Hoare triple {7470#(<= main_~x~0 4)} assume !(~x~0 < 100000); {7456#false} is VALID [2020-07-08 17:36:05,152 INFO L280 TraceCheckUtils]: 41: Hoare triple {7456#false} ~x~0 := 0; {7456#false} is VALID [2020-07-08 17:36:05,152 INFO L280 TraceCheckUtils]: 42: Hoare triple {7456#false} assume !(~x~0 < ~n~0); {7456#false} is VALID [2020-07-08 17:36:05,152 INFO L280 TraceCheckUtils]: 43: Hoare triple {7456#false} SUMMARY for call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000); srcloc: L28-6 {7456#false} is VALID [2020-07-08 17:36:05,153 INFO L280 TraceCheckUtils]: 44: Hoare triple {7456#false} havoc ~v~0; {7456#false} is VALID [2020-07-08 17:36:05,153 INFO L280 TraceCheckUtils]: 45: Hoare triple {7456#false} ~v~0 := 0; {7456#false} is VALID [2020-07-08 17:36:05,154 INFO L280 TraceCheckUtils]: 46: Hoare triple {7456#false} assume !(~v~0 < 100000); {7456#false} is VALID [2020-07-08 17:36:05,154 INFO L280 TraceCheckUtils]: 47: Hoare triple {7456#false} ~v~0 := 0; {7456#false} is VALID [2020-07-08 17:36:05,155 INFO L280 TraceCheckUtils]: 48: Hoare triple {7456#false} assume !!(~v~0 < 100000); {7456#false} is VALID [2020-07-08 17:36:05,155 INFO L280 TraceCheckUtils]: 49: Hoare triple {7456#false} SUMMARY for call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); srcloc: L41 {7456#false} is VALID [2020-07-08 17:36:05,155 INFO L263 TraceCheckUtils]: 50: Hoare triple {7456#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {7455#true} is VALID [2020-07-08 17:36:05,155 INFO L280 TraceCheckUtils]: 51: Hoare triple {7455#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {7455#true} is VALID [2020-07-08 17:36:05,156 INFO L280 TraceCheckUtils]: 52: Hoare triple {7455#true} ~size := #in~size; {7455#true} is VALID [2020-07-08 17:36:05,156 INFO L280 TraceCheckUtils]: 53: Hoare triple {7455#true} ~value := #in~value; {7455#true} is VALID [2020-07-08 17:36:05,156 INFO L280 TraceCheckUtils]: 54: Hoare triple {7455#true} havoc ~i~0; {7455#true} is VALID [2020-07-08 17:36:05,157 INFO L280 TraceCheckUtils]: 55: Hoare triple {7455#true} ~i~0 := 0; {7455#true} is VALID [2020-07-08 17:36:05,157 INFO L280 TraceCheckUtils]: 56: Hoare triple {7455#true} assume !(~i~0 < ~size); {7455#true} is VALID [2020-07-08 17:36:05,157 INFO L280 TraceCheckUtils]: 57: Hoare triple {7455#true} #res := 0; {7455#true} is VALID [2020-07-08 17:36:05,158 INFO L280 TraceCheckUtils]: 58: Hoare triple {7455#true} assume true; {7455#true} is VALID [2020-07-08 17:36:05,158 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {7455#true} {7456#false} #253#return; {7456#false} is VALID [2020-07-08 17:36:05,158 INFO L280 TraceCheckUtils]: 60: Hoare triple {7456#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {7456#false} is VALID [2020-07-08 17:36:05,158 INFO L280 TraceCheckUtils]: 61: Hoare triple {7456#false} assume 0 != #t~ret12; {7456#false} is VALID [2020-07-08 17:36:05,159 INFO L280 TraceCheckUtils]: 62: Hoare triple {7456#false} havoc #t~mem11; {7456#false} is VALID [2020-07-08 17:36:05,159 INFO L280 TraceCheckUtils]: 63: Hoare triple {7456#false} havoc #t~ret12; {7456#false} is VALID [2020-07-08 17:36:05,159 INFO L280 TraceCheckUtils]: 64: Hoare triple {7456#false} SUMMARY for call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); srcloc: L42 {7456#false} is VALID [2020-07-08 17:36:05,159 INFO L263 TraceCheckUtils]: 65: Hoare triple {7456#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {7488#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-08 17:36:05,160 INFO L280 TraceCheckUtils]: 66: Hoare triple {7488#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {7455#true} is VALID [2020-07-08 17:36:05,160 INFO L280 TraceCheckUtils]: 67: Hoare triple {7455#true} ~size := #in~size; {7455#true} is VALID [2020-07-08 17:36:05,160 INFO L280 TraceCheckUtils]: 68: Hoare triple {7455#true} ~value := #in~value; {7455#true} is VALID [2020-07-08 17:36:05,161 INFO L280 TraceCheckUtils]: 69: Hoare triple {7455#true} SUMMARY for call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4); srcloc: L6 {7455#true} is VALID [2020-07-08 17:36:05,161 INFO L280 TraceCheckUtils]: 70: Hoare triple {7455#true} #res := 1 + ~size; {7455#true} is VALID [2020-07-08 17:36:05,162 INFO L280 TraceCheckUtils]: 71: Hoare triple {7455#true} assume true; {7455#true} is VALID [2020-07-08 17:36:05,164 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {7455#true} {7456#false} #255#return; {7456#false} is VALID [2020-07-08 17:36:05,164 INFO L280 TraceCheckUtils]: 73: Hoare triple {7456#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {7456#false} is VALID [2020-07-08 17:36:05,164 INFO L280 TraceCheckUtils]: 74: Hoare triple {7456#false} ~n~0 := #t~ret14; {7456#false} is VALID [2020-07-08 17:36:05,165 INFO L280 TraceCheckUtils]: 75: Hoare triple {7456#false} havoc #t~mem13; {7456#false} is VALID [2020-07-08 17:36:05,165 INFO L280 TraceCheckUtils]: 76: Hoare triple {7456#false} havoc #t~ret14; {7456#false} is VALID [2020-07-08 17:36:05,167 INFO L280 TraceCheckUtils]: 77: Hoare triple {7456#false} ~x~0 := 0; {7456#false} is VALID [2020-07-08 17:36:05,168 INFO L280 TraceCheckUtils]: 78: Hoare triple {7456#false} assume !!(~x~0 < ~n~0); {7456#false} is VALID [2020-07-08 17:36:05,178 INFO L280 TraceCheckUtils]: 79: Hoare triple {7456#false} ~y~0 := 1 + ~x~0; {7456#false} is VALID [2020-07-08 17:36:05,179 INFO L280 TraceCheckUtils]: 80: Hoare triple {7456#false} assume !!(~y~0 < ~n~0); {7456#false} is VALID [2020-07-08 17:36:05,179 INFO L280 TraceCheckUtils]: 81: Hoare triple {7456#false} SUMMARY for call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L46 {7456#false} is VALID [2020-07-08 17:36:05,179 INFO L280 TraceCheckUtils]: 82: Hoare triple {7456#false} SUMMARY for call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); srcloc: L46-1 {7456#false} is VALID [2020-07-08 17:36:05,180 INFO L263 TraceCheckUtils]: 83: Hoare triple {7456#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {7456#false} is VALID [2020-07-08 17:36:05,180 INFO L280 TraceCheckUtils]: 84: Hoare triple {7456#false} ~cond := #in~cond; {7456#false} is VALID [2020-07-08 17:36:05,180 INFO L280 TraceCheckUtils]: 85: Hoare triple {7456#false} assume 0 == ~cond; {7456#false} is VALID [2020-07-08 17:36:05,180 INFO L280 TraceCheckUtils]: 86: Hoare triple {7456#false} assume !false; {7456#false} is VALID [2020-07-08 17:36:05,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:36:05,201 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:36:05,201 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1958903605] [2020-07-08 17:36:05,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:36:05,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-08 17:36:05,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036681400] [2020-07-08 17:36:05,203 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2020-07-08 17:36:05,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:36:05,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-08 17:36:05,312 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:05,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-08 17:36:05,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:36:05,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-08 17:36:05,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-07-08 17:36:05,314 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 13 states. [2020-07-08 17:36:07,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:07,743 INFO L93 Difference]: Finished difference Result 305 states and 338 transitions. [2020-07-08 17:36:07,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-08 17:36:07,743 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2020-07-08 17:36:07,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:36:07,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 17:36:07,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 310 transitions. [2020-07-08 17:36:07,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-08 17:36:07,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 310 transitions. [2020-07-08 17:36:07,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 310 transitions. [2020-07-08 17:36:08,097 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 310 edges. 310 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:08,107 INFO L225 Difference]: With dead ends: 305 [2020-07-08 17:36:08,107 INFO L226 Difference]: Without dead ends: 202 [2020-07-08 17:36:08,109 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2020-07-08 17:36:08,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-07-08 17:36:08,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 151. [2020-07-08 17:36:08,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:36:08,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 151 states. [2020-07-08 17:36:08,287 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 151 states. [2020-07-08 17:36:08,287 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 151 states. [2020-07-08 17:36:08,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:08,295 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2020-07-08 17:36:08,296 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 223 transitions. [2020-07-08 17:36:08,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:08,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:08,297 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 202 states. [2020-07-08 17:36:08,298 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 202 states. [2020-07-08 17:36:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:08,305 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2020-07-08 17:36:08,305 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 223 transitions. [2020-07-08 17:36:08,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:08,306 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:08,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:36:08,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:36:08,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-07-08 17:36:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2020-07-08 17:36:08,311 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 87 [2020-07-08 17:36:08,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:36:08,311 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2020-07-08 17:36:08,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-08 17:36:08,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 151 states and 163 transitions. [2020-07-08 17:36:08,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:08,500 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2020-07-08 17:36:08,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-08 17:36:08,502 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:36:08,503 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:36:08,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-08 17:36:08,503 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:36:08,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:36:08,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1372997778, now seen corresponding path program 3 times [2020-07-08 17:36:08,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:36:08,504 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1709567396] [2020-07-08 17:36:08,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:36:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:08,761 INFO L280 TraceCheckUtils]: 0: Hoare triple {8862#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8828#true} is VALID [2020-07-08 17:36:08,761 INFO L280 TraceCheckUtils]: 1: Hoare triple {8828#true} #valid := #valid[0 := 0]; {8828#true} is VALID [2020-07-08 17:36:08,761 INFO L280 TraceCheckUtils]: 2: Hoare triple {8828#true} assume 0 < #StackHeapBarrier; {8828#true} is VALID [2020-07-08 17:36:08,762 INFO L280 TraceCheckUtils]: 3: Hoare triple {8828#true} assume true; {8828#true} is VALID [2020-07-08 17:36:08,762 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {8828#true} {8828#true} #247#return; {8828#true} is VALID [2020-07-08 17:36:08,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:08,768 INFO L280 TraceCheckUtils]: 0: Hoare triple {8828#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {8828#true} is VALID [2020-07-08 17:36:08,769 INFO L280 TraceCheckUtils]: 1: Hoare triple {8828#true} ~size := #in~size; {8828#true} is VALID [2020-07-08 17:36:08,769 INFO L280 TraceCheckUtils]: 2: Hoare triple {8828#true} ~value := #in~value; {8828#true} is VALID [2020-07-08 17:36:08,769 INFO L280 TraceCheckUtils]: 3: Hoare triple {8828#true} havoc ~i~0; {8828#true} is VALID [2020-07-08 17:36:08,769 INFO L280 TraceCheckUtils]: 4: Hoare triple {8828#true} ~i~0 := 0; {8828#true} is VALID [2020-07-08 17:36:08,770 INFO L280 TraceCheckUtils]: 5: Hoare triple {8828#true} assume !(~i~0 < ~size); {8828#true} is VALID [2020-07-08 17:36:08,770 INFO L280 TraceCheckUtils]: 6: Hoare triple {8828#true} #res := 0; {8828#true} is VALID [2020-07-08 17:36:08,770 INFO L280 TraceCheckUtils]: 7: Hoare triple {8828#true} assume true; {8828#true} is VALID [2020-07-08 17:36:08,772 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {8828#true} {8829#false} #253#return; {8829#false} is VALID [2020-07-08 17:36:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:08,791 INFO L280 TraceCheckUtils]: 0: Hoare triple {8863#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {8828#true} is VALID [2020-07-08 17:36:08,792 INFO L280 TraceCheckUtils]: 1: Hoare triple {8828#true} ~size := #in~size; {8828#true} is VALID [2020-07-08 17:36:08,792 INFO L280 TraceCheckUtils]: 2: Hoare triple {8828#true} ~value := #in~value; {8828#true} is VALID [2020-07-08 17:36:08,792 INFO L280 TraceCheckUtils]: 3: Hoare triple {8828#true} SUMMARY for call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4); srcloc: L6 {8828#true} is VALID [2020-07-08 17:36:08,792 INFO L280 TraceCheckUtils]: 4: Hoare triple {8828#true} #res := 1 + ~size; {8828#true} is VALID [2020-07-08 17:36:08,792 INFO L280 TraceCheckUtils]: 5: Hoare triple {8828#true} assume true; {8828#true} is VALID [2020-07-08 17:36:08,793 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {8828#true} {8829#false} #255#return; {8829#false} is VALID [2020-07-08 17:36:08,794 INFO L263 TraceCheckUtils]: 0: Hoare triple {8828#true} call ULTIMATE.init(); {8862#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:36:08,794 INFO L280 TraceCheckUtils]: 1: Hoare triple {8862#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {8828#true} is VALID [2020-07-08 17:36:08,795 INFO L280 TraceCheckUtils]: 2: Hoare triple {8828#true} #valid := #valid[0 := 0]; {8828#true} is VALID [2020-07-08 17:36:08,795 INFO L280 TraceCheckUtils]: 3: Hoare triple {8828#true} assume 0 < #StackHeapBarrier; {8828#true} is VALID [2020-07-08 17:36:08,795 INFO L280 TraceCheckUtils]: 4: Hoare triple {8828#true} assume true; {8828#true} is VALID [2020-07-08 17:36:08,795 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {8828#true} {8828#true} #247#return; {8828#true} is VALID [2020-07-08 17:36:08,796 INFO L263 TraceCheckUtils]: 6: Hoare triple {8828#true} call #t~ret23 := main(); {8828#true} is VALID [2020-07-08 17:36:08,796 INFO L280 TraceCheckUtils]: 7: Hoare triple {8828#true} ~n~0 := 0; {8828#true} is VALID [2020-07-08 17:36:08,796 INFO L280 TraceCheckUtils]: 8: Hoare triple {8828#true} SUMMARY for call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000); srcloc: L18 {8828#true} is VALID [2020-07-08 17:36:08,796 INFO L280 TraceCheckUtils]: 9: Hoare triple {8828#true} havoc ~x~0; {8828#true} is VALID [2020-07-08 17:36:08,796 INFO L280 TraceCheckUtils]: 10: Hoare triple {8828#true} havoc ~y~0; {8828#true} is VALID [2020-07-08 17:36:08,797 INFO L280 TraceCheckUtils]: 11: Hoare triple {8828#true} ~x~0 := 0; {8835#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:08,798 INFO L280 TraceCheckUtils]: 12: Hoare triple {8835#(= 0 main_~x~0)} assume !!(~x~0 < 100000); {8835#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:08,799 INFO L280 TraceCheckUtils]: 13: Hoare triple {8835#(= 0 main_~x~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {8835#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:08,799 INFO L280 TraceCheckUtils]: 14: Hoare triple {8835#(= 0 main_~x~0)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {8835#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:08,800 INFO L280 TraceCheckUtils]: 15: Hoare triple {8835#(= 0 main_~x~0)} havoc #t~nondet3; {8835#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:08,802 INFO L280 TraceCheckUtils]: 16: Hoare triple {8835#(= 0 main_~x~0)} #t~post2 := ~x~0; {8836#(= |main_#t~post2| 0)} is VALID [2020-07-08 17:36:08,803 INFO L280 TraceCheckUtils]: 17: Hoare triple {8836#(= |main_#t~post2| 0)} ~x~0 := 1 + #t~post2; {8837#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:08,804 INFO L280 TraceCheckUtils]: 18: Hoare triple {8837#(<= main_~x~0 1)} havoc #t~post2; {8837#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:08,805 INFO L280 TraceCheckUtils]: 19: Hoare triple {8837#(<= main_~x~0 1)} assume !!(~x~0 < 100000); {8837#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:08,805 INFO L280 TraceCheckUtils]: 20: Hoare triple {8837#(<= main_~x~0 1)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {8837#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:08,806 INFO L280 TraceCheckUtils]: 21: Hoare triple {8837#(<= main_~x~0 1)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {8837#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:08,807 INFO L280 TraceCheckUtils]: 22: Hoare triple {8837#(<= main_~x~0 1)} havoc #t~nondet3; {8837#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:08,808 INFO L280 TraceCheckUtils]: 23: Hoare triple {8837#(<= main_~x~0 1)} #t~post2 := ~x~0; {8838#(<= |main_#t~post2| 1)} is VALID [2020-07-08 17:36:08,809 INFO L280 TraceCheckUtils]: 24: Hoare triple {8838#(<= |main_#t~post2| 1)} ~x~0 := 1 + #t~post2; {8839#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:08,809 INFO L280 TraceCheckUtils]: 25: Hoare triple {8839#(<= main_~x~0 2)} havoc #t~post2; {8839#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:08,811 INFO L280 TraceCheckUtils]: 26: Hoare triple {8839#(<= main_~x~0 2)} assume !!(~x~0 < 100000); {8839#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:08,812 INFO L280 TraceCheckUtils]: 27: Hoare triple {8839#(<= main_~x~0 2)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {8839#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:08,813 INFO L280 TraceCheckUtils]: 28: Hoare triple {8839#(<= main_~x~0 2)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {8839#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:08,814 INFO L280 TraceCheckUtils]: 29: Hoare triple {8839#(<= main_~x~0 2)} havoc #t~nondet3; {8839#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:08,814 INFO L280 TraceCheckUtils]: 30: Hoare triple {8839#(<= main_~x~0 2)} #t~post2 := ~x~0; {8840#(<= |main_#t~post2| 2)} is VALID [2020-07-08 17:36:08,815 INFO L280 TraceCheckUtils]: 31: Hoare triple {8840#(<= |main_#t~post2| 2)} ~x~0 := 1 + #t~post2; {8841#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:08,816 INFO L280 TraceCheckUtils]: 32: Hoare triple {8841#(<= main_~x~0 3)} havoc #t~post2; {8841#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:08,816 INFO L280 TraceCheckUtils]: 33: Hoare triple {8841#(<= main_~x~0 3)} assume !!(~x~0 < 100000); {8841#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:08,817 INFO L280 TraceCheckUtils]: 34: Hoare triple {8841#(<= main_~x~0 3)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {8841#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:08,818 INFO L280 TraceCheckUtils]: 35: Hoare triple {8841#(<= main_~x~0 3)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {8841#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:08,818 INFO L280 TraceCheckUtils]: 36: Hoare triple {8841#(<= main_~x~0 3)} havoc #t~nondet3; {8841#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:08,819 INFO L280 TraceCheckUtils]: 37: Hoare triple {8841#(<= main_~x~0 3)} #t~post2 := ~x~0; {8842#(<= |main_#t~post2| 3)} is VALID [2020-07-08 17:36:08,820 INFO L280 TraceCheckUtils]: 38: Hoare triple {8842#(<= |main_#t~post2| 3)} ~x~0 := 1 + #t~post2; {8843#(<= main_~x~0 4)} is VALID [2020-07-08 17:36:08,820 INFO L280 TraceCheckUtils]: 39: Hoare triple {8843#(<= main_~x~0 4)} havoc #t~post2; {8843#(<= main_~x~0 4)} is VALID [2020-07-08 17:36:08,821 INFO L280 TraceCheckUtils]: 40: Hoare triple {8843#(<= main_~x~0 4)} assume !!(~x~0 < 100000); {8843#(<= main_~x~0 4)} is VALID [2020-07-08 17:36:08,821 INFO L280 TraceCheckUtils]: 41: Hoare triple {8843#(<= main_~x~0 4)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {8843#(<= main_~x~0 4)} is VALID [2020-07-08 17:36:08,822 INFO L280 TraceCheckUtils]: 42: Hoare triple {8843#(<= main_~x~0 4)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {8843#(<= main_~x~0 4)} is VALID [2020-07-08 17:36:08,823 INFO L280 TraceCheckUtils]: 43: Hoare triple {8843#(<= main_~x~0 4)} havoc #t~nondet3; {8843#(<= main_~x~0 4)} is VALID [2020-07-08 17:36:08,823 INFO L280 TraceCheckUtils]: 44: Hoare triple {8843#(<= main_~x~0 4)} #t~post2 := ~x~0; {8844#(<= |main_#t~post2| 4)} is VALID [2020-07-08 17:36:08,824 INFO L280 TraceCheckUtils]: 45: Hoare triple {8844#(<= |main_#t~post2| 4)} ~x~0 := 1 + #t~post2; {8845#(<= main_~x~0 5)} is VALID [2020-07-08 17:36:08,825 INFO L280 TraceCheckUtils]: 46: Hoare triple {8845#(<= main_~x~0 5)} havoc #t~post2; {8845#(<= main_~x~0 5)} is VALID [2020-07-08 17:36:08,826 INFO L280 TraceCheckUtils]: 47: Hoare triple {8845#(<= main_~x~0 5)} assume !(~x~0 < 100000); {8829#false} is VALID [2020-07-08 17:36:08,826 INFO L280 TraceCheckUtils]: 48: Hoare triple {8829#false} ~x~0 := 0; {8829#false} is VALID [2020-07-08 17:36:08,826 INFO L280 TraceCheckUtils]: 49: Hoare triple {8829#false} assume !(~x~0 < ~n~0); {8829#false} is VALID [2020-07-08 17:36:08,826 INFO L280 TraceCheckUtils]: 50: Hoare triple {8829#false} SUMMARY for call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000); srcloc: L28-6 {8829#false} is VALID [2020-07-08 17:36:08,827 INFO L280 TraceCheckUtils]: 51: Hoare triple {8829#false} havoc ~v~0; {8829#false} is VALID [2020-07-08 17:36:08,827 INFO L280 TraceCheckUtils]: 52: Hoare triple {8829#false} ~v~0 := 0; {8829#false} is VALID [2020-07-08 17:36:08,827 INFO L280 TraceCheckUtils]: 53: Hoare triple {8829#false} assume !(~v~0 < 100000); {8829#false} is VALID [2020-07-08 17:36:08,827 INFO L280 TraceCheckUtils]: 54: Hoare triple {8829#false} ~v~0 := 0; {8829#false} is VALID [2020-07-08 17:36:08,827 INFO L280 TraceCheckUtils]: 55: Hoare triple {8829#false} assume !!(~v~0 < 100000); {8829#false} is VALID [2020-07-08 17:36:08,828 INFO L280 TraceCheckUtils]: 56: Hoare triple {8829#false} SUMMARY for call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); srcloc: L41 {8829#false} is VALID [2020-07-08 17:36:08,828 INFO L263 TraceCheckUtils]: 57: Hoare triple {8829#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {8828#true} is VALID [2020-07-08 17:36:08,828 INFO L280 TraceCheckUtils]: 58: Hoare triple {8828#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {8828#true} is VALID [2020-07-08 17:36:08,828 INFO L280 TraceCheckUtils]: 59: Hoare triple {8828#true} ~size := #in~size; {8828#true} is VALID [2020-07-08 17:36:08,829 INFO L280 TraceCheckUtils]: 60: Hoare triple {8828#true} ~value := #in~value; {8828#true} is VALID [2020-07-08 17:36:08,829 INFO L280 TraceCheckUtils]: 61: Hoare triple {8828#true} havoc ~i~0; {8828#true} is VALID [2020-07-08 17:36:08,829 INFO L280 TraceCheckUtils]: 62: Hoare triple {8828#true} ~i~0 := 0; {8828#true} is VALID [2020-07-08 17:36:08,829 INFO L280 TraceCheckUtils]: 63: Hoare triple {8828#true} assume !(~i~0 < ~size); {8828#true} is VALID [2020-07-08 17:36:08,829 INFO L280 TraceCheckUtils]: 64: Hoare triple {8828#true} #res := 0; {8828#true} is VALID [2020-07-08 17:36:08,830 INFO L280 TraceCheckUtils]: 65: Hoare triple {8828#true} assume true; {8828#true} is VALID [2020-07-08 17:36:08,830 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {8828#true} {8829#false} #253#return; {8829#false} is VALID [2020-07-08 17:36:08,830 INFO L280 TraceCheckUtils]: 67: Hoare triple {8829#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {8829#false} is VALID [2020-07-08 17:36:08,830 INFO L280 TraceCheckUtils]: 68: Hoare triple {8829#false} assume 0 != #t~ret12; {8829#false} is VALID [2020-07-08 17:36:08,830 INFO L280 TraceCheckUtils]: 69: Hoare triple {8829#false} havoc #t~mem11; {8829#false} is VALID [2020-07-08 17:36:08,831 INFO L280 TraceCheckUtils]: 70: Hoare triple {8829#false} havoc #t~ret12; {8829#false} is VALID [2020-07-08 17:36:08,831 INFO L280 TraceCheckUtils]: 71: Hoare triple {8829#false} SUMMARY for call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); srcloc: L42 {8829#false} is VALID [2020-07-08 17:36:08,831 INFO L263 TraceCheckUtils]: 72: Hoare triple {8829#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {8863#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-08 17:36:08,831 INFO L280 TraceCheckUtils]: 73: Hoare triple {8863#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {8828#true} is VALID [2020-07-08 17:36:08,831 INFO L280 TraceCheckUtils]: 74: Hoare triple {8828#true} ~size := #in~size; {8828#true} is VALID [2020-07-08 17:36:08,832 INFO L280 TraceCheckUtils]: 75: Hoare triple {8828#true} ~value := #in~value; {8828#true} is VALID [2020-07-08 17:36:08,832 INFO L280 TraceCheckUtils]: 76: Hoare triple {8828#true} SUMMARY for call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4); srcloc: L6 {8828#true} is VALID [2020-07-08 17:36:08,832 INFO L280 TraceCheckUtils]: 77: Hoare triple {8828#true} #res := 1 + ~size; {8828#true} is VALID [2020-07-08 17:36:08,832 INFO L280 TraceCheckUtils]: 78: Hoare triple {8828#true} assume true; {8828#true} is VALID [2020-07-08 17:36:08,833 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {8828#true} {8829#false} #255#return; {8829#false} is VALID [2020-07-08 17:36:08,833 INFO L280 TraceCheckUtils]: 80: Hoare triple {8829#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {8829#false} is VALID [2020-07-08 17:36:08,833 INFO L280 TraceCheckUtils]: 81: Hoare triple {8829#false} ~n~0 := #t~ret14; {8829#false} is VALID [2020-07-08 17:36:08,833 INFO L280 TraceCheckUtils]: 82: Hoare triple {8829#false} havoc #t~mem13; {8829#false} is VALID [2020-07-08 17:36:08,833 INFO L280 TraceCheckUtils]: 83: Hoare triple {8829#false} havoc #t~ret14; {8829#false} is VALID [2020-07-08 17:36:08,834 INFO L280 TraceCheckUtils]: 84: Hoare triple {8829#false} ~x~0 := 0; {8829#false} is VALID [2020-07-08 17:36:08,834 INFO L280 TraceCheckUtils]: 85: Hoare triple {8829#false} assume !!(~x~0 < ~n~0); {8829#false} is VALID [2020-07-08 17:36:08,834 INFO L280 TraceCheckUtils]: 86: Hoare triple {8829#false} ~y~0 := 1 + ~x~0; {8829#false} is VALID [2020-07-08 17:36:08,834 INFO L280 TraceCheckUtils]: 87: Hoare triple {8829#false} assume !!(~y~0 < ~n~0); {8829#false} is VALID [2020-07-08 17:36:08,835 INFO L280 TraceCheckUtils]: 88: Hoare triple {8829#false} SUMMARY for call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L46 {8829#false} is VALID [2020-07-08 17:36:08,835 INFO L280 TraceCheckUtils]: 89: Hoare triple {8829#false} SUMMARY for call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); srcloc: L46-1 {8829#false} is VALID [2020-07-08 17:36:08,835 INFO L263 TraceCheckUtils]: 90: Hoare triple {8829#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {8829#false} is VALID [2020-07-08 17:36:08,835 INFO L280 TraceCheckUtils]: 91: Hoare triple {8829#false} ~cond := #in~cond; {8829#false} is VALID [2020-07-08 17:36:08,835 INFO L280 TraceCheckUtils]: 92: Hoare triple {8829#false} assume 0 == ~cond; {8829#false} is VALID [2020-07-08 17:36:08,836 INFO L280 TraceCheckUtils]: 93: Hoare triple {8829#false} assume !false; {8829#false} is VALID [2020-07-08 17:36:08,842 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:36:08,842 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:36:08,843 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1709567396] [2020-07-08 17:36:08,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:36:08,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-08 17:36:08,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295866967] [2020-07-08 17:36:08,844 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 94 [2020-07-08 17:36:08,844 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:36:08,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-08 17:36:08,946 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:08,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-08 17:36:08,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:36:08,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-08 17:36:08,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-07-08 17:36:08,948 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand 15 states. [2020-07-08 17:36:11,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:11,794 INFO L93 Difference]: Finished difference Result 312 states and 345 transitions. [2020-07-08 17:36:11,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-08 17:36:11,795 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 94 [2020-07-08 17:36:11,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:36:11,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 17:36:11,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 317 transitions. [2020-07-08 17:36:11,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-08 17:36:11,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 317 transitions. [2020-07-08 17:36:11,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 317 transitions. [2020-07-08 17:36:12,231 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:12,236 INFO L225 Difference]: With dead ends: 312 [2020-07-08 17:36:12,236 INFO L226 Difference]: Without dead ends: 209 [2020-07-08 17:36:12,237 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2020-07-08 17:36:12,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-07-08 17:36:12,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 158. [2020-07-08 17:36:12,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:36:12,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand 158 states. [2020-07-08 17:36:12,413 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 158 states. [2020-07-08 17:36:12,413 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 158 states. [2020-07-08 17:36:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:12,420 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2020-07-08 17:36:12,420 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 230 transitions. [2020-07-08 17:36:12,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:12,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:12,423 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 209 states. [2020-07-08 17:36:12,423 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 209 states. [2020-07-08 17:36:12,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:12,430 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2020-07-08 17:36:12,431 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 230 transitions. [2020-07-08 17:36:12,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:12,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:12,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:36:12,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:36:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-07-08 17:36:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2020-07-08 17:36:12,440 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 94 [2020-07-08 17:36:12,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:36:12,440 INFO L479 AbstractCegarLoop]: Abstraction has 158 states and 170 transitions. [2020-07-08 17:36:12,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-08 17:36:12,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 158 states and 170 transitions. [2020-07-08 17:36:12,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:12,628 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2020-07-08 17:36:12,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-07-08 17:36:12,630 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:36:12,630 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:36:12,631 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-08 17:36:12,631 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:36:12,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:36:12,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1331129217, now seen corresponding path program 4 times [2020-07-08 17:36:12,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:36:12,632 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [100837834] [2020-07-08 17:36:12,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:36:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:12,863 INFO L280 TraceCheckUtils]: 0: Hoare triple {10285#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10249#true} is VALID [2020-07-08 17:36:12,863 INFO L280 TraceCheckUtils]: 1: Hoare triple {10249#true} #valid := #valid[0 := 0]; {10249#true} is VALID [2020-07-08 17:36:12,864 INFO L280 TraceCheckUtils]: 2: Hoare triple {10249#true} assume 0 < #StackHeapBarrier; {10249#true} is VALID [2020-07-08 17:36:12,864 INFO L280 TraceCheckUtils]: 3: Hoare triple {10249#true} assume true; {10249#true} is VALID [2020-07-08 17:36:12,864 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {10249#true} {10249#true} #247#return; {10249#true} is VALID [2020-07-08 17:36:12,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:12,873 INFO L280 TraceCheckUtils]: 0: Hoare triple {10249#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {10249#true} is VALID [2020-07-08 17:36:12,873 INFO L280 TraceCheckUtils]: 1: Hoare triple {10249#true} ~size := #in~size; {10249#true} is VALID [2020-07-08 17:36:12,874 INFO L280 TraceCheckUtils]: 2: Hoare triple {10249#true} ~value := #in~value; {10249#true} is VALID [2020-07-08 17:36:12,874 INFO L280 TraceCheckUtils]: 3: Hoare triple {10249#true} havoc ~i~0; {10249#true} is VALID [2020-07-08 17:36:12,874 INFO L280 TraceCheckUtils]: 4: Hoare triple {10249#true} ~i~0 := 0; {10249#true} is VALID [2020-07-08 17:36:12,874 INFO L280 TraceCheckUtils]: 5: Hoare triple {10249#true} assume !(~i~0 < ~size); {10249#true} is VALID [2020-07-08 17:36:12,875 INFO L280 TraceCheckUtils]: 6: Hoare triple {10249#true} #res := 0; {10249#true} is VALID [2020-07-08 17:36:12,875 INFO L280 TraceCheckUtils]: 7: Hoare triple {10249#true} assume true; {10249#true} is VALID [2020-07-08 17:36:12,875 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {10249#true} {10250#false} #253#return; {10250#false} is VALID [2020-07-08 17:36:12,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:12,896 INFO L280 TraceCheckUtils]: 0: Hoare triple {10286#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {10249#true} is VALID [2020-07-08 17:36:12,896 INFO L280 TraceCheckUtils]: 1: Hoare triple {10249#true} ~size := #in~size; {10249#true} is VALID [2020-07-08 17:36:12,897 INFO L280 TraceCheckUtils]: 2: Hoare triple {10249#true} ~value := #in~value; {10249#true} is VALID [2020-07-08 17:36:12,897 INFO L280 TraceCheckUtils]: 3: Hoare triple {10249#true} SUMMARY for call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4); srcloc: L6 {10249#true} is VALID [2020-07-08 17:36:12,897 INFO L280 TraceCheckUtils]: 4: Hoare triple {10249#true} #res := 1 + ~size; {10249#true} is VALID [2020-07-08 17:36:12,897 INFO L280 TraceCheckUtils]: 5: Hoare triple {10249#true} assume true; {10249#true} is VALID [2020-07-08 17:36:12,898 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {10249#true} {10250#false} #255#return; {10250#false} is VALID [2020-07-08 17:36:12,899 INFO L263 TraceCheckUtils]: 0: Hoare triple {10249#true} call ULTIMATE.init(); {10285#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:36:12,899 INFO L280 TraceCheckUtils]: 1: Hoare triple {10285#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {10249#true} is VALID [2020-07-08 17:36:12,900 INFO L280 TraceCheckUtils]: 2: Hoare triple {10249#true} #valid := #valid[0 := 0]; {10249#true} is VALID [2020-07-08 17:36:12,900 INFO L280 TraceCheckUtils]: 3: Hoare triple {10249#true} assume 0 < #StackHeapBarrier; {10249#true} is VALID [2020-07-08 17:36:12,900 INFO L280 TraceCheckUtils]: 4: Hoare triple {10249#true} assume true; {10249#true} is VALID [2020-07-08 17:36:12,900 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {10249#true} {10249#true} #247#return; {10249#true} is VALID [2020-07-08 17:36:12,901 INFO L263 TraceCheckUtils]: 6: Hoare triple {10249#true} call #t~ret23 := main(); {10249#true} is VALID [2020-07-08 17:36:12,901 INFO L280 TraceCheckUtils]: 7: Hoare triple {10249#true} ~n~0 := 0; {10249#true} is VALID [2020-07-08 17:36:12,901 INFO L280 TraceCheckUtils]: 8: Hoare triple {10249#true} SUMMARY for call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000); srcloc: L18 {10249#true} is VALID [2020-07-08 17:36:12,901 INFO L280 TraceCheckUtils]: 9: Hoare triple {10249#true} havoc ~x~0; {10249#true} is VALID [2020-07-08 17:36:12,901 INFO L280 TraceCheckUtils]: 10: Hoare triple {10249#true} havoc ~y~0; {10249#true} is VALID [2020-07-08 17:36:12,902 INFO L280 TraceCheckUtils]: 11: Hoare triple {10249#true} ~x~0 := 0; {10256#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:12,903 INFO L280 TraceCheckUtils]: 12: Hoare triple {10256#(= 0 main_~x~0)} assume !!(~x~0 < 100000); {10256#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:12,904 INFO L280 TraceCheckUtils]: 13: Hoare triple {10256#(= 0 main_~x~0)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {10256#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:12,904 INFO L280 TraceCheckUtils]: 14: Hoare triple {10256#(= 0 main_~x~0)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {10256#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:12,905 INFO L280 TraceCheckUtils]: 15: Hoare triple {10256#(= 0 main_~x~0)} havoc #t~nondet3; {10256#(= 0 main_~x~0)} is VALID [2020-07-08 17:36:12,906 INFO L280 TraceCheckUtils]: 16: Hoare triple {10256#(= 0 main_~x~0)} #t~post2 := ~x~0; {10257#(= |main_#t~post2| 0)} is VALID [2020-07-08 17:36:12,907 INFO L280 TraceCheckUtils]: 17: Hoare triple {10257#(= |main_#t~post2| 0)} ~x~0 := 1 + #t~post2; {10258#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:12,907 INFO L280 TraceCheckUtils]: 18: Hoare triple {10258#(<= main_~x~0 1)} havoc #t~post2; {10258#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:12,908 INFO L280 TraceCheckUtils]: 19: Hoare triple {10258#(<= main_~x~0 1)} assume !!(~x~0 < 100000); {10258#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:12,908 INFO L280 TraceCheckUtils]: 20: Hoare triple {10258#(<= main_~x~0 1)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {10258#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:12,909 INFO L280 TraceCheckUtils]: 21: Hoare triple {10258#(<= main_~x~0 1)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {10258#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:12,910 INFO L280 TraceCheckUtils]: 22: Hoare triple {10258#(<= main_~x~0 1)} havoc #t~nondet3; {10258#(<= main_~x~0 1)} is VALID [2020-07-08 17:36:12,911 INFO L280 TraceCheckUtils]: 23: Hoare triple {10258#(<= main_~x~0 1)} #t~post2 := ~x~0; {10259#(<= |main_#t~post2| 1)} is VALID [2020-07-08 17:36:12,912 INFO L280 TraceCheckUtils]: 24: Hoare triple {10259#(<= |main_#t~post2| 1)} ~x~0 := 1 + #t~post2; {10260#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:12,912 INFO L280 TraceCheckUtils]: 25: Hoare triple {10260#(<= main_~x~0 2)} havoc #t~post2; {10260#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:12,913 INFO L280 TraceCheckUtils]: 26: Hoare triple {10260#(<= main_~x~0 2)} assume !!(~x~0 < 100000); {10260#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:12,914 INFO L280 TraceCheckUtils]: 27: Hoare triple {10260#(<= main_~x~0 2)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {10260#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:12,914 INFO L280 TraceCheckUtils]: 28: Hoare triple {10260#(<= main_~x~0 2)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {10260#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:12,915 INFO L280 TraceCheckUtils]: 29: Hoare triple {10260#(<= main_~x~0 2)} havoc #t~nondet3; {10260#(<= main_~x~0 2)} is VALID [2020-07-08 17:36:12,915 INFO L280 TraceCheckUtils]: 30: Hoare triple {10260#(<= main_~x~0 2)} #t~post2 := ~x~0; {10261#(<= |main_#t~post2| 2)} is VALID [2020-07-08 17:36:12,916 INFO L280 TraceCheckUtils]: 31: Hoare triple {10261#(<= |main_#t~post2| 2)} ~x~0 := 1 + #t~post2; {10262#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:12,917 INFO L280 TraceCheckUtils]: 32: Hoare triple {10262#(<= main_~x~0 3)} havoc #t~post2; {10262#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:12,917 INFO L280 TraceCheckUtils]: 33: Hoare triple {10262#(<= main_~x~0 3)} assume !!(~x~0 < 100000); {10262#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:12,918 INFO L280 TraceCheckUtils]: 34: Hoare triple {10262#(<= main_~x~0 3)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {10262#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:12,918 INFO L280 TraceCheckUtils]: 35: Hoare triple {10262#(<= main_~x~0 3)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {10262#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:12,919 INFO L280 TraceCheckUtils]: 36: Hoare triple {10262#(<= main_~x~0 3)} havoc #t~nondet3; {10262#(<= main_~x~0 3)} is VALID [2020-07-08 17:36:12,920 INFO L280 TraceCheckUtils]: 37: Hoare triple {10262#(<= main_~x~0 3)} #t~post2 := ~x~0; {10263#(<= |main_#t~post2| 3)} is VALID [2020-07-08 17:36:12,921 INFO L280 TraceCheckUtils]: 38: Hoare triple {10263#(<= |main_#t~post2| 3)} ~x~0 := 1 + #t~post2; {10264#(<= main_~x~0 4)} is VALID [2020-07-08 17:36:12,921 INFO L280 TraceCheckUtils]: 39: Hoare triple {10264#(<= main_~x~0 4)} havoc #t~post2; {10264#(<= main_~x~0 4)} is VALID [2020-07-08 17:36:12,922 INFO L280 TraceCheckUtils]: 40: Hoare triple {10264#(<= main_~x~0 4)} assume !!(~x~0 < 100000); {10264#(<= main_~x~0 4)} is VALID [2020-07-08 17:36:12,922 INFO L280 TraceCheckUtils]: 41: Hoare triple {10264#(<= main_~x~0 4)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {10264#(<= main_~x~0 4)} is VALID [2020-07-08 17:36:12,923 INFO L280 TraceCheckUtils]: 42: Hoare triple {10264#(<= main_~x~0 4)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {10264#(<= main_~x~0 4)} is VALID [2020-07-08 17:36:12,924 INFO L280 TraceCheckUtils]: 43: Hoare triple {10264#(<= main_~x~0 4)} havoc #t~nondet3; {10264#(<= main_~x~0 4)} is VALID [2020-07-08 17:36:12,924 INFO L280 TraceCheckUtils]: 44: Hoare triple {10264#(<= main_~x~0 4)} #t~post2 := ~x~0; {10265#(<= |main_#t~post2| 4)} is VALID [2020-07-08 17:36:12,925 INFO L280 TraceCheckUtils]: 45: Hoare triple {10265#(<= |main_#t~post2| 4)} ~x~0 := 1 + #t~post2; {10266#(<= main_~x~0 5)} is VALID [2020-07-08 17:36:12,926 INFO L280 TraceCheckUtils]: 46: Hoare triple {10266#(<= main_~x~0 5)} havoc #t~post2; {10266#(<= main_~x~0 5)} is VALID [2020-07-08 17:36:12,926 INFO L280 TraceCheckUtils]: 47: Hoare triple {10266#(<= main_~x~0 5)} assume !!(~x~0 < 100000); {10266#(<= main_~x~0 5)} is VALID [2020-07-08 17:36:12,927 INFO L280 TraceCheckUtils]: 48: Hoare triple {10266#(<= main_~x~0 5)} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {10266#(<= main_~x~0 5)} is VALID [2020-07-08 17:36:12,928 INFO L280 TraceCheckUtils]: 49: Hoare triple {10266#(<= main_~x~0 5)} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {10266#(<= main_~x~0 5)} is VALID [2020-07-08 17:36:12,928 INFO L280 TraceCheckUtils]: 50: Hoare triple {10266#(<= main_~x~0 5)} havoc #t~nondet3; {10266#(<= main_~x~0 5)} is VALID [2020-07-08 17:36:12,929 INFO L280 TraceCheckUtils]: 51: Hoare triple {10266#(<= main_~x~0 5)} #t~post2 := ~x~0; {10267#(<= |main_#t~post2| 5)} is VALID [2020-07-08 17:36:12,930 INFO L280 TraceCheckUtils]: 52: Hoare triple {10267#(<= |main_#t~post2| 5)} ~x~0 := 1 + #t~post2; {10268#(<= main_~x~0 6)} is VALID [2020-07-08 17:36:12,931 INFO L280 TraceCheckUtils]: 53: Hoare triple {10268#(<= main_~x~0 6)} havoc #t~post2; {10268#(<= main_~x~0 6)} is VALID [2020-07-08 17:36:12,931 INFO L280 TraceCheckUtils]: 54: Hoare triple {10268#(<= main_~x~0 6)} assume !(~x~0 < 100000); {10250#false} is VALID [2020-07-08 17:36:12,932 INFO L280 TraceCheckUtils]: 55: Hoare triple {10250#false} ~x~0 := 0; {10250#false} is VALID [2020-07-08 17:36:12,932 INFO L280 TraceCheckUtils]: 56: Hoare triple {10250#false} assume !(~x~0 < ~n~0); {10250#false} is VALID [2020-07-08 17:36:12,932 INFO L280 TraceCheckUtils]: 57: Hoare triple {10250#false} SUMMARY for call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000); srcloc: L28-6 {10250#false} is VALID [2020-07-08 17:36:12,932 INFO L280 TraceCheckUtils]: 58: Hoare triple {10250#false} havoc ~v~0; {10250#false} is VALID [2020-07-08 17:36:12,932 INFO L280 TraceCheckUtils]: 59: Hoare triple {10250#false} ~v~0 := 0; {10250#false} is VALID [2020-07-08 17:36:12,933 INFO L280 TraceCheckUtils]: 60: Hoare triple {10250#false} assume !(~v~0 < 100000); {10250#false} is VALID [2020-07-08 17:36:12,933 INFO L280 TraceCheckUtils]: 61: Hoare triple {10250#false} ~v~0 := 0; {10250#false} is VALID [2020-07-08 17:36:12,933 INFO L280 TraceCheckUtils]: 62: Hoare triple {10250#false} assume !!(~v~0 < 100000); {10250#false} is VALID [2020-07-08 17:36:12,933 INFO L280 TraceCheckUtils]: 63: Hoare triple {10250#false} SUMMARY for call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); srcloc: L41 {10250#false} is VALID [2020-07-08 17:36:12,933 INFO L263 TraceCheckUtils]: 64: Hoare triple {10250#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {10249#true} is VALID [2020-07-08 17:36:12,934 INFO L280 TraceCheckUtils]: 65: Hoare triple {10249#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {10249#true} is VALID [2020-07-08 17:36:12,934 INFO L280 TraceCheckUtils]: 66: Hoare triple {10249#true} ~size := #in~size; {10249#true} is VALID [2020-07-08 17:36:12,934 INFO L280 TraceCheckUtils]: 67: Hoare triple {10249#true} ~value := #in~value; {10249#true} is VALID [2020-07-08 17:36:12,934 INFO L280 TraceCheckUtils]: 68: Hoare triple {10249#true} havoc ~i~0; {10249#true} is VALID [2020-07-08 17:36:12,934 INFO L280 TraceCheckUtils]: 69: Hoare triple {10249#true} ~i~0 := 0; {10249#true} is VALID [2020-07-08 17:36:12,935 INFO L280 TraceCheckUtils]: 70: Hoare triple {10249#true} assume !(~i~0 < ~size); {10249#true} is VALID [2020-07-08 17:36:12,935 INFO L280 TraceCheckUtils]: 71: Hoare triple {10249#true} #res := 0; {10249#true} is VALID [2020-07-08 17:36:12,935 INFO L280 TraceCheckUtils]: 72: Hoare triple {10249#true} assume true; {10249#true} is VALID [2020-07-08 17:36:12,935 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {10249#true} {10250#false} #253#return; {10250#false} is VALID [2020-07-08 17:36:12,936 INFO L280 TraceCheckUtils]: 74: Hoare triple {10250#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {10250#false} is VALID [2020-07-08 17:36:12,936 INFO L280 TraceCheckUtils]: 75: Hoare triple {10250#false} assume 0 != #t~ret12; {10250#false} is VALID [2020-07-08 17:36:12,936 INFO L280 TraceCheckUtils]: 76: Hoare triple {10250#false} havoc #t~mem11; {10250#false} is VALID [2020-07-08 17:36:12,936 INFO L280 TraceCheckUtils]: 77: Hoare triple {10250#false} havoc #t~ret12; {10250#false} is VALID [2020-07-08 17:36:12,936 INFO L280 TraceCheckUtils]: 78: Hoare triple {10250#false} SUMMARY for call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); srcloc: L42 {10250#false} is VALID [2020-07-08 17:36:12,937 INFO L263 TraceCheckUtils]: 79: Hoare triple {10250#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {10286#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-08 17:36:12,937 INFO L280 TraceCheckUtils]: 80: Hoare triple {10286#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {10249#true} is VALID [2020-07-08 17:36:12,937 INFO L280 TraceCheckUtils]: 81: Hoare triple {10249#true} ~size := #in~size; {10249#true} is VALID [2020-07-08 17:36:12,937 INFO L280 TraceCheckUtils]: 82: Hoare triple {10249#true} ~value := #in~value; {10249#true} is VALID [2020-07-08 17:36:12,937 INFO L280 TraceCheckUtils]: 83: Hoare triple {10249#true} SUMMARY for call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4); srcloc: L6 {10249#true} is VALID [2020-07-08 17:36:12,938 INFO L280 TraceCheckUtils]: 84: Hoare triple {10249#true} #res := 1 + ~size; {10249#true} is VALID [2020-07-08 17:36:12,938 INFO L280 TraceCheckUtils]: 85: Hoare triple {10249#true} assume true; {10249#true} is VALID [2020-07-08 17:36:12,938 INFO L275 TraceCheckUtils]: 86: Hoare quadruple {10249#true} {10250#false} #255#return; {10250#false} is VALID [2020-07-08 17:36:12,938 INFO L280 TraceCheckUtils]: 87: Hoare triple {10250#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {10250#false} is VALID [2020-07-08 17:36:12,939 INFO L280 TraceCheckUtils]: 88: Hoare triple {10250#false} ~n~0 := #t~ret14; {10250#false} is VALID [2020-07-08 17:36:12,939 INFO L280 TraceCheckUtils]: 89: Hoare triple {10250#false} havoc #t~mem13; {10250#false} is VALID [2020-07-08 17:36:12,939 INFO L280 TraceCheckUtils]: 90: Hoare triple {10250#false} havoc #t~ret14; {10250#false} is VALID [2020-07-08 17:36:12,939 INFO L280 TraceCheckUtils]: 91: Hoare triple {10250#false} ~x~0 := 0; {10250#false} is VALID [2020-07-08 17:36:12,939 INFO L280 TraceCheckUtils]: 92: Hoare triple {10250#false} assume !!(~x~0 < ~n~0); {10250#false} is VALID [2020-07-08 17:36:12,940 INFO L280 TraceCheckUtils]: 93: Hoare triple {10250#false} ~y~0 := 1 + ~x~0; {10250#false} is VALID [2020-07-08 17:36:12,940 INFO L280 TraceCheckUtils]: 94: Hoare triple {10250#false} assume !!(~y~0 < ~n~0); {10250#false} is VALID [2020-07-08 17:36:12,940 INFO L280 TraceCheckUtils]: 95: Hoare triple {10250#false} SUMMARY for call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L46 {10250#false} is VALID [2020-07-08 17:36:12,940 INFO L280 TraceCheckUtils]: 96: Hoare triple {10250#false} SUMMARY for call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); srcloc: L46-1 {10250#false} is VALID [2020-07-08 17:36:12,940 INFO L263 TraceCheckUtils]: 97: Hoare triple {10250#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {10250#false} is VALID [2020-07-08 17:36:12,941 INFO L280 TraceCheckUtils]: 98: Hoare triple {10250#false} ~cond := #in~cond; {10250#false} is VALID [2020-07-08 17:36:12,941 INFO L280 TraceCheckUtils]: 99: Hoare triple {10250#false} assume 0 == ~cond; {10250#false} is VALID [2020-07-08 17:36:12,941 INFO L280 TraceCheckUtils]: 100: Hoare triple {10250#false} assume !false; {10250#false} is VALID [2020-07-08 17:36:12,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:36:12,950 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:36:12,950 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [100837834] [2020-07-08 17:36:12,950 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:36:12,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-07-08 17:36:12,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909597084] [2020-07-08 17:36:12,957 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 101 [2020-07-08 17:36:12,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:36:12,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-08 17:36:13,071 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:13,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-08 17:36:13,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:36:13,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-08 17:36:13,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2020-07-08 17:36:13,072 INFO L87 Difference]: Start difference. First operand 158 states and 170 transitions. Second operand 17 states. [2020-07-08 17:36:16,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:16,186 INFO L93 Difference]: Finished difference Result 319 states and 352 transitions. [2020-07-08 17:36:16,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-08 17:36:16,186 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 101 [2020-07-08 17:36:16,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:36:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 17:36:16,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 324 transitions. [2020-07-08 17:36:16,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-08 17:36:16,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 324 transitions. [2020-07-08 17:36:16,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 324 transitions. [2020-07-08 17:36:16,519 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 324 edges. 324 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:16,523 INFO L225 Difference]: With dead ends: 319 [2020-07-08 17:36:16,524 INFO L226 Difference]: Without dead ends: 216 [2020-07-08 17:36:16,525 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2020-07-08 17:36:16,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-07-08 17:36:16,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 165. [2020-07-08 17:36:16,732 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:36:16,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand 165 states. [2020-07-08 17:36:16,732 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand 165 states. [2020-07-08 17:36:16,733 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 165 states. [2020-07-08 17:36:16,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:16,741 INFO L93 Difference]: Finished difference Result 216 states and 237 transitions. [2020-07-08 17:36:16,741 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 237 transitions. [2020-07-08 17:36:16,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:16,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:16,742 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 216 states. [2020-07-08 17:36:16,742 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 216 states. [2020-07-08 17:36:16,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:16,749 INFO L93 Difference]: Finished difference Result 216 states and 237 transitions. [2020-07-08 17:36:16,749 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 237 transitions. [2020-07-08 17:36:16,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:16,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:16,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:36:16,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:36:16,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-07-08 17:36:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 177 transitions. [2020-07-08 17:36:16,756 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 177 transitions. Word has length 101 [2020-07-08 17:36:16,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:36:16,756 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 177 transitions. [2020-07-08 17:36:16,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-08 17:36:16,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 165 states and 177 transitions. [2020-07-08 17:36:16,982 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:16,982 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 177 transitions. [2020-07-08 17:36:16,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-07-08 17:36:16,987 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:36:16,987 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:36:16,988 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-08 17:36:16,988 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:36:16,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:36:16,988 INFO L82 PathProgramCache]: Analyzing trace with hash -837086642, now seen corresponding path program 5 times [2020-07-08 17:36:16,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:36:16,989 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1869704457] [2020-07-08 17:36:16,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:36:17,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:17,121 INFO L280 TraceCheckUtils]: 0: Hoare triple {11742#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {11718#true} is VALID [2020-07-08 17:36:17,121 INFO L280 TraceCheckUtils]: 1: Hoare triple {11718#true} #valid := #valid[0 := 0]; {11718#true} is VALID [2020-07-08 17:36:17,121 INFO L280 TraceCheckUtils]: 2: Hoare triple {11718#true} assume 0 < #StackHeapBarrier; {11718#true} is VALID [2020-07-08 17:36:17,122 INFO L280 TraceCheckUtils]: 3: Hoare triple {11718#true} assume true; {11718#true} is VALID [2020-07-08 17:36:17,122 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {11718#true} {11718#true} #247#return; {11718#true} is VALID [2020-07-08 17:36:17,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:17,133 INFO L280 TraceCheckUtils]: 0: Hoare triple {11718#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {11718#true} is VALID [2020-07-08 17:36:17,134 INFO L280 TraceCheckUtils]: 1: Hoare triple {11718#true} ~size := #in~size; {11718#true} is VALID [2020-07-08 17:36:17,134 INFO L280 TraceCheckUtils]: 2: Hoare triple {11718#true} ~value := #in~value; {11718#true} is VALID [2020-07-08 17:36:17,134 INFO L280 TraceCheckUtils]: 3: Hoare triple {11718#true} havoc ~i~0; {11718#true} is VALID [2020-07-08 17:36:17,135 INFO L280 TraceCheckUtils]: 4: Hoare triple {11718#true} ~i~0 := 0; {11718#true} is VALID [2020-07-08 17:36:17,135 INFO L280 TraceCheckUtils]: 5: Hoare triple {11718#true} assume !(~i~0 < ~size); {11718#true} is VALID [2020-07-08 17:36:17,135 INFO L280 TraceCheckUtils]: 6: Hoare triple {11718#true} #res := 0; {11718#true} is VALID [2020-07-08 17:36:17,135 INFO L280 TraceCheckUtils]: 7: Hoare triple {11718#true} assume true; {11718#true} is VALID [2020-07-08 17:36:17,136 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {11718#true} {11719#false} #253#return; {11719#false} is VALID [2020-07-08 17:36:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 17:36:17,148 INFO L280 TraceCheckUtils]: 0: Hoare triple {11743#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {11718#true} is VALID [2020-07-08 17:36:17,148 INFO L280 TraceCheckUtils]: 1: Hoare triple {11718#true} ~size := #in~size; {11718#true} is VALID [2020-07-08 17:36:17,148 INFO L280 TraceCheckUtils]: 2: Hoare triple {11718#true} ~value := #in~value; {11718#true} is VALID [2020-07-08 17:36:17,148 INFO L280 TraceCheckUtils]: 3: Hoare triple {11718#true} SUMMARY for call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4); srcloc: L6 {11718#true} is VALID [2020-07-08 17:36:17,149 INFO L280 TraceCheckUtils]: 4: Hoare triple {11718#true} #res := 1 + ~size; {11718#true} is VALID [2020-07-08 17:36:17,149 INFO L280 TraceCheckUtils]: 5: Hoare triple {11718#true} assume true; {11718#true} is VALID [2020-07-08 17:36:17,149 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {11718#true} {11719#false} #255#return; {11719#false} is VALID [2020-07-08 17:36:17,151 INFO L263 TraceCheckUtils]: 0: Hoare triple {11718#true} call ULTIMATE.init(); {11742#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} is VALID [2020-07-08 17:36:17,151 INFO L280 TraceCheckUtils]: 1: Hoare triple {11742#(and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|))} #NULL.base, #NULL.offset := 0, 0; {11718#true} is VALID [2020-07-08 17:36:17,152 INFO L280 TraceCheckUtils]: 2: Hoare triple {11718#true} #valid := #valid[0 := 0]; {11718#true} is VALID [2020-07-08 17:36:17,152 INFO L280 TraceCheckUtils]: 3: Hoare triple {11718#true} assume 0 < #StackHeapBarrier; {11718#true} is VALID [2020-07-08 17:36:17,152 INFO L280 TraceCheckUtils]: 4: Hoare triple {11718#true} assume true; {11718#true} is VALID [2020-07-08 17:36:17,153 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {11718#true} {11718#true} #247#return; {11718#true} is VALID [2020-07-08 17:36:17,153 INFO L263 TraceCheckUtils]: 6: Hoare triple {11718#true} call #t~ret23 := main(); {11718#true} is VALID [2020-07-08 17:36:17,153 INFO L280 TraceCheckUtils]: 7: Hoare triple {11718#true} ~n~0 := 0; {11718#true} is VALID [2020-07-08 17:36:17,153 INFO L280 TraceCheckUtils]: 8: Hoare triple {11718#true} SUMMARY for call ~#set~0.base, ~#set~0.offset := #Ultimate.allocOnStack(400000); srcloc: L18 {11718#true} is VALID [2020-07-08 17:36:17,154 INFO L280 TraceCheckUtils]: 9: Hoare triple {11718#true} havoc ~x~0; {11718#true} is VALID [2020-07-08 17:36:17,154 INFO L280 TraceCheckUtils]: 10: Hoare triple {11718#true} havoc ~y~0; {11718#true} is VALID [2020-07-08 17:36:17,154 INFO L280 TraceCheckUtils]: 11: Hoare triple {11718#true} ~x~0 := 0; {11718#true} is VALID [2020-07-08 17:36:17,154 INFO L280 TraceCheckUtils]: 12: Hoare triple {11718#true} assume !!(~x~0 < 100000); {11718#true} is VALID [2020-07-08 17:36:17,154 INFO L280 TraceCheckUtils]: 13: Hoare triple {11718#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {11718#true} is VALID [2020-07-08 17:36:17,155 INFO L280 TraceCheckUtils]: 14: Hoare triple {11718#true} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {11718#true} is VALID [2020-07-08 17:36:17,155 INFO L280 TraceCheckUtils]: 15: Hoare triple {11718#true} havoc #t~nondet3; {11718#true} is VALID [2020-07-08 17:36:17,155 INFO L280 TraceCheckUtils]: 16: Hoare triple {11718#true} #t~post2 := ~x~0; {11718#true} is VALID [2020-07-08 17:36:17,155 INFO L280 TraceCheckUtils]: 17: Hoare triple {11718#true} ~x~0 := 1 + #t~post2; {11718#true} is VALID [2020-07-08 17:36:17,155 INFO L280 TraceCheckUtils]: 18: Hoare triple {11718#true} havoc #t~post2; {11718#true} is VALID [2020-07-08 17:36:17,156 INFO L280 TraceCheckUtils]: 19: Hoare triple {11718#true} assume !!(~x~0 < 100000); {11718#true} is VALID [2020-07-08 17:36:17,156 INFO L280 TraceCheckUtils]: 20: Hoare triple {11718#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {11718#true} is VALID [2020-07-08 17:36:17,156 INFO L280 TraceCheckUtils]: 21: Hoare triple {11718#true} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {11718#true} is VALID [2020-07-08 17:36:17,156 INFO L280 TraceCheckUtils]: 22: Hoare triple {11718#true} havoc #t~nondet3; {11718#true} is VALID [2020-07-08 17:36:17,156 INFO L280 TraceCheckUtils]: 23: Hoare triple {11718#true} #t~post2 := ~x~0; {11718#true} is VALID [2020-07-08 17:36:17,157 INFO L280 TraceCheckUtils]: 24: Hoare triple {11718#true} ~x~0 := 1 + #t~post2; {11718#true} is VALID [2020-07-08 17:36:17,157 INFO L280 TraceCheckUtils]: 25: Hoare triple {11718#true} havoc #t~post2; {11718#true} is VALID [2020-07-08 17:36:17,157 INFO L280 TraceCheckUtils]: 26: Hoare triple {11718#true} assume !!(~x~0 < 100000); {11718#true} is VALID [2020-07-08 17:36:17,157 INFO L280 TraceCheckUtils]: 27: Hoare triple {11718#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {11718#true} is VALID [2020-07-08 17:36:17,157 INFO L280 TraceCheckUtils]: 28: Hoare triple {11718#true} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {11718#true} is VALID [2020-07-08 17:36:17,158 INFO L280 TraceCheckUtils]: 29: Hoare triple {11718#true} havoc #t~nondet3; {11718#true} is VALID [2020-07-08 17:36:17,158 INFO L280 TraceCheckUtils]: 30: Hoare triple {11718#true} #t~post2 := ~x~0; {11718#true} is VALID [2020-07-08 17:36:17,158 INFO L280 TraceCheckUtils]: 31: Hoare triple {11718#true} ~x~0 := 1 + #t~post2; {11718#true} is VALID [2020-07-08 17:36:17,158 INFO L280 TraceCheckUtils]: 32: Hoare triple {11718#true} havoc #t~post2; {11718#true} is VALID [2020-07-08 17:36:17,159 INFO L280 TraceCheckUtils]: 33: Hoare triple {11718#true} assume !!(~x~0 < 100000); {11718#true} is VALID [2020-07-08 17:36:17,159 INFO L280 TraceCheckUtils]: 34: Hoare triple {11718#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {11718#true} is VALID [2020-07-08 17:36:17,159 INFO L280 TraceCheckUtils]: 35: Hoare triple {11718#true} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {11718#true} is VALID [2020-07-08 17:36:17,159 INFO L280 TraceCheckUtils]: 36: Hoare triple {11718#true} havoc #t~nondet3; {11718#true} is VALID [2020-07-08 17:36:17,159 INFO L280 TraceCheckUtils]: 37: Hoare triple {11718#true} #t~post2 := ~x~0; {11718#true} is VALID [2020-07-08 17:36:17,160 INFO L280 TraceCheckUtils]: 38: Hoare triple {11718#true} ~x~0 := 1 + #t~post2; {11718#true} is VALID [2020-07-08 17:36:17,160 INFO L280 TraceCheckUtils]: 39: Hoare triple {11718#true} havoc #t~post2; {11718#true} is VALID [2020-07-08 17:36:17,160 INFO L280 TraceCheckUtils]: 40: Hoare triple {11718#true} assume !!(~x~0 < 100000); {11718#true} is VALID [2020-07-08 17:36:17,160 INFO L280 TraceCheckUtils]: 41: Hoare triple {11718#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {11718#true} is VALID [2020-07-08 17:36:17,160 INFO L280 TraceCheckUtils]: 42: Hoare triple {11718#true} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {11718#true} is VALID [2020-07-08 17:36:17,161 INFO L280 TraceCheckUtils]: 43: Hoare triple {11718#true} havoc #t~nondet3; {11718#true} is VALID [2020-07-08 17:36:17,161 INFO L280 TraceCheckUtils]: 44: Hoare triple {11718#true} #t~post2 := ~x~0; {11718#true} is VALID [2020-07-08 17:36:17,161 INFO L280 TraceCheckUtils]: 45: Hoare triple {11718#true} ~x~0 := 1 + #t~post2; {11718#true} is VALID [2020-07-08 17:36:17,161 INFO L280 TraceCheckUtils]: 46: Hoare triple {11718#true} havoc #t~post2; {11718#true} is VALID [2020-07-08 17:36:17,162 INFO L280 TraceCheckUtils]: 47: Hoare triple {11718#true} assume !!(~x~0 < 100000); {11718#true} is VALID [2020-07-08 17:36:17,162 INFO L280 TraceCheckUtils]: 48: Hoare triple {11718#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {11718#true} is VALID [2020-07-08 17:36:17,162 INFO L280 TraceCheckUtils]: 49: Hoare triple {11718#true} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {11718#true} is VALID [2020-07-08 17:36:17,162 INFO L280 TraceCheckUtils]: 50: Hoare triple {11718#true} havoc #t~nondet3; {11718#true} is VALID [2020-07-08 17:36:17,162 INFO L280 TraceCheckUtils]: 51: Hoare triple {11718#true} #t~post2 := ~x~0; {11718#true} is VALID [2020-07-08 17:36:17,163 INFO L280 TraceCheckUtils]: 52: Hoare triple {11718#true} ~x~0 := 1 + #t~post2; {11718#true} is VALID [2020-07-08 17:36:17,163 INFO L280 TraceCheckUtils]: 53: Hoare triple {11718#true} havoc #t~post2; {11718#true} is VALID [2020-07-08 17:36:17,163 INFO L280 TraceCheckUtils]: 54: Hoare triple {11718#true} assume !!(~x~0 < 100000); {11718#true} is VALID [2020-07-08 17:36:17,163 INFO L280 TraceCheckUtils]: 55: Hoare triple {11718#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {11718#true} is VALID [2020-07-08 17:36:17,163 INFO L280 TraceCheckUtils]: 56: Hoare triple {11718#true} SUMMARY for call write~int(#t~nondet3, ~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L24-1 {11718#true} is VALID [2020-07-08 17:36:17,164 INFO L280 TraceCheckUtils]: 57: Hoare triple {11718#true} havoc #t~nondet3; {11718#true} is VALID [2020-07-08 17:36:17,164 INFO L280 TraceCheckUtils]: 58: Hoare triple {11718#true} #t~post2 := ~x~0; {11718#true} is VALID [2020-07-08 17:36:17,164 INFO L280 TraceCheckUtils]: 59: Hoare triple {11718#true} ~x~0 := 1 + #t~post2; {11718#true} is VALID [2020-07-08 17:36:17,164 INFO L280 TraceCheckUtils]: 60: Hoare triple {11718#true} havoc #t~post2; {11718#true} is VALID [2020-07-08 17:36:17,165 INFO L280 TraceCheckUtils]: 61: Hoare triple {11718#true} assume !(~x~0 < 100000); {11718#true} is VALID [2020-07-08 17:36:17,165 INFO L280 TraceCheckUtils]: 62: Hoare triple {11718#true} ~x~0 := 0; {11718#true} is VALID [2020-07-08 17:36:17,165 INFO L280 TraceCheckUtils]: 63: Hoare triple {11718#true} assume !(~x~0 < ~n~0); {11718#true} is VALID [2020-07-08 17:36:17,165 INFO L280 TraceCheckUtils]: 64: Hoare triple {11718#true} SUMMARY for call ~#values~0.base, ~#values~0.offset := #Ultimate.allocOnStack(400000); srcloc: L28-6 {11718#true} is VALID [2020-07-08 17:36:17,166 INFO L280 TraceCheckUtils]: 65: Hoare triple {11718#true} havoc ~v~0; {11718#true} is VALID [2020-07-08 17:36:17,169 INFO L280 TraceCheckUtils]: 66: Hoare triple {11718#true} ~v~0 := 0; {11725#(= 0 main_~v~0)} is VALID [2020-07-08 17:36:17,170 INFO L280 TraceCheckUtils]: 67: Hoare triple {11725#(= 0 main_~v~0)} assume !(~v~0 < 100000); {11719#false} is VALID [2020-07-08 17:36:17,170 INFO L280 TraceCheckUtils]: 68: Hoare triple {11719#false} ~v~0 := 0; {11719#false} is VALID [2020-07-08 17:36:17,170 INFO L280 TraceCheckUtils]: 69: Hoare triple {11719#false} assume !!(~v~0 < 100000); {11719#false} is VALID [2020-07-08 17:36:17,170 INFO L280 TraceCheckUtils]: 70: Hoare triple {11719#false} SUMMARY for call #t~mem11 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); srcloc: L41 {11719#false} is VALID [2020-07-08 17:36:17,171 INFO L263 TraceCheckUtils]: 71: Hoare triple {11719#false} call #t~ret12 := elem_exists(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem11); {11718#true} is VALID [2020-07-08 17:36:17,171 INFO L280 TraceCheckUtils]: 72: Hoare triple {11718#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {11718#true} is VALID [2020-07-08 17:36:17,171 INFO L280 TraceCheckUtils]: 73: Hoare triple {11718#true} ~size := #in~size; {11718#true} is VALID [2020-07-08 17:36:17,171 INFO L280 TraceCheckUtils]: 74: Hoare triple {11718#true} ~value := #in~value; {11718#true} is VALID [2020-07-08 17:36:17,171 INFO L280 TraceCheckUtils]: 75: Hoare triple {11718#true} havoc ~i~0; {11718#true} is VALID [2020-07-08 17:36:17,172 INFO L280 TraceCheckUtils]: 76: Hoare triple {11718#true} ~i~0 := 0; {11718#true} is VALID [2020-07-08 17:36:17,172 INFO L280 TraceCheckUtils]: 77: Hoare triple {11718#true} assume !(~i~0 < ~size); {11718#true} is VALID [2020-07-08 17:36:17,172 INFO L280 TraceCheckUtils]: 78: Hoare triple {11718#true} #res := 0; {11718#true} is VALID [2020-07-08 17:36:17,172 INFO L280 TraceCheckUtils]: 79: Hoare triple {11718#true} assume true; {11718#true} is VALID [2020-07-08 17:36:17,173 INFO L275 TraceCheckUtils]: 80: Hoare quadruple {11718#true} {11719#false} #253#return; {11719#false} is VALID [2020-07-08 17:36:17,173 INFO L280 TraceCheckUtils]: 81: Hoare triple {11719#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {11719#false} is VALID [2020-07-08 17:36:17,173 INFO L280 TraceCheckUtils]: 82: Hoare triple {11719#false} assume 0 != #t~ret12; {11719#false} is VALID [2020-07-08 17:36:17,173 INFO L280 TraceCheckUtils]: 83: Hoare triple {11719#false} havoc #t~mem11; {11719#false} is VALID [2020-07-08 17:36:17,174 INFO L280 TraceCheckUtils]: 84: Hoare triple {11719#false} havoc #t~ret12; {11719#false} is VALID [2020-07-08 17:36:17,174 INFO L280 TraceCheckUtils]: 85: Hoare triple {11719#false} SUMMARY for call #t~mem13 := read~int(~#values~0.base, ~#values~0.offset + 4 * ~v~0, 4); srcloc: L42 {11719#false} is VALID [2020-07-08 17:36:17,174 INFO L263 TraceCheckUtils]: 86: Hoare triple {11719#false} call #t~ret14 := insert(~#set~0.base, ~#set~0.offset, ~n~0, #t~mem13); {11743#(= |#memory_int| |old(#memory_int)|)} is VALID [2020-07-08 17:36:17,174 INFO L280 TraceCheckUtils]: 87: Hoare triple {11743#(= |#memory_int| |old(#memory_int)|)} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {11718#true} is VALID [2020-07-08 17:36:17,174 INFO L280 TraceCheckUtils]: 88: Hoare triple {11718#true} ~size := #in~size; {11718#true} is VALID [2020-07-08 17:36:17,175 INFO L280 TraceCheckUtils]: 89: Hoare triple {11718#true} ~value := #in~value; {11718#true} is VALID [2020-07-08 17:36:17,175 INFO L280 TraceCheckUtils]: 90: Hoare triple {11718#true} SUMMARY for call write~int(~value, ~set.base, ~set.offset + 4 * ~size, 4); srcloc: L6 {11718#true} is VALID [2020-07-08 17:36:17,175 INFO L280 TraceCheckUtils]: 91: Hoare triple {11718#true} #res := 1 + ~size; {11718#true} is VALID [2020-07-08 17:36:17,175 INFO L280 TraceCheckUtils]: 92: Hoare triple {11718#true} assume true; {11718#true} is VALID [2020-07-08 17:36:17,175 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {11718#true} {11719#false} #255#return; {11719#false} is VALID [2020-07-08 17:36:17,176 INFO L280 TraceCheckUtils]: 94: Hoare triple {11719#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {11719#false} is VALID [2020-07-08 17:36:17,176 INFO L280 TraceCheckUtils]: 95: Hoare triple {11719#false} ~n~0 := #t~ret14; {11719#false} is VALID [2020-07-08 17:36:17,176 INFO L280 TraceCheckUtils]: 96: Hoare triple {11719#false} havoc #t~mem13; {11719#false} is VALID [2020-07-08 17:36:17,176 INFO L280 TraceCheckUtils]: 97: Hoare triple {11719#false} havoc #t~ret14; {11719#false} is VALID [2020-07-08 17:36:17,177 INFO L280 TraceCheckUtils]: 98: Hoare triple {11719#false} ~x~0 := 0; {11719#false} is VALID [2020-07-08 17:36:17,177 INFO L280 TraceCheckUtils]: 99: Hoare triple {11719#false} assume !!(~x~0 < ~n~0); {11719#false} is VALID [2020-07-08 17:36:17,177 INFO L280 TraceCheckUtils]: 100: Hoare triple {11719#false} ~y~0 := 1 + ~x~0; {11719#false} is VALID [2020-07-08 17:36:17,177 INFO L280 TraceCheckUtils]: 101: Hoare triple {11719#false} assume !!(~y~0 < ~n~0); {11719#false} is VALID [2020-07-08 17:36:17,177 INFO L280 TraceCheckUtils]: 102: Hoare triple {11719#false} SUMMARY for call #t~mem17 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~x~0, 4); srcloc: L46 {11719#false} is VALID [2020-07-08 17:36:17,178 INFO L280 TraceCheckUtils]: 103: Hoare triple {11719#false} SUMMARY for call #t~mem18 := read~int(~#set~0.base, ~#set~0.offset + 4 * ~y~0, 4); srcloc: L46-1 {11719#false} is VALID [2020-07-08 17:36:17,178 INFO L263 TraceCheckUtils]: 104: Hoare triple {11719#false} call __VERIFIER_assert((if #t~mem17 != #t~mem18 then 1 else 0)); {11719#false} is VALID [2020-07-08 17:36:17,178 INFO L280 TraceCheckUtils]: 105: Hoare triple {11719#false} ~cond := #in~cond; {11719#false} is VALID [2020-07-08 17:36:17,178 INFO L280 TraceCheckUtils]: 106: Hoare triple {11719#false} assume 0 == ~cond; {11719#false} is VALID [2020-07-08 17:36:17,178 INFO L280 TraceCheckUtils]: 107: Hoare triple {11719#false} assume !false; {11719#false} is VALID [2020-07-08 17:36:17,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 17:36:17,187 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-08 17:36:17,187 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1869704457] [2020-07-08 17:36:17,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 17:36:17,187 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 17:36:17,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772263787] [2020-07-08 17:36:17,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2020-07-08 17:36:17,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 17:36:17,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 17:36:17,257 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:17,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 17:36:17,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-08 17:36:17,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 17:36:17,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 17:36:17,258 INFO L87 Difference]: Start difference. First operand 165 states and 177 transitions. Second operand 5 states. [2020-07-08 17:36:18,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:18,234 INFO L93 Difference]: Finished difference Result 298 states and 327 transitions. [2020-07-08 17:36:18,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-08 17:36:18,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2020-07-08 17:36:18,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 17:36:18,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:36:18,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 255 transitions. [2020-07-08 17:36:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 17:36:18,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 255 transitions. [2020-07-08 17:36:18,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 255 transitions. [2020-07-08 17:36:18,532 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:18,538 INFO L225 Difference]: With dead ends: 298 [2020-07-08 17:36:18,539 INFO L226 Difference]: Without dead ends: 207 [2020-07-08 17:36:18,540 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 17:36:18,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-07-08 17:36:18,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 166. [2020-07-08 17:36:18,760 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 17:36:18,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand 166 states. [2020-07-08 17:36:18,760 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 166 states. [2020-07-08 17:36:18,760 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 166 states. [2020-07-08 17:36:18,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:18,767 INFO L93 Difference]: Finished difference Result 207 states and 225 transitions. [2020-07-08 17:36:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 225 transitions. [2020-07-08 17:36:18,768 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:18,768 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:18,768 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 207 states. [2020-07-08 17:36:18,768 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 207 states. [2020-07-08 17:36:18,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 17:36:18,773 INFO L93 Difference]: Finished difference Result 207 states and 225 transitions. [2020-07-08 17:36:18,773 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 225 transitions. [2020-07-08 17:36:18,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 17:36:18,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 17:36:18,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 17:36:18,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 17:36:18,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-07-08 17:36:18,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 178 transitions. [2020-07-08 17:36:18,778 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 178 transitions. Word has length 108 [2020-07-08 17:36:18,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 17:36:18,778 INFO L479 AbstractCegarLoop]: Abstraction has 166 states and 178 transitions. [2020-07-08 17:36:18,779 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 17:36:18,779 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 166 states and 178 transitions. [2020-07-08 17:36:19,009 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 178 edges. 178 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 17:36:19,010 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 178 transitions. [2020-07-08 17:36:19,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-07-08 17:36:19,012 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 17:36:19,012 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 17:36:19,013 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 17:36:19,013 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 17:36:19,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 17:36:19,013 INFO L82 PathProgramCache]: Analyzing trace with hash -118705538, now seen corresponding path program 1 times [2020-07-08 17:36:19,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-08 17:36:19,014 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [66534926] [2020-07-08 17:36:19,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 17:36:19,030 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-08 17:36:19,031 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.NullPointerException at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.acceleratedInterpolationCore(AcceleratedInterpolation.java:277) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:184) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:144) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-08 17:36:19,037 INFO L168 Benchmark]: Toolchain (without parser) took 29409.44 ms. Allocated memory was 141.6 MB in the beginning and 485.5 MB in the end (delta: 343.9 MB). Free memory was 100.1 MB in the beginning and 247.6 MB in the end (delta: -147.5 MB). Peak memory consumption was 196.5 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:19,038 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 141.6 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-07-08 17:36:19,039 INFO L168 Benchmark]: CACSL2BoogieTranslator took 340.71 ms. Allocated memory is still 141.6 MB. Free memory was 99.9 MB in the beginning and 87.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:19,039 INFO L168 Benchmark]: Boogie Preprocessor took 177.53 ms. Allocated memory was 141.6 MB in the beginning and 199.2 MB in the end (delta: 57.7 MB). Free memory was 87.8 MB in the beginning and 175.8 MB in the end (delta: -88.0 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:19,040 INFO L168 Benchmark]: RCFGBuilder took 872.33 ms. Allocated memory is still 199.2 MB. Free memory was 175.8 MB in the beginning and 126.5 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:19,040 INFO L168 Benchmark]: TraceAbstraction took 28011.86 ms. Allocated memory was 199.2 MB in the beginning and 485.5 MB in the end (delta: 286.3 MB). Free memory was 126.5 MB in the beginning and 247.6 MB in the end (delta: -121.1 MB). Peak memory consumption was 165.2 MB. Max. memory is 7.1 GB. [2020-07-08 17:36:19,043 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 141.6 MB. Free memory was 118.2 MB in the beginning and 118.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 340.71 ms. Allocated memory is still 141.6 MB. Free memory was 99.9 MB in the beginning and 87.8 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 177.53 ms. Allocated memory was 141.6 MB in the beginning and 199.2 MB in the end (delta: 57.7 MB). Free memory was 87.8 MB in the beginning and 175.8 MB in the end (delta: -88.0 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 872.33 ms. Allocated memory is still 199.2 MB. Free memory was 175.8 MB in the beginning and 126.5 MB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28011.86 ms. Allocated memory was 199.2 MB in the beginning and 485.5 MB in the end (delta: 286.3 MB). Free memory was 126.5 MB in the beginning and 247.6 MB in the end (delta: -121.1 MB). Peak memory consumption was 165.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: NullPointerException: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: NullPointerException: null: de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.generateMetaTrace(AcceleratedInterpolation.java:442) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...