/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-8fc6572 [2020-07-10 20:20:39,263 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:20:39,266 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:20:39,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:20:39,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:20:39,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:20:39,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:20:39,301 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:20:39,304 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:20:39,307 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:20:39,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:20:39,312 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:20:39,312 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:20:39,314 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:20:39,316 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:20:39,317 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:20:39,319 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:20:39,320 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:20:39,321 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:20:39,327 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:20:39,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:20:39,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:20:39,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:20:39,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:20:39,341 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:20:39,341 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:20:39,341 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:20:39,344 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:20:39,345 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:20:39,346 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:20:39,346 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:20:39,347 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:20:39,348 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:20:39,349 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:20:39,350 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:20:39,350 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:20:39,351 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:20:39,351 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:20:39,351 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:20:39,352 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:20:39,353 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:20:39,354 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:20:39,384 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:20:39,385 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:20:39,386 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:20:39,389 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:20:39,390 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:20:39,390 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:20:39,390 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:20:39,390 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:20:39,390 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:20:39,391 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:20:39,391 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:20:39,391 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:20:39,391 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:20:39,391 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:20:39,392 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:20:39,392 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:20:39,392 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:20:39,392 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:20:39,394 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:20:39,394 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:20:39,394 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:20:39,394 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:20:39,394 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:20:39,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:20:39,732 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:20:39,736 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:20:39,738 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:20:39,738 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:20:39,739 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-10 20:20:39,814 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/742ff9a3b/4eea9acfc7a04433bba3417eba7b3c2f/FLAG14b179b7e [2020-07-10 20:20:40,275 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:20:40,276 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i [2020-07-10 20:20:40,284 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/742ff9a3b/4eea9acfc7a04433bba3417eba7b3c2f/FLAG14b179b7e [2020-07-10 20:20:40,677 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/742ff9a3b/4eea9acfc7a04433bba3417eba7b3c2f [2020-07-10 20:20:40,685 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:20:40,687 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:20:40,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:20:40,688 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:20:40,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:20:40,695 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:20:40" (1/1) ... [2020-07-10 20:20:40,697 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ffd5db8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:40, skipping insertion in model container [2020-07-10 20:20:40,697 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:20:40" (1/1) ... [2020-07-10 20:20:40,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:20:40,730 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:20:40,939 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:20:40,949 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:20:40,979 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:20:40,998 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:20:40,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:40 WrapperNode [2020-07-10 20:20:40,998 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:20:40,999 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:20:40,999 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:20:40,999 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:20:41,100 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:40" (1/1) ... [2020-07-10 20:20:41,101 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:40" (1/1) ... [2020-07-10 20:20:41,109 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:40" (1/1) ... [2020-07-10 20:20:41,110 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:40" (1/1) ... [2020-07-10 20:20:41,125 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:40" (1/1) ... [2020-07-10 20:20:41,136 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:40" (1/1) ... [2020-07-10 20:20:41,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:40" (1/1) ... [2020-07-10 20:20:41,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:20:41,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:20:41,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:20:41,143 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:20:41,144 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:20:41,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:20:41,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:20:41,212 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:20:41,212 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2020-07-10 20:20:41,212 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2020-07-10 20:20:41,213 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:20:41,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:20:41,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:20:41,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:20:41,213 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2020-07-10 20:20:41,213 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-10 20:20:41,213 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2020-07-10 20:20:41,213 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-10 20:20:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:20:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-10 20:20:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-10 20:20:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:20:41,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:20:41,913 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:20:41,914 INFO L295 CfgBuilder]: Removed 10 assume(true) statements. [2020-07-10 20:20:41,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:20:41 BoogieIcfgContainer [2020-07-10 20:20:41,925 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:20:41,932 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:20:41,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:20:41,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:20:41,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:20:40" (1/3) ... [2020-07-10 20:20:41,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e232683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:20:41, skipping insertion in model container [2020-07-10 20:20:41,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:20:40" (2/3) ... [2020-07-10 20:20:41,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e232683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:20:41, skipping insertion in model container [2020-07-10 20:20:41,940 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:20:41" (3/3) ... [2020-07-10 20:20:41,943 INFO L109 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2020-07-10 20:20:41,955 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:20:41,964 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:20:41,979 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:20:41,999 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:20:42,000 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:20:42,000 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:20:42,000 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:20:42,001 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:20:42,001 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:20:42,001 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:20:42,002 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:20:42,017 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states. [2020-07-10 20:20:42,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 20:20:42,027 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:42,028 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-10 20:20:42,029 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:42,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:42,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1588916751, now seen corresponding path program 1 times [2020-07-10 20:20:42,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:42,043 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [66607103] [2020-07-10 20:20:42,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:42,267 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-10 20:20:42,267 INFO L280 TraceCheckUtils]: 1: Hoare triple {135#true} #valid := #valid[0 := 0]; {135#true} is VALID [2020-07-10 20:20:42,268 INFO L280 TraceCheckUtils]: 2: Hoare triple {135#true} assume 0 < #StackHeapBarrier; {135#true} is VALID [2020-07-10 20:20:42,270 INFO L280 TraceCheckUtils]: 3: Hoare triple {135#true} assume true; {135#true} is VALID [2020-07-10 20:20:42,271 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {135#true} {135#true} #247#return; {135#true} is VALID [2020-07-10 20:20:42,280 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-10 20:20:42,280 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-10 20:20:42,281 INFO L280 TraceCheckUtils]: 2: Hoare triple {135#true} #valid := #valid[0 := 0]; {135#true} is VALID [2020-07-10 20:20:42,281 INFO L280 TraceCheckUtils]: 3: Hoare triple {135#true} assume 0 < #StackHeapBarrier; {135#true} is VALID [2020-07-10 20:20:42,281 INFO L280 TraceCheckUtils]: 4: Hoare triple {135#true} assume true; {135#true} is VALID [2020-07-10 20:20:42,282 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {135#true} {135#true} #247#return; {135#true} is VALID [2020-07-10 20:20:42,282 INFO L263 TraceCheckUtils]: 6: Hoare triple {135#true} call #t~ret23 := main(); {135#true} is VALID [2020-07-10 20:20:42,282 INFO L280 TraceCheckUtils]: 7: Hoare triple {135#true} ~n~0 := 0; {135#true} is VALID [2020-07-10 20:20:42,283 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-10 20:20:42,283 INFO L280 TraceCheckUtils]: 9: Hoare triple {135#true} havoc ~x~0; {135#true} is VALID [2020-07-10 20:20:42,284 INFO L280 TraceCheckUtils]: 10: Hoare triple {135#true} havoc ~y~0; {135#true} is VALID [2020-07-10 20:20:42,284 INFO L280 TraceCheckUtils]: 11: Hoare triple {135#true} ~x~0 := 0; {135#true} is VALID [2020-07-10 20:20:42,285 INFO L280 TraceCheckUtils]: 12: Hoare triple {135#true} assume !true; {136#false} is VALID [2020-07-10 20:20:42,286 INFO L280 TraceCheckUtils]: 13: Hoare triple {136#false} ~x~0 := 0; {136#false} is VALID [2020-07-10 20:20:42,286 INFO L280 TraceCheckUtils]: 14: Hoare triple {136#false} assume !!(~x~0 < ~n~0); {136#false} is VALID [2020-07-10 20:20:42,286 INFO L280 TraceCheckUtils]: 15: Hoare triple {136#false} ~y~0 := 1 + ~x~0; {136#false} is VALID [2020-07-10 20:20:42,287 INFO L280 TraceCheckUtils]: 16: Hoare triple {136#false} assume !!(~y~0 < ~n~0); {136#false} is VALID [2020-07-10 20:20:42,288 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-10 20:20:42,288 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-10 20:20:42,289 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-10 20:20:42,289 INFO L280 TraceCheckUtils]: 20: Hoare triple {136#false} ~cond := #in~cond; {136#false} is VALID [2020-07-10 20:20:42,289 INFO L280 TraceCheckUtils]: 21: Hoare triple {136#false} assume 0 == ~cond; {136#false} is VALID [2020-07-10 20:20:42,290 INFO L280 TraceCheckUtils]: 22: Hoare triple {136#false} assume !false; {136#false} is VALID [2020-07-10 20:20:42,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:20:42,298 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:42,302 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [66607103] [2020-07-10 20:20:42,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:42,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:20:42,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745926541] [2020-07-10 20:20:42,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 20:20:42,319 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:42,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:20:42,362 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-10 20:20:42,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:20:42,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:42,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:20:42,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:20:42,375 INFO L87 Difference]: Start difference. First operand 132 states. Second operand 3 states. [2020-07-10 20:20:43,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:43,078 INFO L93 Difference]: Finished difference Result 245 states and 295 transitions. [2020-07-10 20:20:43,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:20:43,079 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2020-07-10 20:20:43,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:43,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:20:43,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2020-07-10 20:20:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:20:43,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 295 transitions. [2020-07-10 20:20:43,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 295 transitions. [2020-07-10 20:20:43,476 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-10 20:20:43,493 INFO L225 Difference]: With dead ends: 245 [2020-07-10 20:20:43,493 INFO L226 Difference]: Without dead ends: 123 [2020-07-10 20:20:43,498 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-10 20:20:43,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-07-10 20:20:43,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2020-07-10 20:20:43,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:43,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 123 states. [2020-07-10 20:20:43,636 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 123 states. [2020-07-10 20:20:43,636 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 123 states. [2020-07-10 20:20:43,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:43,646 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2020-07-10 20:20:43,647 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2020-07-10 20:20:43,648 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:43,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:43,649 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 123 states. [2020-07-10 20:20:43,649 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 123 states. [2020-07-10 20:20:43,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:43,659 INFO L93 Difference]: Finished difference Result 123 states and 136 transitions. [2020-07-10 20:20:43,659 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2020-07-10 20:20:43,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:43,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:43,661 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:43,661 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:43,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2020-07-10 20:20:43,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 136 transitions. [2020-07-10 20:20:43,670 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 136 transitions. Word has length 23 [2020-07-10 20:20:43,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:43,671 INFO L479 AbstractCegarLoop]: Abstraction has 123 states and 136 transitions. [2020-07-10 20:20:43,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:20:43,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 123 states and 136 transitions. [2020-07-10 20:20:43,830 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-10 20:20:43,830 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 136 transitions. [2020-07-10 20:20:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-10 20:20:43,832 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:43,832 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-10 20:20:43,832 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:20:43,833 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:43,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:43,833 INFO L82 PathProgramCache]: Analyzing trace with hash -119454780, now seen corresponding path program 1 times [2020-07-10 20:20:43,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:43,834 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [227765629] [2020-07-10 20:20:43,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:43,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:43,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:43,934 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-10 20:20:43,934 INFO L280 TraceCheckUtils]: 1: Hoare triple {1127#true} #valid := #valid[0 := 0]; {1127#true} is VALID [2020-07-10 20:20:43,935 INFO L280 TraceCheckUtils]: 2: Hoare triple {1127#true} assume 0 < #StackHeapBarrier; {1127#true} is VALID [2020-07-10 20:20:43,935 INFO L280 TraceCheckUtils]: 3: Hoare triple {1127#true} assume true; {1127#true} is VALID [2020-07-10 20:20:43,935 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {1127#true} {1127#true} #247#return; {1127#true} is VALID [2020-07-10 20:20:43,941 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-10 20:20:43,941 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-10 20:20:43,942 INFO L280 TraceCheckUtils]: 2: Hoare triple {1127#true} #valid := #valid[0 := 0]; {1127#true} is VALID [2020-07-10 20:20:43,942 INFO L280 TraceCheckUtils]: 3: Hoare triple {1127#true} assume 0 < #StackHeapBarrier; {1127#true} is VALID [2020-07-10 20:20:43,942 INFO L280 TraceCheckUtils]: 4: Hoare triple {1127#true} assume true; {1127#true} is VALID [2020-07-10 20:20:43,942 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {1127#true} {1127#true} #247#return; {1127#true} is VALID [2020-07-10 20:20:43,943 INFO L263 TraceCheckUtils]: 6: Hoare triple {1127#true} call #t~ret23 := main(); {1127#true} is VALID [2020-07-10 20:20:43,943 INFO L280 TraceCheckUtils]: 7: Hoare triple {1127#true} ~n~0 := 0; {1127#true} is VALID [2020-07-10 20:20:43,943 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-10 20:20:43,944 INFO L280 TraceCheckUtils]: 9: Hoare triple {1127#true} havoc ~x~0; {1127#true} is VALID [2020-07-10 20:20:43,944 INFO L280 TraceCheckUtils]: 10: Hoare triple {1127#true} havoc ~y~0; {1127#true} is VALID [2020-07-10 20:20:43,945 INFO L280 TraceCheckUtils]: 11: Hoare triple {1127#true} ~x~0 := 0; {1134#(= 0 main_~x~0)} is VALID [2020-07-10 20:20:43,946 INFO L280 TraceCheckUtils]: 12: Hoare triple {1134#(= 0 main_~x~0)} assume !(~x~0 < 100000); {1128#false} is VALID [2020-07-10 20:20:43,946 INFO L280 TraceCheckUtils]: 13: Hoare triple {1128#false} ~x~0 := 0; {1128#false} is VALID [2020-07-10 20:20:43,947 INFO L280 TraceCheckUtils]: 14: Hoare triple {1128#false} assume !!(~x~0 < ~n~0); {1128#false} is VALID [2020-07-10 20:20:43,947 INFO L280 TraceCheckUtils]: 15: Hoare triple {1128#false} ~y~0 := 1 + ~x~0; {1128#false} is VALID [2020-07-10 20:20:43,948 INFO L280 TraceCheckUtils]: 16: Hoare triple {1128#false} assume !!(~y~0 < ~n~0); {1128#false} is VALID [2020-07-10 20:20:43,949 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-10 20:20:43,949 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-10 20:20:43,953 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-10 20:20:43,953 INFO L280 TraceCheckUtils]: 20: Hoare triple {1128#false} ~cond := #in~cond; {1128#false} is VALID [2020-07-10 20:20:43,954 INFO L280 TraceCheckUtils]: 21: Hoare triple {1128#false} assume 0 == ~cond; {1128#false} is VALID [2020-07-10 20:20:43,954 INFO L280 TraceCheckUtils]: 22: Hoare triple {1128#false} assume !false; {1128#false} is VALID [2020-07-10 20:20:43,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:20:43,956 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:43,956 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [227765629] [2020-07-10 20:20:43,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:43,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-10 20:20:43,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717791856] [2020-07-10 20:20:43,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-10 20:20:43,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:43,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-10 20:20:43,982 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-10 20:20:43,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-10 20:20:43,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:43,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-10 20:20:43,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-10 20:20:43,984 INFO L87 Difference]: Start difference. First operand 123 states and 136 transitions. Second operand 4 states. [2020-07-10 20:20:44,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:44,977 INFO L93 Difference]: Finished difference Result 303 states and 342 transitions. [2020-07-10 20:20:44,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-10 20:20:44,977 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-10 20:20:44,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:44,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:20:44,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2020-07-10 20:20:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-10 20:20:44,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2020-07-10 20:20:44,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 342 transitions. [2020-07-10 20:20:45,379 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-10 20:20:45,388 INFO L225 Difference]: With dead ends: 303 [2020-07-10 20:20:45,388 INFO L226 Difference]: Without dead ends: 199 [2020-07-10 20:20:45,391 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-10 20:20:45,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-07-10 20:20:45,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 124. [2020-07-10 20:20:45,486 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:45,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand 124 states. [2020-07-10 20:20:45,486 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand 124 states. [2020-07-10 20:20:45,486 INFO L87 Difference]: Start difference. First operand 199 states. Second operand 124 states. [2020-07-10 20:20:45,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:45,505 INFO L93 Difference]: Finished difference Result 199 states and 225 transitions. [2020-07-10 20:20:45,505 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 225 transitions. [2020-07-10 20:20:45,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:45,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:45,508 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand 199 states. [2020-07-10 20:20:45,508 INFO L87 Difference]: Start difference. First operand 124 states. Second operand 199 states. [2020-07-10 20:20:45,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:45,525 INFO L93 Difference]: Finished difference Result 199 states and 225 transitions. [2020-07-10 20:20:45,526 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 225 transitions. [2020-07-10 20:20:45,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:45,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:45,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:45,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:45,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2020-07-10 20:20:45,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2020-07-10 20:20:45,536 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 23 [2020-07-10 20:20:45,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:45,536 INFO L479 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2020-07-10 20:20:45,536 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-10 20:20:45,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 124 states and 137 transitions. [2020-07-10 20:20:45,675 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-10 20:20:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2020-07-10 20:20:45,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-10 20:20:45,676 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:45,677 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-10 20:20:45,677 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:20:45,678 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:45,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:45,678 INFO L82 PathProgramCache]: Analyzing trace with hash -395870253, now seen corresponding path program 1 times [2020-07-10 20:20:45,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:45,678 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [419656967] [2020-07-10 20:20:45,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:45,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:45,806 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-10 20:20:45,806 INFO L280 TraceCheckUtils]: 1: Hoare triple {2390#true} #valid := #valid[0 := 0]; {2390#true} is VALID [2020-07-10 20:20:45,806 INFO L280 TraceCheckUtils]: 2: Hoare triple {2390#true} assume 0 < #StackHeapBarrier; {2390#true} is VALID [2020-07-10 20:20:45,807 INFO L280 TraceCheckUtils]: 3: Hoare triple {2390#true} assume true; {2390#true} is VALID [2020-07-10 20:20:45,807 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {2390#true} {2390#true} #247#return; {2390#true} is VALID [2020-07-10 20:20:45,810 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-10 20:20:45,811 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-10 20:20:45,811 INFO L280 TraceCheckUtils]: 2: Hoare triple {2390#true} #valid := #valid[0 := 0]; {2390#true} is VALID [2020-07-10 20:20:45,811 INFO L280 TraceCheckUtils]: 3: Hoare triple {2390#true} assume 0 < #StackHeapBarrier; {2390#true} is VALID [2020-07-10 20:20:45,811 INFO L280 TraceCheckUtils]: 4: Hoare triple {2390#true} assume true; {2390#true} is VALID [2020-07-10 20:20:45,812 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {2390#true} {2390#true} #247#return; {2390#true} is VALID [2020-07-10 20:20:45,812 INFO L263 TraceCheckUtils]: 6: Hoare triple {2390#true} call #t~ret23 := main(); {2390#true} is VALID [2020-07-10 20:20:45,812 INFO L280 TraceCheckUtils]: 7: Hoare triple {2390#true} ~n~0 := 0; {2390#true} is VALID [2020-07-10 20:20:45,813 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-10 20:20:45,813 INFO L280 TraceCheckUtils]: 9: Hoare triple {2390#true} havoc ~x~0; {2390#true} is VALID [2020-07-10 20:20:45,813 INFO L280 TraceCheckUtils]: 10: Hoare triple {2390#true} havoc ~y~0; {2390#true} is VALID [2020-07-10 20:20:45,814 INFO L280 TraceCheckUtils]: 11: Hoare triple {2390#true} ~x~0 := 0; {2397#(= 0 main_~x~0)} is VALID [2020-07-10 20:20:45,814 INFO L280 TraceCheckUtils]: 12: Hoare triple {2397#(= 0 main_~x~0)} assume !!(~x~0 < 100000); {2397#(= 0 main_~x~0)} is VALID [2020-07-10 20:20:45,815 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-10 20:20:45,815 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-10 20:20:45,816 INFO L280 TraceCheckUtils]: 15: Hoare triple {2397#(= 0 main_~x~0)} havoc #t~nondet3; {2397#(= 0 main_~x~0)} is VALID [2020-07-10 20:20:45,816 INFO L280 TraceCheckUtils]: 16: Hoare triple {2397#(= 0 main_~x~0)} #t~post2 := ~x~0; {2398#(= |main_#t~post2| 0)} is VALID [2020-07-10 20:20:45,817 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-10 20:20:45,818 INFO L280 TraceCheckUtils]: 18: Hoare triple {2399#(<= main_~x~0 1)} havoc #t~post2; {2399#(<= main_~x~0 1)} is VALID [2020-07-10 20:20:45,823 INFO L280 TraceCheckUtils]: 19: Hoare triple {2399#(<= main_~x~0 1)} assume !(~x~0 < 100000); {2391#false} is VALID [2020-07-10 20:20:45,823 INFO L280 TraceCheckUtils]: 20: Hoare triple {2391#false} ~x~0 := 0; {2391#false} is VALID [2020-07-10 20:20:45,823 INFO L280 TraceCheckUtils]: 21: Hoare triple {2391#false} assume !!(~x~0 < ~n~0); {2391#false} is VALID [2020-07-10 20:20:45,824 INFO L280 TraceCheckUtils]: 22: Hoare triple {2391#false} ~y~0 := 1 + ~x~0; {2391#false} is VALID [2020-07-10 20:20:45,824 INFO L280 TraceCheckUtils]: 23: Hoare triple {2391#false} assume !!(~y~0 < ~n~0); {2391#false} is VALID [2020-07-10 20:20:45,824 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-10 20:20:45,825 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-10 20:20:45,825 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-10 20:20:45,825 INFO L280 TraceCheckUtils]: 27: Hoare triple {2391#false} ~cond := #in~cond; {2391#false} is VALID [2020-07-10 20:20:45,826 INFO L280 TraceCheckUtils]: 28: Hoare triple {2391#false} assume 0 == ~cond; {2391#false} is VALID [2020-07-10 20:20:45,826 INFO L280 TraceCheckUtils]: 29: Hoare triple {2391#false} assume !false; {2391#false} is VALID [2020-07-10 20:20:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:20:45,828 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:45,828 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [419656967] [2020-07-10 20:20:45,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:45,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-07-10 20:20:45,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767636011] [2020-07-10 20:20:45,829 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 20:20:45,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:45,829 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-10 20:20:45,869 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-10 20:20:45,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-10 20:20:45,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:45,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-10 20:20:45,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:20:45,870 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand 6 states. [2020-07-10 20:20:47,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:47,098 INFO L93 Difference]: Finished difference Result 310 states and 349 transitions. [2020-07-10 20:20:47,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-10 20:20:47,099 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 30 [2020-07-10 20:20:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:47,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:20:47,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 349 transitions. [2020-07-10 20:20:47,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-10 20:20:47,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 349 transitions. [2020-07-10 20:20:47,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 349 transitions. [2020-07-10 20:20:47,486 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-10 20:20:47,491 INFO L225 Difference]: With dead ends: 310 [2020-07-10 20:20:47,491 INFO L226 Difference]: Without dead ends: 206 [2020-07-10 20:20:47,493 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-10 20:20:47,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-10 20:20:47,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 131. [2020-07-10 20:20:47,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:47,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 131 states. [2020-07-10 20:20:47,616 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 131 states. [2020-07-10 20:20:47,616 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 131 states. [2020-07-10 20:20:47,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:47,626 INFO L93 Difference]: Finished difference Result 206 states and 232 transitions. [2020-07-10 20:20:47,626 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 232 transitions. [2020-07-10 20:20:47,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:47,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:47,627 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand 206 states. [2020-07-10 20:20:47,627 INFO L87 Difference]: Start difference. First operand 131 states. Second operand 206 states. [2020-07-10 20:20:47,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:47,636 INFO L93 Difference]: Finished difference Result 206 states and 232 transitions. [2020-07-10 20:20:47,637 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 232 transitions. [2020-07-10 20:20:47,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:47,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:47,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:47,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:47,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2020-07-10 20:20:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2020-07-10 20:20:47,643 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 30 [2020-07-10 20:20:47,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:47,643 INFO L479 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2020-07-10 20:20:47,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-10 20:20:47,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 131 states and 144 transitions. [2020-07-10 20:20:47,798 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-10 20:20:47,799 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2020-07-10 20:20:47,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-10 20:20:47,800 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:47,800 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-10 20:20:47,800 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:20:47,800 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:47,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:47,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1926718692, now seen corresponding path program 2 times [2020-07-10 20:20:47,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:47,801 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2061906998] [2020-07-10 20:20:47,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:47,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:47,943 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-10 20:20:47,943 INFO L280 TraceCheckUtils]: 1: Hoare triple {3701#true} #valid := #valid[0 := 0]; {3701#true} is VALID [2020-07-10 20:20:47,944 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} assume 0 < #StackHeapBarrier; {3701#true} is VALID [2020-07-10 20:20:47,944 INFO L280 TraceCheckUtils]: 3: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-10 20:20:47,944 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {3701#true} {3701#true} #247#return; {3701#true} is VALID [2020-07-10 20:20:47,945 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-10 20:20:47,946 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-10 20:20:47,946 INFO L280 TraceCheckUtils]: 2: Hoare triple {3701#true} #valid := #valid[0 := 0]; {3701#true} is VALID [2020-07-10 20:20:47,946 INFO L280 TraceCheckUtils]: 3: Hoare triple {3701#true} assume 0 < #StackHeapBarrier; {3701#true} is VALID [2020-07-10 20:20:47,947 INFO L280 TraceCheckUtils]: 4: Hoare triple {3701#true} assume true; {3701#true} is VALID [2020-07-10 20:20:47,947 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {3701#true} {3701#true} #247#return; {3701#true} is VALID [2020-07-10 20:20:47,947 INFO L263 TraceCheckUtils]: 6: Hoare triple {3701#true} call #t~ret23 := main(); {3701#true} is VALID [2020-07-10 20:20:47,947 INFO L280 TraceCheckUtils]: 7: Hoare triple {3701#true} ~n~0 := 0; {3701#true} is VALID [2020-07-10 20:20:47,948 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-10 20:20:47,948 INFO L280 TraceCheckUtils]: 9: Hoare triple {3701#true} havoc ~x~0; {3701#true} is VALID [2020-07-10 20:20:47,948 INFO L280 TraceCheckUtils]: 10: Hoare triple {3701#true} havoc ~y~0; {3701#true} is VALID [2020-07-10 20:20:47,949 INFO L280 TraceCheckUtils]: 11: Hoare triple {3701#true} ~x~0 := 0; {3708#(= 0 main_~x~0)} is VALID [2020-07-10 20:20:47,949 INFO L280 TraceCheckUtils]: 12: Hoare triple {3708#(= 0 main_~x~0)} assume !!(~x~0 < 100000); {3708#(= 0 main_~x~0)} is VALID [2020-07-10 20:20:47,950 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-10 20:20:47,951 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-10 20:20:47,951 INFO L280 TraceCheckUtils]: 15: Hoare triple {3708#(= 0 main_~x~0)} havoc #t~nondet3; {3708#(= 0 main_~x~0)} is VALID [2020-07-10 20:20:47,952 INFO L280 TraceCheckUtils]: 16: Hoare triple {3708#(= 0 main_~x~0)} #t~post2 := ~x~0; {3709#(= |main_#t~post2| 0)} is VALID [2020-07-10 20:20:47,953 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-10 20:20:47,953 INFO L280 TraceCheckUtils]: 18: Hoare triple {3710#(<= main_~x~0 1)} havoc #t~post2; {3710#(<= main_~x~0 1)} is VALID [2020-07-10 20:20:47,954 INFO L280 TraceCheckUtils]: 19: Hoare triple {3710#(<= main_~x~0 1)} assume !!(~x~0 < 100000); {3710#(<= main_~x~0 1)} is VALID [2020-07-10 20:20:47,955 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-10 20:20:47,956 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-10 20:20:47,957 INFO L280 TraceCheckUtils]: 22: Hoare triple {3710#(<= main_~x~0 1)} havoc #t~nondet3; {3710#(<= main_~x~0 1)} is VALID [2020-07-10 20:20:47,958 INFO L280 TraceCheckUtils]: 23: Hoare triple {3710#(<= main_~x~0 1)} #t~post2 := ~x~0; {3711#(<= |main_#t~post2| 1)} is VALID [2020-07-10 20:20:47,959 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-10 20:20:47,959 INFO L280 TraceCheckUtils]: 25: Hoare triple {3712#(<= main_~x~0 2)} havoc #t~post2; {3712#(<= main_~x~0 2)} is VALID [2020-07-10 20:20:47,960 INFO L280 TraceCheckUtils]: 26: Hoare triple {3712#(<= main_~x~0 2)} assume !(~x~0 < 100000); {3702#false} is VALID [2020-07-10 20:20:47,961 INFO L280 TraceCheckUtils]: 27: Hoare triple {3702#false} ~x~0 := 0; {3702#false} is VALID [2020-07-10 20:20:47,961 INFO L280 TraceCheckUtils]: 28: Hoare triple {3702#false} assume !!(~x~0 < ~n~0); {3702#false} is VALID [2020-07-10 20:20:47,961 INFO L280 TraceCheckUtils]: 29: Hoare triple {3702#false} ~y~0 := 1 + ~x~0; {3702#false} is VALID [2020-07-10 20:20:47,961 INFO L280 TraceCheckUtils]: 30: Hoare triple {3702#false} assume !!(~y~0 < ~n~0); {3702#false} is VALID [2020-07-10 20:20:47,962 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-10 20:20:47,962 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-10 20:20:47,962 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-10 20:20:47,963 INFO L280 TraceCheckUtils]: 34: Hoare triple {3702#false} ~cond := #in~cond; {3702#false} is VALID [2020-07-10 20:20:47,963 INFO L280 TraceCheckUtils]: 35: Hoare triple {3702#false} assume 0 == ~cond; {3702#false} is VALID [2020-07-10 20:20:47,963 INFO L280 TraceCheckUtils]: 36: Hoare triple {3702#false} assume !false; {3702#false} is VALID [2020-07-10 20:20:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:20:47,966 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:47,966 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2061906998] [2020-07-10 20:20:47,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:47,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-07-10 20:20:47,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973869568] [2020-07-10 20:20:47,967 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2020-07-10 20:20:47,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:47,968 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-10 20:20:48,010 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-10 20:20:48,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-10 20:20:48,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:48,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-10 20:20:48,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-10 20:20:48,011 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand 8 states. [2020-07-10 20:20:49,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:49,298 INFO L93 Difference]: Finished difference Result 317 states and 356 transitions. [2020-07-10 20:20:49,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 20:20:49,298 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2020-07-10 20:20:49,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:49,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:20:49,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 356 transitions. [2020-07-10 20:20:49,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-10 20:20:49,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 356 transitions. [2020-07-10 20:20:49,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 356 transitions. [2020-07-10 20:20:49,692 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-10 20:20:49,697 INFO L225 Difference]: With dead ends: 317 [2020-07-10 20:20:49,698 INFO L226 Difference]: Without dead ends: 213 [2020-07-10 20:20:49,699 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2020-07-10 20:20:49,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2020-07-10 20:20:49,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 138. [2020-07-10 20:20:49,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:49,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand 138 states. [2020-07-10 20:20:49,816 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand 138 states. [2020-07-10 20:20:49,817 INFO L87 Difference]: Start difference. First operand 213 states. Second operand 138 states. [2020-07-10 20:20:49,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:49,826 INFO L93 Difference]: Finished difference Result 213 states and 239 transitions. [2020-07-10 20:20:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 239 transitions. [2020-07-10 20:20:49,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:49,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:49,827 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand 213 states. [2020-07-10 20:20:49,828 INFO L87 Difference]: Start difference. First operand 138 states. Second operand 213 states. [2020-07-10 20:20:49,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:49,836 INFO L93 Difference]: Finished difference Result 213 states and 239 transitions. [2020-07-10 20:20:49,836 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 239 transitions. [2020-07-10 20:20:49,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:49,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:49,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:49,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2020-07-10 20:20:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 151 transitions. [2020-07-10 20:20:49,843 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 151 transitions. Word has length 37 [2020-07-10 20:20:49,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:49,843 INFO L479 AbstractCegarLoop]: Abstraction has 138 states and 151 transitions. [2020-07-10 20:20:49,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-10 20:20:49,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 138 states and 151 transitions. [2020-07-10 20:20:50,008 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-10 20:20:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 151 transitions. [2020-07-10 20:20:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-07-10 20:20:50,010 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:50,011 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-10 20:20:50,011 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:20:50,011 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:50,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:50,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1889524403, now seen corresponding path program 3 times [2020-07-10 20:20:50,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:50,012 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1112596359] [2020-07-10 20:20:50,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:50,133 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-10 20:20:50,133 INFO L280 TraceCheckUtils]: 1: Hoare triple {5060#true} #valid := #valid[0 := 0]; {5060#true} is VALID [2020-07-10 20:20:50,133 INFO L280 TraceCheckUtils]: 2: Hoare triple {5060#true} assume 0 < #StackHeapBarrier; {5060#true} is VALID [2020-07-10 20:20:50,134 INFO L280 TraceCheckUtils]: 3: Hoare triple {5060#true} assume true; {5060#true} is VALID [2020-07-10 20:20:50,134 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {5060#true} {5060#true} #247#return; {5060#true} is VALID [2020-07-10 20:20:50,135 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-10 20:20:50,135 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-10 20:20:50,136 INFO L280 TraceCheckUtils]: 2: Hoare triple {5060#true} #valid := #valid[0 := 0]; {5060#true} is VALID [2020-07-10 20:20:50,136 INFO L280 TraceCheckUtils]: 3: Hoare triple {5060#true} assume 0 < #StackHeapBarrier; {5060#true} is VALID [2020-07-10 20:20:50,136 INFO L280 TraceCheckUtils]: 4: Hoare triple {5060#true} assume true; {5060#true} is VALID [2020-07-10 20:20:50,136 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {5060#true} {5060#true} #247#return; {5060#true} is VALID [2020-07-10 20:20:50,137 INFO L263 TraceCheckUtils]: 6: Hoare triple {5060#true} call #t~ret23 := main(); {5060#true} is VALID [2020-07-10 20:20:50,137 INFO L280 TraceCheckUtils]: 7: Hoare triple {5060#true} ~n~0 := 0; {5067#(= 0 main_~n~0)} is VALID [2020-07-10 20:20:50,138 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-10 20:20:50,142 INFO L280 TraceCheckUtils]: 9: Hoare triple {5067#(= 0 main_~n~0)} havoc ~x~0; {5067#(= 0 main_~n~0)} is VALID [2020-07-10 20:20:50,142 INFO L280 TraceCheckUtils]: 10: Hoare triple {5067#(= 0 main_~n~0)} havoc ~y~0; {5067#(= 0 main_~n~0)} is VALID [2020-07-10 20:20:50,143 INFO L280 TraceCheckUtils]: 11: Hoare triple {5067#(= 0 main_~n~0)} ~x~0 := 0; {5067#(= 0 main_~n~0)} is VALID [2020-07-10 20:20:50,143 INFO L280 TraceCheckUtils]: 12: Hoare triple {5067#(= 0 main_~n~0)} assume !!(~x~0 < 100000); {5067#(= 0 main_~n~0)} is VALID [2020-07-10 20:20:50,144 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-10 20:20:50,144 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-10 20:20:50,145 INFO L280 TraceCheckUtils]: 15: Hoare triple {5067#(= 0 main_~n~0)} havoc #t~nondet3; {5067#(= 0 main_~n~0)} is VALID [2020-07-10 20:20:50,145 INFO L280 TraceCheckUtils]: 16: Hoare triple {5067#(= 0 main_~n~0)} #t~post2 := ~x~0; {5067#(= 0 main_~n~0)} is VALID [2020-07-10 20:20:50,145 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-10 20:20:50,146 INFO L280 TraceCheckUtils]: 18: Hoare triple {5067#(= 0 main_~n~0)} havoc #t~post2; {5067#(= 0 main_~n~0)} is VALID [2020-07-10 20:20:50,146 INFO L280 TraceCheckUtils]: 19: Hoare triple {5067#(= 0 main_~n~0)} assume !!(~x~0 < 100000); {5067#(= 0 main_~n~0)} is VALID [2020-07-10 20:20:50,148 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-10 20:20:50,148 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-10 20:20:50,149 INFO L280 TraceCheckUtils]: 22: Hoare triple {5067#(= 0 main_~n~0)} havoc #t~nondet3; {5067#(= 0 main_~n~0)} is VALID [2020-07-10 20:20:50,149 INFO L280 TraceCheckUtils]: 23: Hoare triple {5067#(= 0 main_~n~0)} #t~post2 := ~x~0; {5067#(= 0 main_~n~0)} is VALID [2020-07-10 20:20:50,150 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-10 20:20:50,151 INFO L280 TraceCheckUtils]: 25: Hoare triple {5067#(= 0 main_~n~0)} havoc #t~post2; {5067#(= 0 main_~n~0)} is VALID [2020-07-10 20:20:50,151 INFO L280 TraceCheckUtils]: 26: Hoare triple {5067#(= 0 main_~n~0)} assume !!(~x~0 < 100000); {5067#(= 0 main_~n~0)} is VALID [2020-07-10 20:20:50,152 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-10 20:20:50,152 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-10 20:20:50,152 INFO L280 TraceCheckUtils]: 29: Hoare triple {5067#(= 0 main_~n~0)} havoc #t~nondet3; {5067#(= 0 main_~n~0)} is VALID [2020-07-10 20:20:50,153 INFO L280 TraceCheckUtils]: 30: Hoare triple {5067#(= 0 main_~n~0)} #t~post2 := ~x~0; {5067#(= 0 main_~n~0)} is VALID [2020-07-10 20:20:50,153 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-10 20:20:50,154 INFO L280 TraceCheckUtils]: 32: Hoare triple {5067#(= 0 main_~n~0)} havoc #t~post2; {5067#(= 0 main_~n~0)} is VALID [2020-07-10 20:20:50,154 INFO L280 TraceCheckUtils]: 33: Hoare triple {5067#(= 0 main_~n~0)} assume !(~x~0 < 100000); {5067#(= 0 main_~n~0)} is VALID [2020-07-10 20:20:50,155 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-10 20:20:50,155 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-10 20:20:50,155 INFO L280 TraceCheckUtils]: 36: Hoare triple {5061#false} ~y~0 := 1 + ~x~0; {5061#false} is VALID [2020-07-10 20:20:50,156 INFO L280 TraceCheckUtils]: 37: Hoare triple {5061#false} assume !!(~y~0 < ~n~0); {5061#false} is VALID [2020-07-10 20:20:50,156 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-10 20:20:50,156 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-10 20:20:50,156 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-10 20:20:50,156 INFO L280 TraceCheckUtils]: 41: Hoare triple {5061#false} ~cond := #in~cond; {5061#false} is VALID [2020-07-10 20:20:50,157 INFO L280 TraceCheckUtils]: 42: Hoare triple {5061#false} assume 0 == ~cond; {5061#false} is VALID [2020-07-10 20:20:50,157 INFO L280 TraceCheckUtils]: 43: Hoare triple {5061#false} assume !false; {5061#false} is VALID [2020-07-10 20:20:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:20:50,160 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:50,161 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1112596359] [2020-07-10 20:20:50,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:50,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:20:50,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086771382] [2020-07-10 20:20:50,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2020-07-10 20:20:50,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:50,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:20:50,188 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-10 20:20:50,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:20:50,188 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:50,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:20:50,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:20:50,189 INFO L87 Difference]: Start difference. First operand 138 states and 151 transitions. Second operand 5 states. [2020-07-10 20:20:50,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:50,878 INFO L93 Difference]: Finished difference Result 248 states and 276 transitions. [2020-07-10 20:20:50,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:20:50,879 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2020-07-10 20:20:50,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:50,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:20:50,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 267 transitions. [2020-07-10 20:20:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:20:50,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 267 transitions. [2020-07-10 20:20:50,888 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 267 transitions. [2020-07-10 20:20:51,160 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-10 20:20:51,164 INFO L225 Difference]: With dead ends: 248 [2020-07-10 20:20:51,165 INFO L226 Difference]: Without dead ends: 143 [2020-07-10 20:20:51,166 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-07-10 20:20:51,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2020-07-10 20:20:51,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 137. [2020-07-10 20:20:51,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:51,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand 137 states. [2020-07-10 20:20:51,297 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand 137 states. [2020-07-10 20:20:51,297 INFO L87 Difference]: Start difference. First operand 143 states. Second operand 137 states. [2020-07-10 20:20:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:51,302 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2020-07-10 20:20:51,302 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2020-07-10 20:20:51,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:51,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:51,303 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand 143 states. [2020-07-10 20:20:51,303 INFO L87 Difference]: Start difference. First operand 137 states. Second operand 143 states. [2020-07-10 20:20:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:51,309 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2020-07-10 20:20:51,309 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 156 transitions. [2020-07-10 20:20:51,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:51,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:51,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:51,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:51,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2020-07-10 20:20:51,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2020-07-10 20:20:51,316 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 44 [2020-07-10 20:20:51,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:51,316 INFO L479 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2020-07-10 20:20:51,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:20:51,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 137 states and 149 transitions. [2020-07-10 20:20:51,490 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-10 20:20:51,490 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2020-07-10 20:20:51,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2020-07-10 20:20:51,491 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:51,492 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-10 20:20:51,492 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 20:20:51,493 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:51,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:51,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1581132658, now seen corresponding path program 1 times [2020-07-10 20:20:51,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:51,494 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [242657570] [2020-07-10 20:20:51,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:51,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:51,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:51,678 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-10 20:20:51,678 INFO L280 TraceCheckUtils]: 1: Hoare triple {6130#true} #valid := #valid[0 := 0]; {6130#true} is VALID [2020-07-10 20:20:51,678 INFO L280 TraceCheckUtils]: 2: Hoare triple {6130#true} assume 0 < #StackHeapBarrier; {6130#true} is VALID [2020-07-10 20:20:51,679 INFO L280 TraceCheckUtils]: 3: Hoare triple {6130#true} assume true; {6130#true} is VALID [2020-07-10 20:20:51,679 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {6130#true} {6130#true} #247#return; {6130#true} is VALID [2020-07-10 20:20:51,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:51,685 INFO L280 TraceCheckUtils]: 0: Hoare triple {6130#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {6130#true} is VALID [2020-07-10 20:20:51,685 INFO L280 TraceCheckUtils]: 1: Hoare triple {6130#true} ~size := #in~size; {6130#true} is VALID [2020-07-10 20:20:51,685 INFO L280 TraceCheckUtils]: 2: Hoare triple {6130#true} ~value := #in~value; {6130#true} is VALID [2020-07-10 20:20:51,686 INFO L280 TraceCheckUtils]: 3: Hoare triple {6130#true} havoc ~i~0; {6130#true} is VALID [2020-07-10 20:20:51,686 INFO L280 TraceCheckUtils]: 4: Hoare triple {6130#true} ~i~0 := 0; {6130#true} is VALID [2020-07-10 20:20:51,686 INFO L280 TraceCheckUtils]: 5: Hoare triple {6130#true} assume !(~i~0 < ~size); {6130#true} is VALID [2020-07-10 20:20:51,686 INFO L280 TraceCheckUtils]: 6: Hoare triple {6130#true} #res := 0; {6130#true} is VALID [2020-07-10 20:20:51,687 INFO L280 TraceCheckUtils]: 7: Hoare triple {6130#true} assume true; {6130#true} is VALID [2020-07-10 20:20:51,687 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {6130#true} {6131#false} #253#return; {6131#false} is VALID [2020-07-10 20:20:51,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:51,703 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-10 20:20:51,704 INFO L280 TraceCheckUtils]: 1: Hoare triple {6130#true} ~size := #in~size; {6130#true} is VALID [2020-07-10 20:20:51,704 INFO L280 TraceCheckUtils]: 2: Hoare triple {6130#true} ~value := #in~value; {6130#true} is VALID [2020-07-10 20:20:51,704 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-10 20:20:51,704 INFO L280 TraceCheckUtils]: 4: Hoare triple {6130#true} #res := 1 + ~size; {6130#true} is VALID [2020-07-10 20:20:51,704 INFO L280 TraceCheckUtils]: 5: Hoare triple {6130#true} assume true; {6130#true} is VALID [2020-07-10 20:20:51,705 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {6130#true} {6131#false} #255#return; {6131#false} is VALID [2020-07-10 20:20:51,710 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-10 20:20:51,710 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-10 20:20:51,710 INFO L280 TraceCheckUtils]: 2: Hoare triple {6130#true} #valid := #valid[0 := 0]; {6130#true} is VALID [2020-07-10 20:20:51,710 INFO L280 TraceCheckUtils]: 3: Hoare triple {6130#true} assume 0 < #StackHeapBarrier; {6130#true} is VALID [2020-07-10 20:20:51,711 INFO L280 TraceCheckUtils]: 4: Hoare triple {6130#true} assume true; {6130#true} is VALID [2020-07-10 20:20:51,711 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {6130#true} {6130#true} #247#return; {6130#true} is VALID [2020-07-10 20:20:51,711 INFO L263 TraceCheckUtils]: 6: Hoare triple {6130#true} call #t~ret23 := main(); {6130#true} is VALID [2020-07-10 20:20:51,711 INFO L280 TraceCheckUtils]: 7: Hoare triple {6130#true} ~n~0 := 0; {6130#true} is VALID [2020-07-10 20:20:51,711 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-10 20:20:51,712 INFO L280 TraceCheckUtils]: 9: Hoare triple {6130#true} havoc ~x~0; {6130#true} is VALID [2020-07-10 20:20:51,712 INFO L280 TraceCheckUtils]: 10: Hoare triple {6130#true} havoc ~y~0; {6130#true} is VALID [2020-07-10 20:20:51,713 INFO L280 TraceCheckUtils]: 11: Hoare triple {6130#true} ~x~0 := 0; {6137#(= 0 main_~x~0)} is VALID [2020-07-10 20:20:51,713 INFO L280 TraceCheckUtils]: 12: Hoare triple {6137#(= 0 main_~x~0)} assume !!(~x~0 < 100000); {6137#(= 0 main_~x~0)} is VALID [2020-07-10 20:20:51,714 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-10 20:20:51,715 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-10 20:20:51,715 INFO L280 TraceCheckUtils]: 15: Hoare triple {6137#(= 0 main_~x~0)} havoc #t~nondet3; {6137#(= 0 main_~x~0)} is VALID [2020-07-10 20:20:51,716 INFO L280 TraceCheckUtils]: 16: Hoare triple {6137#(= 0 main_~x~0)} #t~post2 := ~x~0; {6138#(= |main_#t~post2| 0)} is VALID [2020-07-10 20:20:51,716 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-10 20:20:51,717 INFO L280 TraceCheckUtils]: 18: Hoare triple {6139#(<= main_~x~0 1)} havoc #t~post2; {6139#(<= main_~x~0 1)} is VALID [2020-07-10 20:20:51,717 INFO L280 TraceCheckUtils]: 19: Hoare triple {6139#(<= main_~x~0 1)} assume !!(~x~0 < 100000); {6139#(<= main_~x~0 1)} is VALID [2020-07-10 20:20:51,717 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-10 20:20:51,718 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-10 20:20:51,718 INFO L280 TraceCheckUtils]: 22: Hoare triple {6139#(<= main_~x~0 1)} havoc #t~nondet3; {6139#(<= main_~x~0 1)} is VALID [2020-07-10 20:20:51,719 INFO L280 TraceCheckUtils]: 23: Hoare triple {6139#(<= main_~x~0 1)} #t~post2 := ~x~0; {6140#(<= |main_#t~post2| 1)} is VALID [2020-07-10 20:20:51,719 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-10 20:20:51,720 INFO L280 TraceCheckUtils]: 25: Hoare triple {6141#(<= main_~x~0 2)} havoc #t~post2; {6141#(<= main_~x~0 2)} is VALID [2020-07-10 20:20:51,720 INFO L280 TraceCheckUtils]: 26: Hoare triple {6141#(<= main_~x~0 2)} assume !!(~x~0 < 100000); {6141#(<= main_~x~0 2)} is VALID [2020-07-10 20:20:51,721 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-10 20:20:51,721 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-10 20:20:51,722 INFO L280 TraceCheckUtils]: 29: Hoare triple {6141#(<= main_~x~0 2)} havoc #t~nondet3; {6141#(<= main_~x~0 2)} is VALID [2020-07-10 20:20:51,722 INFO L280 TraceCheckUtils]: 30: Hoare triple {6141#(<= main_~x~0 2)} #t~post2 := ~x~0; {6142#(<= |main_#t~post2| 2)} is VALID [2020-07-10 20:20:51,723 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-10 20:20:51,723 INFO L280 TraceCheckUtils]: 32: Hoare triple {6143#(<= main_~x~0 3)} havoc #t~post2; {6143#(<= main_~x~0 3)} is VALID [2020-07-10 20:20:51,724 INFO L280 TraceCheckUtils]: 33: Hoare triple {6143#(<= main_~x~0 3)} assume !(~x~0 < 100000); {6131#false} is VALID [2020-07-10 20:20:51,724 INFO L280 TraceCheckUtils]: 34: Hoare triple {6131#false} ~x~0 := 0; {6131#false} is VALID [2020-07-10 20:20:51,724 INFO L280 TraceCheckUtils]: 35: Hoare triple {6131#false} assume !(~x~0 < ~n~0); {6131#false} is VALID [2020-07-10 20:20:51,724 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-10 20:20:51,725 INFO L280 TraceCheckUtils]: 37: Hoare triple {6131#false} havoc ~v~0; {6131#false} is VALID [2020-07-10 20:20:51,725 INFO L280 TraceCheckUtils]: 38: Hoare triple {6131#false} ~v~0 := 0; {6131#false} is VALID [2020-07-10 20:20:51,725 INFO L280 TraceCheckUtils]: 39: Hoare triple {6131#false} assume !(~v~0 < 100000); {6131#false} is VALID [2020-07-10 20:20:51,725 INFO L280 TraceCheckUtils]: 40: Hoare triple {6131#false} ~v~0 := 0; {6131#false} is VALID [2020-07-10 20:20:51,725 INFO L280 TraceCheckUtils]: 41: Hoare triple {6131#false} assume !!(~v~0 < 100000); {6131#false} is VALID [2020-07-10 20:20:51,726 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-10 20:20:51,726 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-10 20:20:51,726 INFO L280 TraceCheckUtils]: 44: Hoare triple {6130#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {6130#true} is VALID [2020-07-10 20:20:51,726 INFO L280 TraceCheckUtils]: 45: Hoare triple {6130#true} ~size := #in~size; {6130#true} is VALID [2020-07-10 20:20:51,726 INFO L280 TraceCheckUtils]: 46: Hoare triple {6130#true} ~value := #in~value; {6130#true} is VALID [2020-07-10 20:20:51,727 INFO L280 TraceCheckUtils]: 47: Hoare triple {6130#true} havoc ~i~0; {6130#true} is VALID [2020-07-10 20:20:51,727 INFO L280 TraceCheckUtils]: 48: Hoare triple {6130#true} ~i~0 := 0; {6130#true} is VALID [2020-07-10 20:20:51,727 INFO L280 TraceCheckUtils]: 49: Hoare triple {6130#true} assume !(~i~0 < ~size); {6130#true} is VALID [2020-07-10 20:20:51,727 INFO L280 TraceCheckUtils]: 50: Hoare triple {6130#true} #res := 0; {6130#true} is VALID [2020-07-10 20:20:51,727 INFO L280 TraceCheckUtils]: 51: Hoare triple {6130#true} assume true; {6130#true} is VALID [2020-07-10 20:20:51,728 INFO L275 TraceCheckUtils]: 52: Hoare quadruple {6130#true} {6131#false} #253#return; {6131#false} is VALID [2020-07-10 20:20:51,728 INFO L280 TraceCheckUtils]: 53: Hoare triple {6131#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {6131#false} is VALID [2020-07-10 20:20:51,728 INFO L280 TraceCheckUtils]: 54: Hoare triple {6131#false} assume 0 != #t~ret12; {6131#false} is VALID [2020-07-10 20:20:51,728 INFO L280 TraceCheckUtils]: 55: Hoare triple {6131#false} havoc #t~mem11; {6131#false} is VALID [2020-07-10 20:20:51,729 INFO L280 TraceCheckUtils]: 56: Hoare triple {6131#false} havoc #t~ret12; {6131#false} is VALID [2020-07-10 20:20:51,729 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-10 20:20:51,729 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-10 20:20:51,730 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-10 20:20:51,730 INFO L280 TraceCheckUtils]: 60: Hoare triple {6130#true} ~size := #in~size; {6130#true} is VALID [2020-07-10 20:20:51,730 INFO L280 TraceCheckUtils]: 61: Hoare triple {6130#true} ~value := #in~value; {6130#true} is VALID [2020-07-10 20:20:51,730 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-10 20:20:51,731 INFO L280 TraceCheckUtils]: 63: Hoare triple {6130#true} #res := 1 + ~size; {6130#true} is VALID [2020-07-10 20:20:51,731 INFO L280 TraceCheckUtils]: 64: Hoare triple {6130#true} assume true; {6130#true} is VALID [2020-07-10 20:20:51,731 INFO L275 TraceCheckUtils]: 65: Hoare quadruple {6130#true} {6131#false} #255#return; {6131#false} is VALID [2020-07-10 20:20:51,731 INFO L280 TraceCheckUtils]: 66: Hoare triple {6131#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {6131#false} is VALID [2020-07-10 20:20:51,731 INFO L280 TraceCheckUtils]: 67: Hoare triple {6131#false} ~n~0 := #t~ret14; {6131#false} is VALID [2020-07-10 20:20:51,732 INFO L280 TraceCheckUtils]: 68: Hoare triple {6131#false} havoc #t~ret14; {6131#false} is VALID [2020-07-10 20:20:51,732 INFO L280 TraceCheckUtils]: 69: Hoare triple {6131#false} havoc #t~mem13; {6131#false} is VALID [2020-07-10 20:20:51,732 INFO L280 TraceCheckUtils]: 70: Hoare triple {6131#false} ~x~0 := 0; {6131#false} is VALID [2020-07-10 20:20:51,732 INFO L280 TraceCheckUtils]: 71: Hoare triple {6131#false} assume !!(~x~0 < ~n~0); {6131#false} is VALID [2020-07-10 20:20:51,733 INFO L280 TraceCheckUtils]: 72: Hoare triple {6131#false} ~y~0 := 1 + ~x~0; {6131#false} is VALID [2020-07-10 20:20:51,733 INFO L280 TraceCheckUtils]: 73: Hoare triple {6131#false} assume !!(~y~0 < ~n~0); {6131#false} is VALID [2020-07-10 20:20:51,733 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-10 20:20:51,734 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-10 20:20:51,734 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-10 20:20:51,734 INFO L280 TraceCheckUtils]: 77: Hoare triple {6131#false} ~cond := #in~cond; {6131#false} is VALID [2020-07-10 20:20:51,734 INFO L280 TraceCheckUtils]: 78: Hoare triple {6131#false} assume 0 == ~cond; {6131#false} is VALID [2020-07-10 20:20:51,734 INFO L280 TraceCheckUtils]: 79: Hoare triple {6131#false} assume !false; {6131#false} is VALID [2020-07-10 20:20:51,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:20:51,739 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:51,740 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [242657570] [2020-07-10 20:20:51,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:51,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-07-10 20:20:51,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452139032] [2020-07-10 20:20:51,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2020-07-10 20:20:51,741 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:51,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-10 20:20:51,841 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-10 20:20:51,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-10 20:20:51,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:51,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-10 20:20:51,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-07-10 20:20:51,843 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand 11 states. [2020-07-10 20:20:53,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:53,747 INFO L93 Difference]: Finished difference Result 298 states and 331 transitions. [2020-07-10 20:20:53,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-07-10 20:20:53,749 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 80 [2020-07-10 20:20:53,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:53,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:20:53,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 303 transitions. [2020-07-10 20:20:53,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-10 20:20:53,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 303 transitions. [2020-07-10 20:20:53,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 303 transitions. [2020-07-10 20:20:54,054 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-10 20:20:54,058 INFO L225 Difference]: With dead ends: 298 [2020-07-10 20:20:54,058 INFO L226 Difference]: Without dead ends: 195 [2020-07-10 20:20:54,059 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-10 20:20:54,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2020-07-10 20:20:54,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 144. [2020-07-10 20:20:54,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:54,225 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand 144 states. [2020-07-10 20:20:54,225 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand 144 states. [2020-07-10 20:20:54,225 INFO L87 Difference]: Start difference. First operand 195 states. Second operand 144 states. [2020-07-10 20:20:54,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:54,231 INFO L93 Difference]: Finished difference Result 195 states and 216 transitions. [2020-07-10 20:20:54,231 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 216 transitions. [2020-07-10 20:20:54,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:54,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:54,232 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand 195 states. [2020-07-10 20:20:54,233 INFO L87 Difference]: Start difference. First operand 144 states. Second operand 195 states. [2020-07-10 20:20:54,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:54,239 INFO L93 Difference]: Finished difference Result 195 states and 216 transitions. [2020-07-10 20:20:54,239 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 216 transitions. [2020-07-10 20:20:54,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:54,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:54,240 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:54,240 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:54,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-07-10 20:20:54,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 156 transitions. [2020-07-10 20:20:54,244 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 156 transitions. Word has length 80 [2020-07-10 20:20:54,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:54,244 INFO L479 AbstractCegarLoop]: Abstraction has 144 states and 156 transitions. [2020-07-10 20:20:54,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-10 20:20:54,245 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 144 states and 156 transitions. [2020-07-10 20:20:54,425 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-10 20:20:54,425 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 156 transitions. [2020-07-10 20:20:54,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2020-07-10 20:20:54,427 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:54,427 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-10 20:20:54,428 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 20:20:54,429 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:54,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:54,429 INFO L82 PathProgramCache]: Analyzing trace with hash -2142538913, now seen corresponding path program 2 times [2020-07-10 20:20:54,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:54,430 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1874363685] [2020-07-10 20:20:54,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:54,657 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-10 20:20:54,657 INFO L280 TraceCheckUtils]: 1: Hoare triple {7455#true} #valid := #valid[0 := 0]; {7455#true} is VALID [2020-07-10 20:20:54,657 INFO L280 TraceCheckUtils]: 2: Hoare triple {7455#true} assume 0 < #StackHeapBarrier; {7455#true} is VALID [2020-07-10 20:20:54,658 INFO L280 TraceCheckUtils]: 3: Hoare triple {7455#true} assume true; {7455#true} is VALID [2020-07-10 20:20:54,658 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {7455#true} {7455#true} #247#return; {7455#true} is VALID [2020-07-10 20:20:54,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:54,663 INFO L280 TraceCheckUtils]: 0: Hoare triple {7455#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {7455#true} is VALID [2020-07-10 20:20:54,664 INFO L280 TraceCheckUtils]: 1: Hoare triple {7455#true} ~size := #in~size; {7455#true} is VALID [2020-07-10 20:20:54,664 INFO L280 TraceCheckUtils]: 2: Hoare triple {7455#true} ~value := #in~value; {7455#true} is VALID [2020-07-10 20:20:54,664 INFO L280 TraceCheckUtils]: 3: Hoare triple {7455#true} havoc ~i~0; {7455#true} is VALID [2020-07-10 20:20:54,665 INFO L280 TraceCheckUtils]: 4: Hoare triple {7455#true} ~i~0 := 0; {7455#true} is VALID [2020-07-10 20:20:54,665 INFO L280 TraceCheckUtils]: 5: Hoare triple {7455#true} assume !(~i~0 < ~size); {7455#true} is VALID [2020-07-10 20:20:54,665 INFO L280 TraceCheckUtils]: 6: Hoare triple {7455#true} #res := 0; {7455#true} is VALID [2020-07-10 20:20:54,665 INFO L280 TraceCheckUtils]: 7: Hoare triple {7455#true} assume true; {7455#true} is VALID [2020-07-10 20:20:54,666 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {7455#true} {7456#false} #253#return; {7456#false} is VALID [2020-07-10 20:20:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:54,681 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-10 20:20:54,682 INFO L280 TraceCheckUtils]: 1: Hoare triple {7455#true} ~size := #in~size; {7455#true} is VALID [2020-07-10 20:20:54,682 INFO L280 TraceCheckUtils]: 2: Hoare triple {7455#true} ~value := #in~value; {7455#true} is VALID [2020-07-10 20:20:54,682 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-10 20:20:54,683 INFO L280 TraceCheckUtils]: 4: Hoare triple {7455#true} #res := 1 + ~size; {7455#true} is VALID [2020-07-10 20:20:54,683 INFO L280 TraceCheckUtils]: 5: Hoare triple {7455#true} assume true; {7455#true} is VALID [2020-07-10 20:20:54,683 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {7455#true} {7456#false} #255#return; {7456#false} is VALID [2020-07-10 20:20:54,684 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-10 20:20:54,684 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-10 20:20:54,685 INFO L280 TraceCheckUtils]: 2: Hoare triple {7455#true} #valid := #valid[0 := 0]; {7455#true} is VALID [2020-07-10 20:20:54,685 INFO L280 TraceCheckUtils]: 3: Hoare triple {7455#true} assume 0 < #StackHeapBarrier; {7455#true} is VALID [2020-07-10 20:20:54,685 INFO L280 TraceCheckUtils]: 4: Hoare triple {7455#true} assume true; {7455#true} is VALID [2020-07-10 20:20:54,685 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {7455#true} {7455#true} #247#return; {7455#true} is VALID [2020-07-10 20:20:54,686 INFO L263 TraceCheckUtils]: 6: Hoare triple {7455#true} call #t~ret23 := main(); {7455#true} is VALID [2020-07-10 20:20:54,686 INFO L280 TraceCheckUtils]: 7: Hoare triple {7455#true} ~n~0 := 0; {7455#true} is VALID [2020-07-10 20:20:54,686 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-10 20:20:54,686 INFO L280 TraceCheckUtils]: 9: Hoare triple {7455#true} havoc ~x~0; {7455#true} is VALID [2020-07-10 20:20:54,687 INFO L280 TraceCheckUtils]: 10: Hoare triple {7455#true} havoc ~y~0; {7455#true} is VALID [2020-07-10 20:20:54,687 INFO L280 TraceCheckUtils]: 11: Hoare triple {7455#true} ~x~0 := 0; {7462#(= 0 main_~x~0)} is VALID [2020-07-10 20:20:54,688 INFO L280 TraceCheckUtils]: 12: Hoare triple {7462#(= 0 main_~x~0)} assume !!(~x~0 < 100000); {7462#(= 0 main_~x~0)} is VALID [2020-07-10 20:20:54,688 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-10 20:20:54,689 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-10 20:20:54,690 INFO L280 TraceCheckUtils]: 15: Hoare triple {7462#(= 0 main_~x~0)} havoc #t~nondet3; {7462#(= 0 main_~x~0)} is VALID [2020-07-10 20:20:54,690 INFO L280 TraceCheckUtils]: 16: Hoare triple {7462#(= 0 main_~x~0)} #t~post2 := ~x~0; {7463#(= |main_#t~post2| 0)} is VALID [2020-07-10 20:20:54,691 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-10 20:20:54,692 INFO L280 TraceCheckUtils]: 18: Hoare triple {7464#(<= main_~x~0 1)} havoc #t~post2; {7464#(<= main_~x~0 1)} is VALID [2020-07-10 20:20:54,692 INFO L280 TraceCheckUtils]: 19: Hoare triple {7464#(<= main_~x~0 1)} assume !!(~x~0 < 100000); {7464#(<= main_~x~0 1)} is VALID [2020-07-10 20:20:54,693 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-10 20:20:54,693 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-10 20:20:54,694 INFO L280 TraceCheckUtils]: 22: Hoare triple {7464#(<= main_~x~0 1)} havoc #t~nondet3; {7464#(<= main_~x~0 1)} is VALID [2020-07-10 20:20:54,694 INFO L280 TraceCheckUtils]: 23: Hoare triple {7464#(<= main_~x~0 1)} #t~post2 := ~x~0; {7465#(<= |main_#t~post2| 1)} is VALID [2020-07-10 20:20:54,695 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-10 20:20:54,696 INFO L280 TraceCheckUtils]: 25: Hoare triple {7466#(<= main_~x~0 2)} havoc #t~post2; {7466#(<= main_~x~0 2)} is VALID [2020-07-10 20:20:54,696 INFO L280 TraceCheckUtils]: 26: Hoare triple {7466#(<= main_~x~0 2)} assume !!(~x~0 < 100000); {7466#(<= main_~x~0 2)} is VALID [2020-07-10 20:20:54,697 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-10 20:20:54,697 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-10 20:20:54,698 INFO L280 TraceCheckUtils]: 29: Hoare triple {7466#(<= main_~x~0 2)} havoc #t~nondet3; {7466#(<= main_~x~0 2)} is VALID [2020-07-10 20:20:54,699 INFO L280 TraceCheckUtils]: 30: Hoare triple {7466#(<= main_~x~0 2)} #t~post2 := ~x~0; {7467#(<= |main_#t~post2| 2)} is VALID [2020-07-10 20:20:54,699 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-10 20:20:54,700 INFO L280 TraceCheckUtils]: 32: Hoare triple {7468#(<= main_~x~0 3)} havoc #t~post2; {7468#(<= main_~x~0 3)} is VALID [2020-07-10 20:20:54,700 INFO L280 TraceCheckUtils]: 33: Hoare triple {7468#(<= main_~x~0 3)} assume !!(~x~0 < 100000); {7468#(<= main_~x~0 3)} is VALID [2020-07-10 20:20:54,701 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-10 20:20:54,702 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-10 20:20:54,702 INFO L280 TraceCheckUtils]: 36: Hoare triple {7468#(<= main_~x~0 3)} havoc #t~nondet3; {7468#(<= main_~x~0 3)} is VALID [2020-07-10 20:20:54,703 INFO L280 TraceCheckUtils]: 37: Hoare triple {7468#(<= main_~x~0 3)} #t~post2 := ~x~0; {7469#(<= |main_#t~post2| 3)} is VALID [2020-07-10 20:20:54,703 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-10 20:20:54,704 INFO L280 TraceCheckUtils]: 39: Hoare triple {7470#(<= main_~x~0 4)} havoc #t~post2; {7470#(<= main_~x~0 4)} is VALID [2020-07-10 20:20:54,705 INFO L280 TraceCheckUtils]: 40: Hoare triple {7470#(<= main_~x~0 4)} assume !(~x~0 < 100000); {7456#false} is VALID [2020-07-10 20:20:54,705 INFO L280 TraceCheckUtils]: 41: Hoare triple {7456#false} ~x~0 := 0; {7456#false} is VALID [2020-07-10 20:20:54,705 INFO L280 TraceCheckUtils]: 42: Hoare triple {7456#false} assume !(~x~0 < ~n~0); {7456#false} is VALID [2020-07-10 20:20:54,705 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-10 20:20:54,706 INFO L280 TraceCheckUtils]: 44: Hoare triple {7456#false} havoc ~v~0; {7456#false} is VALID [2020-07-10 20:20:54,706 INFO L280 TraceCheckUtils]: 45: Hoare triple {7456#false} ~v~0 := 0; {7456#false} is VALID [2020-07-10 20:20:54,706 INFO L280 TraceCheckUtils]: 46: Hoare triple {7456#false} assume !(~v~0 < 100000); {7456#false} is VALID [2020-07-10 20:20:54,706 INFO L280 TraceCheckUtils]: 47: Hoare triple {7456#false} ~v~0 := 0; {7456#false} is VALID [2020-07-10 20:20:54,707 INFO L280 TraceCheckUtils]: 48: Hoare triple {7456#false} assume !!(~v~0 < 100000); {7456#false} is VALID [2020-07-10 20:20:54,707 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-10 20:20:54,707 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-10 20:20:54,707 INFO L280 TraceCheckUtils]: 51: Hoare triple {7455#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {7455#true} is VALID [2020-07-10 20:20:54,707 INFO L280 TraceCheckUtils]: 52: Hoare triple {7455#true} ~size := #in~size; {7455#true} is VALID [2020-07-10 20:20:54,708 INFO L280 TraceCheckUtils]: 53: Hoare triple {7455#true} ~value := #in~value; {7455#true} is VALID [2020-07-10 20:20:54,708 INFO L280 TraceCheckUtils]: 54: Hoare triple {7455#true} havoc ~i~0; {7455#true} is VALID [2020-07-10 20:20:54,708 INFO L280 TraceCheckUtils]: 55: Hoare triple {7455#true} ~i~0 := 0; {7455#true} is VALID [2020-07-10 20:20:54,708 INFO L280 TraceCheckUtils]: 56: Hoare triple {7455#true} assume !(~i~0 < ~size); {7455#true} is VALID [2020-07-10 20:20:54,708 INFO L280 TraceCheckUtils]: 57: Hoare triple {7455#true} #res := 0; {7455#true} is VALID [2020-07-10 20:20:54,709 INFO L280 TraceCheckUtils]: 58: Hoare triple {7455#true} assume true; {7455#true} is VALID [2020-07-10 20:20:54,709 INFO L275 TraceCheckUtils]: 59: Hoare quadruple {7455#true} {7456#false} #253#return; {7456#false} is VALID [2020-07-10 20:20:54,709 INFO L280 TraceCheckUtils]: 60: Hoare triple {7456#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {7456#false} is VALID [2020-07-10 20:20:54,709 INFO L280 TraceCheckUtils]: 61: Hoare triple {7456#false} assume 0 != #t~ret12; {7456#false} is VALID [2020-07-10 20:20:54,709 INFO L280 TraceCheckUtils]: 62: Hoare triple {7456#false} havoc #t~mem11; {7456#false} is VALID [2020-07-10 20:20:54,710 INFO L280 TraceCheckUtils]: 63: Hoare triple {7456#false} havoc #t~ret12; {7456#false} is VALID [2020-07-10 20:20:54,710 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-10 20:20:54,710 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-10 20:20:54,710 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-10 20:20:54,711 INFO L280 TraceCheckUtils]: 67: Hoare triple {7455#true} ~size := #in~size; {7455#true} is VALID [2020-07-10 20:20:54,711 INFO L280 TraceCheckUtils]: 68: Hoare triple {7455#true} ~value := #in~value; {7455#true} is VALID [2020-07-10 20:20:54,711 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-10 20:20:54,711 INFO L280 TraceCheckUtils]: 70: Hoare triple {7455#true} #res := 1 + ~size; {7455#true} is VALID [2020-07-10 20:20:54,711 INFO L280 TraceCheckUtils]: 71: Hoare triple {7455#true} assume true; {7455#true} is VALID [2020-07-10 20:20:54,711 INFO L275 TraceCheckUtils]: 72: Hoare quadruple {7455#true} {7456#false} #255#return; {7456#false} is VALID [2020-07-10 20:20:54,712 INFO L280 TraceCheckUtils]: 73: Hoare triple {7456#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {7456#false} is VALID [2020-07-10 20:20:54,712 INFO L280 TraceCheckUtils]: 74: Hoare triple {7456#false} ~n~0 := #t~ret14; {7456#false} is VALID [2020-07-10 20:20:54,712 INFO L280 TraceCheckUtils]: 75: Hoare triple {7456#false} havoc #t~ret14; {7456#false} is VALID [2020-07-10 20:20:54,712 INFO L280 TraceCheckUtils]: 76: Hoare triple {7456#false} havoc #t~mem13; {7456#false} is VALID [2020-07-10 20:20:54,712 INFO L280 TraceCheckUtils]: 77: Hoare triple {7456#false} ~x~0 := 0; {7456#false} is VALID [2020-07-10 20:20:54,712 INFO L280 TraceCheckUtils]: 78: Hoare triple {7456#false} assume !!(~x~0 < ~n~0); {7456#false} is VALID [2020-07-10 20:20:54,713 INFO L280 TraceCheckUtils]: 79: Hoare triple {7456#false} ~y~0 := 1 + ~x~0; {7456#false} is VALID [2020-07-10 20:20:54,713 INFO L280 TraceCheckUtils]: 80: Hoare triple {7456#false} assume !!(~y~0 < ~n~0); {7456#false} is VALID [2020-07-10 20:20:54,713 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-10 20:20:54,713 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-10 20:20:54,714 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-10 20:20:54,714 INFO L280 TraceCheckUtils]: 84: Hoare triple {7456#false} ~cond := #in~cond; {7456#false} is VALID [2020-07-10 20:20:54,714 INFO L280 TraceCheckUtils]: 85: Hoare triple {7456#false} assume 0 == ~cond; {7456#false} is VALID [2020-07-10 20:20:54,714 INFO L280 TraceCheckUtils]: 86: Hoare triple {7456#false} assume !false; {7456#false} is VALID [2020-07-10 20:20:54,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:20:54,719 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:54,719 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1874363685] [2020-07-10 20:20:54,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:54,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-07-10 20:20:54,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902769864] [2020-07-10 20:20:54,720 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2020-07-10 20:20:54,720 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:54,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 20:20:54,812 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-10 20:20:54,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 20:20:54,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:54,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 20:20:54,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-07-10 20:20:54,814 INFO L87 Difference]: Start difference. First operand 144 states and 156 transitions. Second operand 13 states. [2020-07-10 20:20:57,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:57,108 INFO L93 Difference]: Finished difference Result 305 states and 338 transitions. [2020-07-10 20:20:57,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-07-10 20:20:57,108 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 87 [2020-07-10 20:20:57,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:20:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 20:20:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 310 transitions. [2020-07-10 20:20:57,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 20:20:57,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 310 transitions. [2020-07-10 20:20:57,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 310 transitions. [2020-07-10 20:20:57,489 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-10 20:20:57,494 INFO L225 Difference]: With dead ends: 305 [2020-07-10 20:20:57,494 INFO L226 Difference]: Without dead ends: 202 [2020-07-10 20:20:57,497 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-10 20:20:57,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2020-07-10 20:20:57,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 151. [2020-07-10 20:20:57,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:20:57,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 202 states. Second operand 151 states. [2020-07-10 20:20:57,652 INFO L74 IsIncluded]: Start isIncluded. First operand 202 states. Second operand 151 states. [2020-07-10 20:20:57,653 INFO L87 Difference]: Start difference. First operand 202 states. Second operand 151 states. [2020-07-10 20:20:57,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:57,659 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2020-07-10 20:20:57,659 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 223 transitions. [2020-07-10 20:20:57,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:57,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:57,660 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states. Second operand 202 states. [2020-07-10 20:20:57,660 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 202 states. [2020-07-10 20:20:57,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:20:57,666 INFO L93 Difference]: Finished difference Result 202 states and 223 transitions. [2020-07-10 20:20:57,666 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 223 transitions. [2020-07-10 20:20:57,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:20:57,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:20:57,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:20:57,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:20:57,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-07-10 20:20:57,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 163 transitions. [2020-07-10 20:20:57,671 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 163 transitions. Word has length 87 [2020-07-10 20:20:57,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:20:57,671 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 163 transitions. [2020-07-10 20:20:57,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 20:20:57,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 151 states and 163 transitions. [2020-07-10 20:20:57,864 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-10 20:20:57,865 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 163 transitions. [2020-07-10 20:20:57,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-07-10 20:20:57,866 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:20:57,866 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-10 20:20:57,867 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 20:20:57,867 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:20:57,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:20:57,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1372997778, now seen corresponding path program 3 times [2020-07-10 20:20:57,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:20:57,868 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1104509404] [2020-07-10 20:20:57,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:20:57,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:58,066 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-10 20:20:58,066 INFO L280 TraceCheckUtils]: 1: Hoare triple {8828#true} #valid := #valid[0 := 0]; {8828#true} is VALID [2020-07-10 20:20:58,066 INFO L280 TraceCheckUtils]: 2: Hoare triple {8828#true} assume 0 < #StackHeapBarrier; {8828#true} is VALID [2020-07-10 20:20:58,067 INFO L280 TraceCheckUtils]: 3: Hoare triple {8828#true} assume true; {8828#true} is VALID [2020-07-10 20:20:58,067 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {8828#true} {8828#true} #247#return; {8828#true} is VALID [2020-07-10 20:20:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:58,075 INFO L280 TraceCheckUtils]: 0: Hoare triple {8828#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {8828#true} is VALID [2020-07-10 20:20:58,076 INFO L280 TraceCheckUtils]: 1: Hoare triple {8828#true} ~size := #in~size; {8828#true} is VALID [2020-07-10 20:20:58,076 INFO L280 TraceCheckUtils]: 2: Hoare triple {8828#true} ~value := #in~value; {8828#true} is VALID [2020-07-10 20:20:58,076 INFO L280 TraceCheckUtils]: 3: Hoare triple {8828#true} havoc ~i~0; {8828#true} is VALID [2020-07-10 20:20:58,076 INFO L280 TraceCheckUtils]: 4: Hoare triple {8828#true} ~i~0 := 0; {8828#true} is VALID [2020-07-10 20:20:58,076 INFO L280 TraceCheckUtils]: 5: Hoare triple {8828#true} assume !(~i~0 < ~size); {8828#true} is VALID [2020-07-10 20:20:58,077 INFO L280 TraceCheckUtils]: 6: Hoare triple {8828#true} #res := 0; {8828#true} is VALID [2020-07-10 20:20:58,077 INFO L280 TraceCheckUtils]: 7: Hoare triple {8828#true} assume true; {8828#true} is VALID [2020-07-10 20:20:58,077 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {8828#true} {8829#false} #253#return; {8829#false} is VALID [2020-07-10 20:20:58,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:20:58,106 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-10 20:20:58,107 INFO L280 TraceCheckUtils]: 1: Hoare triple {8828#true} ~size := #in~size; {8828#true} is VALID [2020-07-10 20:20:58,107 INFO L280 TraceCheckUtils]: 2: Hoare triple {8828#true} ~value := #in~value; {8828#true} is VALID [2020-07-10 20:20:58,107 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-10 20:20:58,107 INFO L280 TraceCheckUtils]: 4: Hoare triple {8828#true} #res := 1 + ~size; {8828#true} is VALID [2020-07-10 20:20:58,107 INFO L280 TraceCheckUtils]: 5: Hoare triple {8828#true} assume true; {8828#true} is VALID [2020-07-10 20:20:58,108 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {8828#true} {8829#false} #255#return; {8829#false} is VALID [2020-07-10 20:20:58,109 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-10 20:20:58,109 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-10 20:20:58,109 INFO L280 TraceCheckUtils]: 2: Hoare triple {8828#true} #valid := #valid[0 := 0]; {8828#true} is VALID [2020-07-10 20:20:58,109 INFO L280 TraceCheckUtils]: 3: Hoare triple {8828#true} assume 0 < #StackHeapBarrier; {8828#true} is VALID [2020-07-10 20:20:58,110 INFO L280 TraceCheckUtils]: 4: Hoare triple {8828#true} assume true; {8828#true} is VALID [2020-07-10 20:20:58,110 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {8828#true} {8828#true} #247#return; {8828#true} is VALID [2020-07-10 20:20:58,110 INFO L263 TraceCheckUtils]: 6: Hoare triple {8828#true} call #t~ret23 := main(); {8828#true} is VALID [2020-07-10 20:20:58,110 INFO L280 TraceCheckUtils]: 7: Hoare triple {8828#true} ~n~0 := 0; {8828#true} is VALID [2020-07-10 20:20:58,110 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-10 20:20:58,111 INFO L280 TraceCheckUtils]: 9: Hoare triple {8828#true} havoc ~x~0; {8828#true} is VALID [2020-07-10 20:20:58,111 INFO L280 TraceCheckUtils]: 10: Hoare triple {8828#true} havoc ~y~0; {8828#true} is VALID [2020-07-10 20:20:58,112 INFO L280 TraceCheckUtils]: 11: Hoare triple {8828#true} ~x~0 := 0; {8835#(= 0 main_~x~0)} is VALID [2020-07-10 20:20:58,112 INFO L280 TraceCheckUtils]: 12: Hoare triple {8835#(= 0 main_~x~0)} assume !!(~x~0 < 100000); {8835#(= 0 main_~x~0)} is VALID [2020-07-10 20:20:58,113 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-10 20:20:58,115 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-10 20:20:58,115 INFO L280 TraceCheckUtils]: 15: Hoare triple {8835#(= 0 main_~x~0)} havoc #t~nondet3; {8835#(= 0 main_~x~0)} is VALID [2020-07-10 20:20:58,116 INFO L280 TraceCheckUtils]: 16: Hoare triple {8835#(= 0 main_~x~0)} #t~post2 := ~x~0; {8836#(= |main_#t~post2| 0)} is VALID [2020-07-10 20:20:58,117 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-10 20:20:58,117 INFO L280 TraceCheckUtils]: 18: Hoare triple {8837#(<= main_~x~0 1)} havoc #t~post2; {8837#(<= main_~x~0 1)} is VALID [2020-07-10 20:20:58,118 INFO L280 TraceCheckUtils]: 19: Hoare triple {8837#(<= main_~x~0 1)} assume !!(~x~0 < 100000); {8837#(<= main_~x~0 1)} is VALID [2020-07-10 20:20:58,118 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-10 20:20:58,119 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-10 20:20:58,119 INFO L280 TraceCheckUtils]: 22: Hoare triple {8837#(<= main_~x~0 1)} havoc #t~nondet3; {8837#(<= main_~x~0 1)} is VALID [2020-07-10 20:20:58,120 INFO L280 TraceCheckUtils]: 23: Hoare triple {8837#(<= main_~x~0 1)} #t~post2 := ~x~0; {8838#(<= |main_#t~post2| 1)} is VALID [2020-07-10 20:20:58,122 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-10 20:20:58,123 INFO L280 TraceCheckUtils]: 25: Hoare triple {8839#(<= main_~x~0 2)} havoc #t~post2; {8839#(<= main_~x~0 2)} is VALID [2020-07-10 20:20:58,123 INFO L280 TraceCheckUtils]: 26: Hoare triple {8839#(<= main_~x~0 2)} assume !!(~x~0 < 100000); {8839#(<= main_~x~0 2)} is VALID [2020-07-10 20:20:58,124 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-10 20:20:58,125 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-10 20:20:58,126 INFO L280 TraceCheckUtils]: 29: Hoare triple {8839#(<= main_~x~0 2)} havoc #t~nondet3; {8839#(<= main_~x~0 2)} is VALID [2020-07-10 20:20:58,126 INFO L280 TraceCheckUtils]: 30: Hoare triple {8839#(<= main_~x~0 2)} #t~post2 := ~x~0; {8840#(<= |main_#t~post2| 2)} is VALID [2020-07-10 20:20:58,127 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-10 20:20:58,128 INFO L280 TraceCheckUtils]: 32: Hoare triple {8841#(<= main_~x~0 3)} havoc #t~post2; {8841#(<= main_~x~0 3)} is VALID [2020-07-10 20:20:58,128 INFO L280 TraceCheckUtils]: 33: Hoare triple {8841#(<= main_~x~0 3)} assume !!(~x~0 < 100000); {8841#(<= main_~x~0 3)} is VALID [2020-07-10 20:20:58,129 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-10 20:20:58,129 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-10 20:20:58,130 INFO L280 TraceCheckUtils]: 36: Hoare triple {8841#(<= main_~x~0 3)} havoc #t~nondet3; {8841#(<= main_~x~0 3)} is VALID [2020-07-10 20:20:58,130 INFO L280 TraceCheckUtils]: 37: Hoare triple {8841#(<= main_~x~0 3)} #t~post2 := ~x~0; {8842#(<= |main_#t~post2| 3)} is VALID [2020-07-10 20:20:58,131 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-10 20:20:58,132 INFO L280 TraceCheckUtils]: 39: Hoare triple {8843#(<= main_~x~0 4)} havoc #t~post2; {8843#(<= main_~x~0 4)} is VALID [2020-07-10 20:20:58,132 INFO L280 TraceCheckUtils]: 40: Hoare triple {8843#(<= main_~x~0 4)} assume !!(~x~0 < 100000); {8843#(<= main_~x~0 4)} is VALID [2020-07-10 20:20:58,133 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-10 20:20:58,133 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-10 20:20:58,134 INFO L280 TraceCheckUtils]: 43: Hoare triple {8843#(<= main_~x~0 4)} havoc #t~nondet3; {8843#(<= main_~x~0 4)} is VALID [2020-07-10 20:20:58,134 INFO L280 TraceCheckUtils]: 44: Hoare triple {8843#(<= main_~x~0 4)} #t~post2 := ~x~0; {8844#(<= |main_#t~post2| 4)} is VALID [2020-07-10 20:20:58,135 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-10 20:20:58,136 INFO L280 TraceCheckUtils]: 46: Hoare triple {8845#(<= main_~x~0 5)} havoc #t~post2; {8845#(<= main_~x~0 5)} is VALID [2020-07-10 20:20:58,136 INFO L280 TraceCheckUtils]: 47: Hoare triple {8845#(<= main_~x~0 5)} assume !(~x~0 < 100000); {8829#false} is VALID [2020-07-10 20:20:58,136 INFO L280 TraceCheckUtils]: 48: Hoare triple {8829#false} ~x~0 := 0; {8829#false} is VALID [2020-07-10 20:20:58,137 INFO L280 TraceCheckUtils]: 49: Hoare triple {8829#false} assume !(~x~0 < ~n~0); {8829#false} is VALID [2020-07-10 20:20:58,137 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-10 20:20:58,137 INFO L280 TraceCheckUtils]: 51: Hoare triple {8829#false} havoc ~v~0; {8829#false} is VALID [2020-07-10 20:20:58,137 INFO L280 TraceCheckUtils]: 52: Hoare triple {8829#false} ~v~0 := 0; {8829#false} is VALID [2020-07-10 20:20:58,137 INFO L280 TraceCheckUtils]: 53: Hoare triple {8829#false} assume !(~v~0 < 100000); {8829#false} is VALID [2020-07-10 20:20:58,138 INFO L280 TraceCheckUtils]: 54: Hoare triple {8829#false} ~v~0 := 0; {8829#false} is VALID [2020-07-10 20:20:58,138 INFO L280 TraceCheckUtils]: 55: Hoare triple {8829#false} assume !!(~v~0 < 100000); {8829#false} is VALID [2020-07-10 20:20:58,138 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-10 20:20:58,138 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-10 20:20:58,138 INFO L280 TraceCheckUtils]: 58: Hoare triple {8828#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {8828#true} is VALID [2020-07-10 20:20:58,139 INFO L280 TraceCheckUtils]: 59: Hoare triple {8828#true} ~size := #in~size; {8828#true} is VALID [2020-07-10 20:20:58,139 INFO L280 TraceCheckUtils]: 60: Hoare triple {8828#true} ~value := #in~value; {8828#true} is VALID [2020-07-10 20:20:58,139 INFO L280 TraceCheckUtils]: 61: Hoare triple {8828#true} havoc ~i~0; {8828#true} is VALID [2020-07-10 20:20:58,139 INFO L280 TraceCheckUtils]: 62: Hoare triple {8828#true} ~i~0 := 0; {8828#true} is VALID [2020-07-10 20:20:58,139 INFO L280 TraceCheckUtils]: 63: Hoare triple {8828#true} assume !(~i~0 < ~size); {8828#true} is VALID [2020-07-10 20:20:58,140 INFO L280 TraceCheckUtils]: 64: Hoare triple {8828#true} #res := 0; {8828#true} is VALID [2020-07-10 20:20:58,140 INFO L280 TraceCheckUtils]: 65: Hoare triple {8828#true} assume true; {8828#true} is VALID [2020-07-10 20:20:58,140 INFO L275 TraceCheckUtils]: 66: Hoare quadruple {8828#true} {8829#false} #253#return; {8829#false} is VALID [2020-07-10 20:20:58,140 INFO L280 TraceCheckUtils]: 67: Hoare triple {8829#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {8829#false} is VALID [2020-07-10 20:20:58,140 INFO L280 TraceCheckUtils]: 68: Hoare triple {8829#false} assume 0 != #t~ret12; {8829#false} is VALID [2020-07-10 20:20:58,141 INFO L280 TraceCheckUtils]: 69: Hoare triple {8829#false} havoc #t~mem11; {8829#false} is VALID [2020-07-10 20:20:58,141 INFO L280 TraceCheckUtils]: 70: Hoare triple {8829#false} havoc #t~ret12; {8829#false} is VALID [2020-07-10 20:20:58,141 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-10 20:20:58,141 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-10 20:20:58,142 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-10 20:20:58,142 INFO L280 TraceCheckUtils]: 74: Hoare triple {8828#true} ~size := #in~size; {8828#true} is VALID [2020-07-10 20:20:58,142 INFO L280 TraceCheckUtils]: 75: Hoare triple {8828#true} ~value := #in~value; {8828#true} is VALID [2020-07-10 20:20:58,142 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-10 20:20:58,142 INFO L280 TraceCheckUtils]: 77: Hoare triple {8828#true} #res := 1 + ~size; {8828#true} is VALID [2020-07-10 20:20:58,143 INFO L280 TraceCheckUtils]: 78: Hoare triple {8828#true} assume true; {8828#true} is VALID [2020-07-10 20:20:58,143 INFO L275 TraceCheckUtils]: 79: Hoare quadruple {8828#true} {8829#false} #255#return; {8829#false} is VALID [2020-07-10 20:20:58,143 INFO L280 TraceCheckUtils]: 80: Hoare triple {8829#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {8829#false} is VALID [2020-07-10 20:20:58,143 INFO L280 TraceCheckUtils]: 81: Hoare triple {8829#false} ~n~0 := #t~ret14; {8829#false} is VALID [2020-07-10 20:20:58,144 INFO L280 TraceCheckUtils]: 82: Hoare triple {8829#false} havoc #t~ret14; {8829#false} is VALID [2020-07-10 20:20:58,144 INFO L280 TraceCheckUtils]: 83: Hoare triple {8829#false} havoc #t~mem13; {8829#false} is VALID [2020-07-10 20:20:58,144 INFO L280 TraceCheckUtils]: 84: Hoare triple {8829#false} ~x~0 := 0; {8829#false} is VALID [2020-07-10 20:20:58,144 INFO L280 TraceCheckUtils]: 85: Hoare triple {8829#false} assume !!(~x~0 < ~n~0); {8829#false} is VALID [2020-07-10 20:20:58,144 INFO L280 TraceCheckUtils]: 86: Hoare triple {8829#false} ~y~0 := 1 + ~x~0; {8829#false} is VALID [2020-07-10 20:20:58,145 INFO L280 TraceCheckUtils]: 87: Hoare triple {8829#false} assume !!(~y~0 < ~n~0); {8829#false} is VALID [2020-07-10 20:20:58,145 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-10 20:20:58,145 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-10 20:20:58,145 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-10 20:20:58,145 INFO L280 TraceCheckUtils]: 91: Hoare triple {8829#false} ~cond := #in~cond; {8829#false} is VALID [2020-07-10 20:20:58,146 INFO L280 TraceCheckUtils]: 92: Hoare triple {8829#false} assume 0 == ~cond; {8829#false} is VALID [2020-07-10 20:20:58,146 INFO L280 TraceCheckUtils]: 93: Hoare triple {8829#false} assume !false; {8829#false} is VALID [2020-07-10 20:20:58,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:20:58,152 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:20:58,153 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1104509404] [2020-07-10 20:20:58,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:20:58,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-10 20:20:58,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717847518] [2020-07-10 20:20:58,154 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 94 [2020-07-10 20:20:58,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:20:58,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 20:20:58,237 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-10 20:20:58,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 20:20:58,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:20:58,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 20:20:58,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-07-10 20:20:58,239 INFO L87 Difference]: Start difference. First operand 151 states and 163 transitions. Second operand 15 states. [2020-07-10 20:21:00,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:00,849 INFO L93 Difference]: Finished difference Result 312 states and 345 transitions. [2020-07-10 20:21:00,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-10 20:21:00,849 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 94 [2020-07-10 20:21:00,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:00,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 20:21:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 317 transitions. [2020-07-10 20:21:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 20:21:00,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 317 transitions. [2020-07-10 20:21:00,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 317 transitions. [2020-07-10 20:21:01,283 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-10 20:21:01,291 INFO L225 Difference]: With dead ends: 312 [2020-07-10 20:21:01,291 INFO L226 Difference]: Without dead ends: 209 [2020-07-10 20:21:01,293 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2020-07-10 20:21:01,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-07-10 20:21:01,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 158. [2020-07-10 20:21:01,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:01,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand 158 states. [2020-07-10 20:21:01,501 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand 158 states. [2020-07-10 20:21:01,501 INFO L87 Difference]: Start difference. First operand 209 states. Second operand 158 states. [2020-07-10 20:21:01,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:01,514 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2020-07-10 20:21:01,515 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 230 transitions. [2020-07-10 20:21:01,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:01,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:01,520 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand 209 states. [2020-07-10 20:21:01,521 INFO L87 Difference]: Start difference. First operand 158 states. Second operand 209 states. [2020-07-10 20:21:01,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:01,531 INFO L93 Difference]: Finished difference Result 209 states and 230 transitions. [2020-07-10 20:21:01,531 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 230 transitions. [2020-07-10 20:21:01,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:01,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:01,534 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:01,534 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:01,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2020-07-10 20:21:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 170 transitions. [2020-07-10 20:21:01,541 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 170 transitions. Word has length 94 [2020-07-10 20:21:01,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:01,541 INFO L479 AbstractCegarLoop]: Abstraction has 158 states and 170 transitions. [2020-07-10 20:21:01,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 20:21:01,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 158 states and 170 transitions. [2020-07-10 20:21:01,757 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-10 20:21:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 170 transitions. [2020-07-10 20:21:01,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2020-07-10 20:21:01,759 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:01,759 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-10 20:21:01,759 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 20:21:01,759 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:01,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:01,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1331129217, now seen corresponding path program 4 times [2020-07-10 20:21:01,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:01,760 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [261898321] [2020-07-10 20:21:01,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:01,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:02,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:02,007 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-10 20:21:02,007 INFO L280 TraceCheckUtils]: 1: Hoare triple {10249#true} #valid := #valid[0 := 0]; {10249#true} is VALID [2020-07-10 20:21:02,008 INFO L280 TraceCheckUtils]: 2: Hoare triple {10249#true} assume 0 < #StackHeapBarrier; {10249#true} is VALID [2020-07-10 20:21:02,008 INFO L280 TraceCheckUtils]: 3: Hoare triple {10249#true} assume true; {10249#true} is VALID [2020-07-10 20:21:02,008 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {10249#true} {10249#true} #247#return; {10249#true} is VALID [2020-07-10 20:21:02,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:02,014 INFO L280 TraceCheckUtils]: 0: Hoare triple {10249#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {10249#true} is VALID [2020-07-10 20:21:02,014 INFO L280 TraceCheckUtils]: 1: Hoare triple {10249#true} ~size := #in~size; {10249#true} is VALID [2020-07-10 20:21:02,015 INFO L280 TraceCheckUtils]: 2: Hoare triple {10249#true} ~value := #in~value; {10249#true} is VALID [2020-07-10 20:21:02,015 INFO L280 TraceCheckUtils]: 3: Hoare triple {10249#true} havoc ~i~0; {10249#true} is VALID [2020-07-10 20:21:02,015 INFO L280 TraceCheckUtils]: 4: Hoare triple {10249#true} ~i~0 := 0; {10249#true} is VALID [2020-07-10 20:21:02,015 INFO L280 TraceCheckUtils]: 5: Hoare triple {10249#true} assume !(~i~0 < ~size); {10249#true} is VALID [2020-07-10 20:21:02,016 INFO L280 TraceCheckUtils]: 6: Hoare triple {10249#true} #res := 0; {10249#true} is VALID [2020-07-10 20:21:02,016 INFO L280 TraceCheckUtils]: 7: Hoare triple {10249#true} assume true; {10249#true} is VALID [2020-07-10 20:21:02,016 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {10249#true} {10250#false} #253#return; {10250#false} is VALID [2020-07-10 20:21:02,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:02,034 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-10 20:21:02,034 INFO L280 TraceCheckUtils]: 1: Hoare triple {10249#true} ~size := #in~size; {10249#true} is VALID [2020-07-10 20:21:02,034 INFO L280 TraceCheckUtils]: 2: Hoare triple {10249#true} ~value := #in~value; {10249#true} is VALID [2020-07-10 20:21:02,035 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-10 20:21:02,035 INFO L280 TraceCheckUtils]: 4: Hoare triple {10249#true} #res := 1 + ~size; {10249#true} is VALID [2020-07-10 20:21:02,035 INFO L280 TraceCheckUtils]: 5: Hoare triple {10249#true} assume true; {10249#true} is VALID [2020-07-10 20:21:02,035 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {10249#true} {10250#false} #255#return; {10250#false} is VALID [2020-07-10 20:21:02,037 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-10 20:21:02,037 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-10 20:21:02,037 INFO L280 TraceCheckUtils]: 2: Hoare triple {10249#true} #valid := #valid[0 := 0]; {10249#true} is VALID [2020-07-10 20:21:02,037 INFO L280 TraceCheckUtils]: 3: Hoare triple {10249#true} assume 0 < #StackHeapBarrier; {10249#true} is VALID [2020-07-10 20:21:02,038 INFO L280 TraceCheckUtils]: 4: Hoare triple {10249#true} assume true; {10249#true} is VALID [2020-07-10 20:21:02,038 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {10249#true} {10249#true} #247#return; {10249#true} is VALID [2020-07-10 20:21:02,038 INFO L263 TraceCheckUtils]: 6: Hoare triple {10249#true} call #t~ret23 := main(); {10249#true} is VALID [2020-07-10 20:21:02,038 INFO L280 TraceCheckUtils]: 7: Hoare triple {10249#true} ~n~0 := 0; {10249#true} is VALID [2020-07-10 20:21:02,039 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-10 20:21:02,039 INFO L280 TraceCheckUtils]: 9: Hoare triple {10249#true} havoc ~x~0; {10249#true} is VALID [2020-07-10 20:21:02,039 INFO L280 TraceCheckUtils]: 10: Hoare triple {10249#true} havoc ~y~0; {10249#true} is VALID [2020-07-10 20:21:02,040 INFO L280 TraceCheckUtils]: 11: Hoare triple {10249#true} ~x~0 := 0; {10256#(= 0 main_~x~0)} is VALID [2020-07-10 20:21:02,041 INFO L280 TraceCheckUtils]: 12: Hoare triple {10256#(= 0 main_~x~0)} assume !!(~x~0 < 100000); {10256#(= 0 main_~x~0)} is VALID [2020-07-10 20:21:02,041 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-10 20:21:02,042 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-10 20:21:02,043 INFO L280 TraceCheckUtils]: 15: Hoare triple {10256#(= 0 main_~x~0)} havoc #t~nondet3; {10256#(= 0 main_~x~0)} is VALID [2020-07-10 20:21:02,044 INFO L280 TraceCheckUtils]: 16: Hoare triple {10256#(= 0 main_~x~0)} #t~post2 := ~x~0; {10257#(= |main_#t~post2| 0)} is VALID [2020-07-10 20:21:02,044 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-10 20:21:02,045 INFO L280 TraceCheckUtils]: 18: Hoare triple {10258#(<= main_~x~0 1)} havoc #t~post2; {10258#(<= main_~x~0 1)} is VALID [2020-07-10 20:21:02,047 INFO L280 TraceCheckUtils]: 19: Hoare triple {10258#(<= main_~x~0 1)} assume !!(~x~0 < 100000); {10258#(<= main_~x~0 1)} is VALID [2020-07-10 20:21:02,047 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-10 20:21:02,049 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-10 20:21:02,049 INFO L280 TraceCheckUtils]: 22: Hoare triple {10258#(<= main_~x~0 1)} havoc #t~nondet3; {10258#(<= main_~x~0 1)} is VALID [2020-07-10 20:21:02,050 INFO L280 TraceCheckUtils]: 23: Hoare triple {10258#(<= main_~x~0 1)} #t~post2 := ~x~0; {10259#(<= |main_#t~post2| 1)} is VALID [2020-07-10 20:21:02,051 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-10 20:21:02,052 INFO L280 TraceCheckUtils]: 25: Hoare triple {10260#(<= main_~x~0 2)} havoc #t~post2; {10260#(<= main_~x~0 2)} is VALID [2020-07-10 20:21:02,052 INFO L280 TraceCheckUtils]: 26: Hoare triple {10260#(<= main_~x~0 2)} assume !!(~x~0 < 100000); {10260#(<= main_~x~0 2)} is VALID [2020-07-10 20:21:02,053 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-10 20:21:02,054 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-10 20:21:02,054 INFO L280 TraceCheckUtils]: 29: Hoare triple {10260#(<= main_~x~0 2)} havoc #t~nondet3; {10260#(<= main_~x~0 2)} is VALID [2020-07-10 20:21:02,055 INFO L280 TraceCheckUtils]: 30: Hoare triple {10260#(<= main_~x~0 2)} #t~post2 := ~x~0; {10261#(<= |main_#t~post2| 2)} is VALID [2020-07-10 20:21:02,056 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-10 20:21:02,057 INFO L280 TraceCheckUtils]: 32: Hoare triple {10262#(<= main_~x~0 3)} havoc #t~post2; {10262#(<= main_~x~0 3)} is VALID [2020-07-10 20:21:02,057 INFO L280 TraceCheckUtils]: 33: Hoare triple {10262#(<= main_~x~0 3)} assume !!(~x~0 < 100000); {10262#(<= main_~x~0 3)} is VALID [2020-07-10 20:21:02,058 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-10 20:21:02,059 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-10 20:21:02,059 INFO L280 TraceCheckUtils]: 36: Hoare triple {10262#(<= main_~x~0 3)} havoc #t~nondet3; {10262#(<= main_~x~0 3)} is VALID [2020-07-10 20:21:02,060 INFO L280 TraceCheckUtils]: 37: Hoare triple {10262#(<= main_~x~0 3)} #t~post2 := ~x~0; {10263#(<= |main_#t~post2| 3)} is VALID [2020-07-10 20:21:02,061 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-10 20:21:02,062 INFO L280 TraceCheckUtils]: 39: Hoare triple {10264#(<= main_~x~0 4)} havoc #t~post2; {10264#(<= main_~x~0 4)} is VALID [2020-07-10 20:21:02,063 INFO L280 TraceCheckUtils]: 40: Hoare triple {10264#(<= main_~x~0 4)} assume !!(~x~0 < 100000); {10264#(<= main_~x~0 4)} is VALID [2020-07-10 20:21:02,063 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-10 20:21:02,064 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-10 20:21:02,065 INFO L280 TraceCheckUtils]: 43: Hoare triple {10264#(<= main_~x~0 4)} havoc #t~nondet3; {10264#(<= main_~x~0 4)} is VALID [2020-07-10 20:21:02,065 INFO L280 TraceCheckUtils]: 44: Hoare triple {10264#(<= main_~x~0 4)} #t~post2 := ~x~0; {10265#(<= |main_#t~post2| 4)} is VALID [2020-07-10 20:21:02,066 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-10 20:21:02,067 INFO L280 TraceCheckUtils]: 46: Hoare triple {10266#(<= main_~x~0 5)} havoc #t~post2; {10266#(<= main_~x~0 5)} is VALID [2020-07-10 20:21:02,068 INFO L280 TraceCheckUtils]: 47: Hoare triple {10266#(<= main_~x~0 5)} assume !!(~x~0 < 100000); {10266#(<= main_~x~0 5)} is VALID [2020-07-10 20:21:02,068 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-10 20:21:02,069 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-10 20:21:02,069 INFO L280 TraceCheckUtils]: 50: Hoare triple {10266#(<= main_~x~0 5)} havoc #t~nondet3; {10266#(<= main_~x~0 5)} is VALID [2020-07-10 20:21:02,070 INFO L280 TraceCheckUtils]: 51: Hoare triple {10266#(<= main_~x~0 5)} #t~post2 := ~x~0; {10267#(<= |main_#t~post2| 5)} is VALID [2020-07-10 20:21:02,071 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-10 20:21:02,072 INFO L280 TraceCheckUtils]: 53: Hoare triple {10268#(<= main_~x~0 6)} havoc #t~post2; {10268#(<= main_~x~0 6)} is VALID [2020-07-10 20:21:02,073 INFO L280 TraceCheckUtils]: 54: Hoare triple {10268#(<= main_~x~0 6)} assume !(~x~0 < 100000); {10250#false} is VALID [2020-07-10 20:21:02,073 INFO L280 TraceCheckUtils]: 55: Hoare triple {10250#false} ~x~0 := 0; {10250#false} is VALID [2020-07-10 20:21:02,073 INFO L280 TraceCheckUtils]: 56: Hoare triple {10250#false} assume !(~x~0 < ~n~0); {10250#false} is VALID [2020-07-10 20:21:02,073 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-10 20:21:02,074 INFO L280 TraceCheckUtils]: 58: Hoare triple {10250#false} havoc ~v~0; {10250#false} is VALID [2020-07-10 20:21:02,074 INFO L280 TraceCheckUtils]: 59: Hoare triple {10250#false} ~v~0 := 0; {10250#false} is VALID [2020-07-10 20:21:02,074 INFO L280 TraceCheckUtils]: 60: Hoare triple {10250#false} assume !(~v~0 < 100000); {10250#false} is VALID [2020-07-10 20:21:02,075 INFO L280 TraceCheckUtils]: 61: Hoare triple {10250#false} ~v~0 := 0; {10250#false} is VALID [2020-07-10 20:21:02,075 INFO L280 TraceCheckUtils]: 62: Hoare triple {10250#false} assume !!(~v~0 < 100000); {10250#false} is VALID [2020-07-10 20:21:02,075 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-10 20:21:02,075 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-10 20:21:02,076 INFO L280 TraceCheckUtils]: 65: Hoare triple {10249#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {10249#true} is VALID [2020-07-10 20:21:02,076 INFO L280 TraceCheckUtils]: 66: Hoare triple {10249#true} ~size := #in~size; {10249#true} is VALID [2020-07-10 20:21:02,076 INFO L280 TraceCheckUtils]: 67: Hoare triple {10249#true} ~value := #in~value; {10249#true} is VALID [2020-07-10 20:21:02,076 INFO L280 TraceCheckUtils]: 68: Hoare triple {10249#true} havoc ~i~0; {10249#true} is VALID [2020-07-10 20:21:02,076 INFO L280 TraceCheckUtils]: 69: Hoare triple {10249#true} ~i~0 := 0; {10249#true} is VALID [2020-07-10 20:21:02,077 INFO L280 TraceCheckUtils]: 70: Hoare triple {10249#true} assume !(~i~0 < ~size); {10249#true} is VALID [2020-07-10 20:21:02,077 INFO L280 TraceCheckUtils]: 71: Hoare triple {10249#true} #res := 0; {10249#true} is VALID [2020-07-10 20:21:02,077 INFO L280 TraceCheckUtils]: 72: Hoare triple {10249#true} assume true; {10249#true} is VALID [2020-07-10 20:21:02,077 INFO L275 TraceCheckUtils]: 73: Hoare quadruple {10249#true} {10250#false} #253#return; {10250#false} is VALID [2020-07-10 20:21:02,078 INFO L280 TraceCheckUtils]: 74: Hoare triple {10250#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {10250#false} is VALID [2020-07-10 20:21:02,078 INFO L280 TraceCheckUtils]: 75: Hoare triple {10250#false} assume 0 != #t~ret12; {10250#false} is VALID [2020-07-10 20:21:02,078 INFO L280 TraceCheckUtils]: 76: Hoare triple {10250#false} havoc #t~mem11; {10250#false} is VALID [2020-07-10 20:21:02,078 INFO L280 TraceCheckUtils]: 77: Hoare triple {10250#false} havoc #t~ret12; {10250#false} is VALID [2020-07-10 20:21:02,079 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-10 20:21:02,079 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-10 20:21:02,079 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-10 20:21:02,079 INFO L280 TraceCheckUtils]: 81: Hoare triple {10249#true} ~size := #in~size; {10249#true} is VALID [2020-07-10 20:21:02,079 INFO L280 TraceCheckUtils]: 82: Hoare triple {10249#true} ~value := #in~value; {10249#true} is VALID [2020-07-10 20:21:02,080 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-10 20:21:02,080 INFO L280 TraceCheckUtils]: 84: Hoare triple {10249#true} #res := 1 + ~size; {10249#true} is VALID [2020-07-10 20:21:02,080 INFO L280 TraceCheckUtils]: 85: Hoare triple {10249#true} assume true; {10249#true} is VALID [2020-07-10 20:21:02,080 INFO L275 TraceCheckUtils]: 86: Hoare quadruple {10249#true} {10250#false} #255#return; {10250#false} is VALID [2020-07-10 20:21:02,080 INFO L280 TraceCheckUtils]: 87: Hoare triple {10250#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {10250#false} is VALID [2020-07-10 20:21:02,081 INFO L280 TraceCheckUtils]: 88: Hoare triple {10250#false} ~n~0 := #t~ret14; {10250#false} is VALID [2020-07-10 20:21:02,081 INFO L280 TraceCheckUtils]: 89: Hoare triple {10250#false} havoc #t~ret14; {10250#false} is VALID [2020-07-10 20:21:02,081 INFO L280 TraceCheckUtils]: 90: Hoare triple {10250#false} havoc #t~mem13; {10250#false} is VALID [2020-07-10 20:21:02,081 INFO L280 TraceCheckUtils]: 91: Hoare triple {10250#false} ~x~0 := 0; {10250#false} is VALID [2020-07-10 20:21:02,082 INFO L280 TraceCheckUtils]: 92: Hoare triple {10250#false} assume !!(~x~0 < ~n~0); {10250#false} is VALID [2020-07-10 20:21:02,082 INFO L280 TraceCheckUtils]: 93: Hoare triple {10250#false} ~y~0 := 1 + ~x~0; {10250#false} is VALID [2020-07-10 20:21:02,082 INFO L280 TraceCheckUtils]: 94: Hoare triple {10250#false} assume !!(~y~0 < ~n~0); {10250#false} is VALID [2020-07-10 20:21:02,082 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-10 20:21:02,082 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-10 20:21:02,083 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-10 20:21:02,083 INFO L280 TraceCheckUtils]: 98: Hoare triple {10250#false} ~cond := #in~cond; {10250#false} is VALID [2020-07-10 20:21:02,083 INFO L280 TraceCheckUtils]: 99: Hoare triple {10250#false} assume 0 == ~cond; {10250#false} is VALID [2020-07-10 20:21:02,083 INFO L280 TraceCheckUtils]: 100: Hoare triple {10250#false} assume !false; {10250#false} is VALID [2020-07-10 20:21:02,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:21:02,103 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:02,103 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [261898321] [2020-07-10 20:21:02,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:02,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2020-07-10 20:21:02,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705351286] [2020-07-10 20:21:02,105 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 101 [2020-07-10 20:21:02,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:02,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2020-07-10 20:21:02,205 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-10 20:21:02,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2020-07-10 20:21:02,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:02,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2020-07-10 20:21:02,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2020-07-10 20:21:02,206 INFO L87 Difference]: Start difference. First operand 158 states and 170 transitions. Second operand 17 states. [2020-07-10 20:21:05,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:05,054 INFO L93 Difference]: Finished difference Result 319 states and 352 transitions. [2020-07-10 20:21:05,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2020-07-10 20:21:05,054 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 101 [2020-07-10 20:21:05,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:05,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 20:21:05,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 324 transitions. [2020-07-10 20:21:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-10 20:21:05,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 324 transitions. [2020-07-10 20:21:05,068 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 25 states and 324 transitions. [2020-07-10 20:21:05,428 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-10 20:21:05,436 INFO L225 Difference]: With dead ends: 319 [2020-07-10 20:21:05,436 INFO L226 Difference]: Without dead ends: 216 [2020-07-10 20:21:05,438 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-10 20:21:05,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2020-07-10 20:21:05,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 165. [2020-07-10 20:21:05,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:05,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 216 states. Second operand 165 states. [2020-07-10 20:21:05,650 INFO L74 IsIncluded]: Start isIncluded. First operand 216 states. Second operand 165 states. [2020-07-10 20:21:05,650 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 165 states. [2020-07-10 20:21:05,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:05,657 INFO L93 Difference]: Finished difference Result 216 states and 237 transitions. [2020-07-10 20:21:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 237 transitions. [2020-07-10 20:21:05,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:05,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:05,658 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand 216 states. [2020-07-10 20:21:05,659 INFO L87 Difference]: Start difference. First operand 165 states. Second operand 216 states. [2020-07-10 20:21:05,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:05,664 INFO L93 Difference]: Finished difference Result 216 states and 237 transitions. [2020-07-10 20:21:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 237 transitions. [2020-07-10 20:21:05,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:05,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:05,666 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:05,666 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:05,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2020-07-10 20:21:05,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 177 transitions. [2020-07-10 20:21:05,671 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 177 transitions. Word has length 101 [2020-07-10 20:21:05,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:05,671 INFO L479 AbstractCegarLoop]: Abstraction has 165 states and 177 transitions. [2020-07-10 20:21:05,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 17 states. [2020-07-10 20:21:05,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 165 states and 177 transitions. [2020-07-10 20:21:05,877 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-10 20:21:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 177 transitions. [2020-07-10 20:21:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2020-07-10 20:21:05,878 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:05,879 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-10 20:21:05,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 20:21:05,879 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:05,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:05,879 INFO L82 PathProgramCache]: Analyzing trace with hash -837086642, now seen corresponding path program 5 times [2020-07-10 20:21:05,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:05,880 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1454060396] [2020-07-10 20:21:05,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:05,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:05,985 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-10 20:21:05,985 INFO L280 TraceCheckUtils]: 1: Hoare triple {11718#true} #valid := #valid[0 := 0]; {11718#true} is VALID [2020-07-10 20:21:05,985 INFO L280 TraceCheckUtils]: 2: Hoare triple {11718#true} assume 0 < #StackHeapBarrier; {11718#true} is VALID [2020-07-10 20:21:05,986 INFO L280 TraceCheckUtils]: 3: Hoare triple {11718#true} assume true; {11718#true} is VALID [2020-07-10 20:21:05,986 INFO L275 TraceCheckUtils]: 4: Hoare quadruple {11718#true} {11718#true} #247#return; {11718#true} is VALID [2020-07-10 20:21:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:06,001 INFO L280 TraceCheckUtils]: 0: Hoare triple {11718#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {11718#true} is VALID [2020-07-10 20:21:06,002 INFO L280 TraceCheckUtils]: 1: Hoare triple {11718#true} ~size := #in~size; {11718#true} is VALID [2020-07-10 20:21:06,002 INFO L280 TraceCheckUtils]: 2: Hoare triple {11718#true} ~value := #in~value; {11718#true} is VALID [2020-07-10 20:21:06,002 INFO L280 TraceCheckUtils]: 3: Hoare triple {11718#true} havoc ~i~0; {11718#true} is VALID [2020-07-10 20:21:06,002 INFO L280 TraceCheckUtils]: 4: Hoare triple {11718#true} ~i~0 := 0; {11718#true} is VALID [2020-07-10 20:21:06,002 INFO L280 TraceCheckUtils]: 5: Hoare triple {11718#true} assume !(~i~0 < ~size); {11718#true} is VALID [2020-07-10 20:21:06,003 INFO L280 TraceCheckUtils]: 6: Hoare triple {11718#true} #res := 0; {11718#true} is VALID [2020-07-10 20:21:06,003 INFO L280 TraceCheckUtils]: 7: Hoare triple {11718#true} assume true; {11718#true} is VALID [2020-07-10 20:21:06,003 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {11718#true} {11719#false} #253#return; {11719#false} is VALID [2020-07-10 20:21:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:21:06,030 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-10 20:21:06,031 INFO L280 TraceCheckUtils]: 1: Hoare triple {11718#true} ~size := #in~size; {11718#true} is VALID [2020-07-10 20:21:06,031 INFO L280 TraceCheckUtils]: 2: Hoare triple {11718#true} ~value := #in~value; {11718#true} is VALID [2020-07-10 20:21:06,031 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-10 20:21:06,031 INFO L280 TraceCheckUtils]: 4: Hoare triple {11718#true} #res := 1 + ~size; {11718#true} is VALID [2020-07-10 20:21:06,032 INFO L280 TraceCheckUtils]: 5: Hoare triple {11718#true} assume true; {11718#true} is VALID [2020-07-10 20:21:06,032 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {11718#true} {11719#false} #255#return; {11719#false} is VALID [2020-07-10 20:21:06,033 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-10 20:21:06,033 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-10 20:21:06,034 INFO L280 TraceCheckUtils]: 2: Hoare triple {11718#true} #valid := #valid[0 := 0]; {11718#true} is VALID [2020-07-10 20:21:06,034 INFO L280 TraceCheckUtils]: 3: Hoare triple {11718#true} assume 0 < #StackHeapBarrier; {11718#true} is VALID [2020-07-10 20:21:06,034 INFO L280 TraceCheckUtils]: 4: Hoare triple {11718#true} assume true; {11718#true} is VALID [2020-07-10 20:21:06,034 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {11718#true} {11718#true} #247#return; {11718#true} is VALID [2020-07-10 20:21:06,034 INFO L263 TraceCheckUtils]: 6: Hoare triple {11718#true} call #t~ret23 := main(); {11718#true} is VALID [2020-07-10 20:21:06,035 INFO L280 TraceCheckUtils]: 7: Hoare triple {11718#true} ~n~0 := 0; {11718#true} is VALID [2020-07-10 20:21:06,035 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-10 20:21:06,035 INFO L280 TraceCheckUtils]: 9: Hoare triple {11718#true} havoc ~x~0; {11718#true} is VALID [2020-07-10 20:21:06,035 INFO L280 TraceCheckUtils]: 10: Hoare triple {11718#true} havoc ~y~0; {11718#true} is VALID [2020-07-10 20:21:06,035 INFO L280 TraceCheckUtils]: 11: Hoare triple {11718#true} ~x~0 := 0; {11718#true} is VALID [2020-07-10 20:21:06,036 INFO L280 TraceCheckUtils]: 12: Hoare triple {11718#true} assume !!(~x~0 < 100000); {11718#true} is VALID [2020-07-10 20:21:06,036 INFO L280 TraceCheckUtils]: 13: Hoare triple {11718#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {11718#true} is VALID [2020-07-10 20:21:06,036 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-10 20:21:06,036 INFO L280 TraceCheckUtils]: 15: Hoare triple {11718#true} havoc #t~nondet3; {11718#true} is VALID [2020-07-10 20:21:06,036 INFO L280 TraceCheckUtils]: 16: Hoare triple {11718#true} #t~post2 := ~x~0; {11718#true} is VALID [2020-07-10 20:21:06,036 INFO L280 TraceCheckUtils]: 17: Hoare triple {11718#true} ~x~0 := 1 + #t~post2; {11718#true} is VALID [2020-07-10 20:21:06,037 INFO L280 TraceCheckUtils]: 18: Hoare triple {11718#true} havoc #t~post2; {11718#true} is VALID [2020-07-10 20:21:06,037 INFO L280 TraceCheckUtils]: 19: Hoare triple {11718#true} assume !!(~x~0 < 100000); {11718#true} is VALID [2020-07-10 20:21:06,037 INFO L280 TraceCheckUtils]: 20: Hoare triple {11718#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {11718#true} is VALID [2020-07-10 20:21:06,037 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-10 20:21:06,037 INFO L280 TraceCheckUtils]: 22: Hoare triple {11718#true} havoc #t~nondet3; {11718#true} is VALID [2020-07-10 20:21:06,038 INFO L280 TraceCheckUtils]: 23: Hoare triple {11718#true} #t~post2 := ~x~0; {11718#true} is VALID [2020-07-10 20:21:06,038 INFO L280 TraceCheckUtils]: 24: Hoare triple {11718#true} ~x~0 := 1 + #t~post2; {11718#true} is VALID [2020-07-10 20:21:06,038 INFO L280 TraceCheckUtils]: 25: Hoare triple {11718#true} havoc #t~post2; {11718#true} is VALID [2020-07-10 20:21:06,038 INFO L280 TraceCheckUtils]: 26: Hoare triple {11718#true} assume !!(~x~0 < 100000); {11718#true} is VALID [2020-07-10 20:21:06,038 INFO L280 TraceCheckUtils]: 27: Hoare triple {11718#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {11718#true} is VALID [2020-07-10 20:21:06,039 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-10 20:21:06,039 INFO L280 TraceCheckUtils]: 29: Hoare triple {11718#true} havoc #t~nondet3; {11718#true} is VALID [2020-07-10 20:21:06,039 INFO L280 TraceCheckUtils]: 30: Hoare triple {11718#true} #t~post2 := ~x~0; {11718#true} is VALID [2020-07-10 20:21:06,039 INFO L280 TraceCheckUtils]: 31: Hoare triple {11718#true} ~x~0 := 1 + #t~post2; {11718#true} is VALID [2020-07-10 20:21:06,040 INFO L280 TraceCheckUtils]: 32: Hoare triple {11718#true} havoc #t~post2; {11718#true} is VALID [2020-07-10 20:21:06,040 INFO L280 TraceCheckUtils]: 33: Hoare triple {11718#true} assume !!(~x~0 < 100000); {11718#true} is VALID [2020-07-10 20:21:06,040 INFO L280 TraceCheckUtils]: 34: Hoare triple {11718#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {11718#true} is VALID [2020-07-10 20:21:06,040 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-10 20:21:06,040 INFO L280 TraceCheckUtils]: 36: Hoare triple {11718#true} havoc #t~nondet3; {11718#true} is VALID [2020-07-10 20:21:06,041 INFO L280 TraceCheckUtils]: 37: Hoare triple {11718#true} #t~post2 := ~x~0; {11718#true} is VALID [2020-07-10 20:21:06,041 INFO L280 TraceCheckUtils]: 38: Hoare triple {11718#true} ~x~0 := 1 + #t~post2; {11718#true} is VALID [2020-07-10 20:21:06,041 INFO L280 TraceCheckUtils]: 39: Hoare triple {11718#true} havoc #t~post2; {11718#true} is VALID [2020-07-10 20:21:06,041 INFO L280 TraceCheckUtils]: 40: Hoare triple {11718#true} assume !!(~x~0 < 100000); {11718#true} is VALID [2020-07-10 20:21:06,041 INFO L280 TraceCheckUtils]: 41: Hoare triple {11718#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {11718#true} is VALID [2020-07-10 20:21:06,042 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-10 20:21:06,042 INFO L280 TraceCheckUtils]: 43: Hoare triple {11718#true} havoc #t~nondet3; {11718#true} is VALID [2020-07-10 20:21:06,042 INFO L280 TraceCheckUtils]: 44: Hoare triple {11718#true} #t~post2 := ~x~0; {11718#true} is VALID [2020-07-10 20:21:06,042 INFO L280 TraceCheckUtils]: 45: Hoare triple {11718#true} ~x~0 := 1 + #t~post2; {11718#true} is VALID [2020-07-10 20:21:06,042 INFO L280 TraceCheckUtils]: 46: Hoare triple {11718#true} havoc #t~post2; {11718#true} is VALID [2020-07-10 20:21:06,043 INFO L280 TraceCheckUtils]: 47: Hoare triple {11718#true} assume !!(~x~0 < 100000); {11718#true} is VALID [2020-07-10 20:21:06,043 INFO L280 TraceCheckUtils]: 48: Hoare triple {11718#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {11718#true} is VALID [2020-07-10 20:21:06,043 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-10 20:21:06,043 INFO L280 TraceCheckUtils]: 50: Hoare triple {11718#true} havoc #t~nondet3; {11718#true} is VALID [2020-07-10 20:21:06,044 INFO L280 TraceCheckUtils]: 51: Hoare triple {11718#true} #t~post2 := ~x~0; {11718#true} is VALID [2020-07-10 20:21:06,044 INFO L280 TraceCheckUtils]: 52: Hoare triple {11718#true} ~x~0 := 1 + #t~post2; {11718#true} is VALID [2020-07-10 20:21:06,044 INFO L280 TraceCheckUtils]: 53: Hoare triple {11718#true} havoc #t~post2; {11718#true} is VALID [2020-07-10 20:21:06,044 INFO L280 TraceCheckUtils]: 54: Hoare triple {11718#true} assume !!(~x~0 < 100000); {11718#true} is VALID [2020-07-10 20:21:06,044 INFO L280 TraceCheckUtils]: 55: Hoare triple {11718#true} assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647; {11718#true} is VALID [2020-07-10 20:21:06,045 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-10 20:21:06,045 INFO L280 TraceCheckUtils]: 57: Hoare triple {11718#true} havoc #t~nondet3; {11718#true} is VALID [2020-07-10 20:21:06,045 INFO L280 TraceCheckUtils]: 58: Hoare triple {11718#true} #t~post2 := ~x~0; {11718#true} is VALID [2020-07-10 20:21:06,045 INFO L280 TraceCheckUtils]: 59: Hoare triple {11718#true} ~x~0 := 1 + #t~post2; {11718#true} is VALID [2020-07-10 20:21:06,046 INFO L280 TraceCheckUtils]: 60: Hoare triple {11718#true} havoc #t~post2; {11718#true} is VALID [2020-07-10 20:21:06,046 INFO L280 TraceCheckUtils]: 61: Hoare triple {11718#true} assume !(~x~0 < 100000); {11718#true} is VALID [2020-07-10 20:21:06,046 INFO L280 TraceCheckUtils]: 62: Hoare triple {11718#true} ~x~0 := 0; {11718#true} is VALID [2020-07-10 20:21:06,046 INFO L280 TraceCheckUtils]: 63: Hoare triple {11718#true} assume !(~x~0 < ~n~0); {11718#true} is VALID [2020-07-10 20:21:06,046 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-10 20:21:06,047 INFO L280 TraceCheckUtils]: 65: Hoare triple {11718#true} havoc ~v~0; {11718#true} is VALID [2020-07-10 20:21:06,047 INFO L280 TraceCheckUtils]: 66: Hoare triple {11718#true} ~v~0 := 0; {11725#(= 0 main_~v~0)} is VALID [2020-07-10 20:21:06,049 INFO L280 TraceCheckUtils]: 67: Hoare triple {11725#(= 0 main_~v~0)} assume !(~v~0 < 100000); {11719#false} is VALID [2020-07-10 20:21:06,049 INFO L280 TraceCheckUtils]: 68: Hoare triple {11719#false} ~v~0 := 0; {11719#false} is VALID [2020-07-10 20:21:06,049 INFO L280 TraceCheckUtils]: 69: Hoare triple {11719#false} assume !!(~v~0 < 100000); {11719#false} is VALID [2020-07-10 20:21:06,049 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-10 20:21:06,050 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-10 20:21:06,050 INFO L280 TraceCheckUtils]: 72: Hoare triple {11718#true} ~set.base, ~set.offset := #in~set.base, #in~set.offset; {11718#true} is VALID [2020-07-10 20:21:06,050 INFO L280 TraceCheckUtils]: 73: Hoare triple {11718#true} ~size := #in~size; {11718#true} is VALID [2020-07-10 20:21:06,050 INFO L280 TraceCheckUtils]: 74: Hoare triple {11718#true} ~value := #in~value; {11718#true} is VALID [2020-07-10 20:21:06,050 INFO L280 TraceCheckUtils]: 75: Hoare triple {11718#true} havoc ~i~0; {11718#true} is VALID [2020-07-10 20:21:06,051 INFO L280 TraceCheckUtils]: 76: Hoare triple {11718#true} ~i~0 := 0; {11718#true} is VALID [2020-07-10 20:21:06,051 INFO L280 TraceCheckUtils]: 77: Hoare triple {11718#true} assume !(~i~0 < ~size); {11718#true} is VALID [2020-07-10 20:21:06,051 INFO L280 TraceCheckUtils]: 78: Hoare triple {11718#true} #res := 0; {11718#true} is VALID [2020-07-10 20:21:06,051 INFO L280 TraceCheckUtils]: 79: Hoare triple {11718#true} assume true; {11718#true} is VALID [2020-07-10 20:21:06,051 INFO L275 TraceCheckUtils]: 80: Hoare quadruple {11718#true} {11719#false} #253#return; {11719#false} is VALID [2020-07-10 20:21:06,052 INFO L280 TraceCheckUtils]: 81: Hoare triple {11719#false} assume -2147483648 <= #t~ret12 && #t~ret12 <= 2147483647; {11719#false} is VALID [2020-07-10 20:21:06,052 INFO L280 TraceCheckUtils]: 82: Hoare triple {11719#false} assume 0 != #t~ret12; {11719#false} is VALID [2020-07-10 20:21:06,052 INFO L280 TraceCheckUtils]: 83: Hoare triple {11719#false} havoc #t~mem11; {11719#false} is VALID [2020-07-10 20:21:06,052 INFO L280 TraceCheckUtils]: 84: Hoare triple {11719#false} havoc #t~ret12; {11719#false} is VALID [2020-07-10 20:21:06,052 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-10 20:21:06,053 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-10 20:21:06,053 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-10 20:21:06,053 INFO L280 TraceCheckUtils]: 88: Hoare triple {11718#true} ~size := #in~size; {11718#true} is VALID [2020-07-10 20:21:06,053 INFO L280 TraceCheckUtils]: 89: Hoare triple {11718#true} ~value := #in~value; {11718#true} is VALID [2020-07-10 20:21:06,054 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-10 20:21:06,054 INFO L280 TraceCheckUtils]: 91: Hoare triple {11718#true} #res := 1 + ~size; {11718#true} is VALID [2020-07-10 20:21:06,054 INFO L280 TraceCheckUtils]: 92: Hoare triple {11718#true} assume true; {11718#true} is VALID [2020-07-10 20:21:06,054 INFO L275 TraceCheckUtils]: 93: Hoare quadruple {11718#true} {11719#false} #255#return; {11719#false} is VALID [2020-07-10 20:21:06,054 INFO L280 TraceCheckUtils]: 94: Hoare triple {11719#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {11719#false} is VALID [2020-07-10 20:21:06,055 INFO L280 TraceCheckUtils]: 95: Hoare triple {11719#false} ~n~0 := #t~ret14; {11719#false} is VALID [2020-07-10 20:21:06,055 INFO L280 TraceCheckUtils]: 96: Hoare triple {11719#false} havoc #t~ret14; {11719#false} is VALID [2020-07-10 20:21:06,055 INFO L280 TraceCheckUtils]: 97: Hoare triple {11719#false} havoc #t~mem13; {11719#false} is VALID [2020-07-10 20:21:06,055 INFO L280 TraceCheckUtils]: 98: Hoare triple {11719#false} ~x~0 := 0; {11719#false} is VALID [2020-07-10 20:21:06,055 INFO L280 TraceCheckUtils]: 99: Hoare triple {11719#false} assume !!(~x~0 < ~n~0); {11719#false} is VALID [2020-07-10 20:21:06,056 INFO L280 TraceCheckUtils]: 100: Hoare triple {11719#false} ~y~0 := 1 + ~x~0; {11719#false} is VALID [2020-07-10 20:21:06,056 INFO L280 TraceCheckUtils]: 101: Hoare triple {11719#false} assume !!(~y~0 < ~n~0); {11719#false} is VALID [2020-07-10 20:21:06,056 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-10 20:21:06,056 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-10 20:21:06,057 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-10 20:21:06,057 INFO L280 TraceCheckUtils]: 105: Hoare triple {11719#false} ~cond := #in~cond; {11719#false} is VALID [2020-07-10 20:21:06,057 INFO L280 TraceCheckUtils]: 106: Hoare triple {11719#false} assume 0 == ~cond; {11719#false} is VALID [2020-07-10 20:21:06,057 INFO L280 TraceCheckUtils]: 107: Hoare triple {11719#false} assume !false; {11719#false} is VALID [2020-07-10 20:21:06,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-10 20:21:06,064 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:21:06,065 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1454060396] [2020-07-10 20:21:06,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:21:06,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 20:21:06,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231445198] [2020-07-10 20:21:06,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2020-07-10 20:21:06,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:21:06,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 20:21:06,133 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-10 20:21:06,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 20:21:06,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:21:06,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 20:21:06,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 20:21:06,134 INFO L87 Difference]: Start difference. First operand 165 states and 177 transitions. Second operand 5 states. [2020-07-10 20:21:07,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:07,005 INFO L93 Difference]: Finished difference Result 298 states and 327 transitions. [2020-07-10 20:21:07,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-10 20:21:07,005 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2020-07-10 20:21:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:21:07,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:07,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 255 transitions. [2020-07-10 20:21:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 20:21:07,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 255 transitions. [2020-07-10 20:21:07,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 255 transitions. [2020-07-10 20:21:07,269 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-10 20:21:07,274 INFO L225 Difference]: With dead ends: 298 [2020-07-10 20:21:07,274 INFO L226 Difference]: Without dead ends: 207 [2020-07-10 20:21:07,275 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-10 20:21:07,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2020-07-10 20:21:07,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 166. [2020-07-10 20:21:07,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:21:07,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand 166 states. [2020-07-10 20:21:07,445 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand 166 states. [2020-07-10 20:21:07,445 INFO L87 Difference]: Start difference. First operand 207 states. Second operand 166 states. [2020-07-10 20:21:07,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:07,450 INFO L93 Difference]: Finished difference Result 207 states and 225 transitions. [2020-07-10 20:21:07,450 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 225 transitions. [2020-07-10 20:21:07,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:07,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:07,451 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand 207 states. [2020-07-10 20:21:07,451 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 207 states. [2020-07-10 20:21:07,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:21:07,456 INFO L93 Difference]: Finished difference Result 207 states and 225 transitions. [2020-07-10 20:21:07,456 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 225 transitions. [2020-07-10 20:21:07,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:21:07,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:21:07,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:21:07,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:21:07,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2020-07-10 20:21:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 178 transitions. [2020-07-10 20:21:07,461 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 178 transitions. Word has length 108 [2020-07-10 20:21:07,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:21:07,461 INFO L479 AbstractCegarLoop]: Abstraction has 166 states and 178 transitions. [2020-07-10 20:21:07,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 20:21:07,461 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 166 states and 178 transitions. [2020-07-10 20:21:07,662 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-10 20:21:07,662 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 178 transitions. [2020-07-10 20:21:07,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2020-07-10 20:21:07,665 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:21:07,665 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-10 20:21:07,665 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 20:21:07,666 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:21:07,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:21:07,666 INFO L82 PathProgramCache]: Analyzing trace with hash -118705538, now seen corresponding path program 1 times [2020-07-10 20:21:07,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:21:07,667 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [546250053] [2020-07-10 20:21:07,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:21:07,689 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 20:21:07,690 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-10 20:21:07,699 INFO L168 Benchmark]: Toolchain (without parser) took 27009.85 ms. Allocated memory was 146.3 MB in the beginning and 450.4 MB in the end (delta: 304.1 MB). Free memory was 104.1 MB in the beginning and 311.5 MB in the end (delta: -207.3 MB). Peak memory consumption was 96.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:07,700 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 146.3 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2020-07-10 20:21:07,701 INFO L168 Benchmark]: CACSL2BoogieTranslator took 310.40 ms. Allocated memory is still 146.3 MB. Free memory was 103.9 MB in the beginning and 91.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:07,710 INFO L168 Benchmark]: Boogie Preprocessor took 143.40 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 91.9 MB in the beginning and 180.2 MB in the end (delta: -88.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:07,712 INFO L168 Benchmark]: RCFGBuilder took 785.20 ms. Allocated memory is still 203.4 MB. Free memory was 180.2 MB in the beginning and 131.2 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:07,713 INFO L168 Benchmark]: TraceAbstraction took 25762.00 ms. Allocated memory was 203.4 MB in the beginning and 450.4 MB in the end (delta: 246.9 MB). Free memory was 130.6 MB in the beginning and 311.5 MB in the end (delta: -180.9 MB). Peak memory consumption was 66.0 MB. Max. memory is 7.1 GB. [2020-07-10 20:21:07,720 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.31 ms. Allocated memory is still 146.3 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 310.40 ms. Allocated memory is still 146.3 MB. Free memory was 103.9 MB in the beginning and 91.9 MB in the end (delta: 12.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 143.40 ms. Allocated memory was 146.3 MB in the beginning and 203.4 MB in the end (delta: 57.1 MB). Free memory was 91.9 MB in the beginning and 180.2 MB in the end (delta: -88.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 785.20 ms. Allocated memory is still 203.4 MB. Free memory was 180.2 MB in the beginning and 131.2 MB in the end (delta: 49.0 MB). Peak memory consumption was 49.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25762.00 ms. Allocated memory was 203.4 MB in the beginning and 450.4 MB in the end (delta: 246.9 MB). Free memory was 130.6 MB in the beginning and 311.5 MB in the end (delta: -180.9 MB). Peak memory consumption was 66.0 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...