./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_pso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8943c3cb-8fc7-4491-8ce7-fa4f5d04d137/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8943c3cb-8fc7-4491-8ce7-fa4f5d04d137/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8943c3cb-8fc7-4491-8ce7-fa4f5d04d137/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8943c3cb-8fc7-4491-8ce7-fa4f5d04d137/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8943c3cb-8fc7-4491-8ce7-fa4f5d04d137/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8943c3cb-8fc7-4491-8ce7-fa4f5d04d137/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 625e9cfcd00842fe2e2329e3096ecaaf5131f016 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 19:23:19,462 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:23:19,463 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:23:19,471 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:23:19,471 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:23:19,471 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:23:19,472 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:23:19,473 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:23:19,474 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:23:19,475 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:23:19,475 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:23:19,475 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:23:19,476 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:23:19,476 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:23:19,477 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:23:19,478 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:23:19,478 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:23:19,479 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:23:19,481 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:23:19,482 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:23:19,482 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:23:19,483 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:23:19,485 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:23:19,485 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:23:19,485 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:23:19,486 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:23:19,487 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:23:19,487 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:23:19,488 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:23:19,488 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:23:19,489 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:23:19,489 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:23:19,489 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:23:19,489 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:23:19,490 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:23:19,490 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:23:19,490 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8943c3cb-8fc7-4491-8ce7-fa4f5d04d137/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:23:19,497 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:23:19,497 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:23:19,498 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:23:19,498 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:23:19,498 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:23:19,498 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:23:19,498 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:23:19,498 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:23:19,498 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:23:19,498 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:23:19,498 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:23:19,498 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:23:19,498 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:23:19,499 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:23:19,499 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:23:19,499 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:23:19,499 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:23:19,499 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:23:19,499 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:23:19,499 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:23:19,499 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:23:19,499 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:23:19,499 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:23:19,499 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:23:19,500 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:23:19,500 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:23:19,500 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:23:19,500 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:23:19,500 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:23:19,500 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:23:19,500 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:23:19,500 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:23:19,500 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:23:19,500 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:23:19,500 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:23:19,500 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:23:19,501 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_8943c3cb-8fc7-4491-8ce7-fa4f5d04d137/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 625e9cfcd00842fe2e2329e3096ecaaf5131f016 [2018-12-09 19:23:19,517 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:23:19,524 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:23:19,526 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:23:19,527 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:23:19,527 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:23:19,528 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8943c3cb-8fc7-4491-8ce7-fa4f5d04d137/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix038_pso.opt_false-unreach-call.i [2018-12-09 19:23:19,574 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8943c3cb-8fc7-4491-8ce7-fa4f5d04d137/bin-2019/utaipan/data/c503364ba/47750aae572e4dba8e28f38a6aa95ec8/FLAG1a3228728 [2018-12-09 19:23:20,018 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:23:20,018 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8943c3cb-8fc7-4491-8ce7-fa4f5d04d137/sv-benchmarks/c/pthread-wmm/mix038_pso.opt_false-unreach-call.i [2018-12-09 19:23:20,027 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8943c3cb-8fc7-4491-8ce7-fa4f5d04d137/bin-2019/utaipan/data/c503364ba/47750aae572e4dba8e28f38a6aa95ec8/FLAG1a3228728 [2018-12-09 19:23:20,036 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8943c3cb-8fc7-4491-8ce7-fa4f5d04d137/bin-2019/utaipan/data/c503364ba/47750aae572e4dba8e28f38a6aa95ec8 [2018-12-09 19:23:20,038 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:23:20,038 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:23:20,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:23:20,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:23:20,041 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:23:20,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:23:20" (1/1) ... [2018-12-09 19:23:20,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cdc5e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:23:20, skipping insertion in model container [2018-12-09 19:23:20,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:23:20" (1/1) ... [2018-12-09 19:23:20,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:23:20,071 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:23:20,250 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:23:20,257 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:23:20,341 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:23:20,380 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:23:20,380 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:23:20 WrapperNode [2018-12-09 19:23:20,380 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:23:20,381 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:23:20,381 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:23:20,381 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:23:20,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:23:20" (1/1) ... [2018-12-09 19:23:20,397 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:23:20" (1/1) ... [2018-12-09 19:23:20,412 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:23:20,412 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:23:20,412 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:23:20,413 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:23:20,418 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:23:20" (1/1) ... [2018-12-09 19:23:20,418 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:23:20" (1/1) ... [2018-12-09 19:23:20,420 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:23:20" (1/1) ... [2018-12-09 19:23:20,421 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:23:20" (1/1) ... [2018-12-09 19:23:20,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:23:20" (1/1) ... [2018-12-09 19:23:20,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:23:20" (1/1) ... [2018-12-09 19:23:20,428 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:23:20" (1/1) ... [2018-12-09 19:23:20,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:23:20,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:23:20,431 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:23:20,431 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:23:20,431 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:23:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8943c3cb-8fc7-4491-8ce7-fa4f5d04d137/bin-2019/utaipan/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 [2018-12-09 19:23:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:23:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 19:23:20,462 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 19:23:20,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:23:20,463 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 19:23:20,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 19:23:20,463 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 19:23:20,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 19:23:20,463 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 19:23:20,463 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 19:23:20,463 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 19:23:20,463 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:23:20,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:23:20,464 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 19:23:20,749 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:23:20,749 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 19:23:20,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:23:20 BoogieIcfgContainer [2018-12-09 19:23:20,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:23:20,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:23:20,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:23:20,752 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:23:20,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:23:20" (1/3) ... [2018-12-09 19:23:20,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89a4f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:23:20, skipping insertion in model container [2018-12-09 19:23:20,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:23:20" (2/3) ... [2018-12-09 19:23:20,753 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@89a4f86 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:23:20, skipping insertion in model container [2018-12-09 19:23:20,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:23:20" (3/3) ... [2018-12-09 19:23:20,754 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_pso.opt_false-unreach-call.i [2018-12-09 19:23:20,779 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,779 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,779 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,779 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,780 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,780 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,780 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,780 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,780 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,780 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,781 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,781 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,781 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,782 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,783 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,784 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,785 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,786 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,787 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,788 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,788 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,788 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,788 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,788 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,788 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,788 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,789 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,790 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,791 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,792 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,793 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,793 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,793 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,793 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,793 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,793 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,794 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,794 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,794 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,794 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,794 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,794 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,795 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,795 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,795 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,795 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,795 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,795 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,795 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,795 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,796 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,796 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,796 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,796 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,796 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,796 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,797 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,797 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,797 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,797 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,797 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,797 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,797 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,798 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,798 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,798 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,798 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,798 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,798 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,798 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,799 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,799 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,799 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,799 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,799 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,799 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,799 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,800 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,800 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,800 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:23:20,805 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 19:23:20,805 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:23:20,812 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 19:23:20,822 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 19:23:20,837 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:23:20,837 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:23:20,837 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:23:20,837 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:23:20,837 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:23:20,837 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:23:20,837 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:23:20,837 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:23:20,844 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146places, 177 transitions [2018-12-09 19:23:41,206 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149045 states. [2018-12-09 19:23:41,207 INFO L276 IsEmpty]: Start isEmpty. Operand 149045 states. [2018-12-09 19:23:41,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 19:23:41,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:23:41,215 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:23:41,216 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:23:41,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:23:41,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1389776375, now seen corresponding path program 1 times [2018-12-09 19:23:41,221 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:23:41,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:23:41,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:23:41,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:23:41,255 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:23:41,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:23:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:23:41,371 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:23:41,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:23:41,371 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:23:41,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:23:41,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:23:41,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:23:41,384 INFO L87 Difference]: Start difference. First operand 149045 states. Second operand 4 states. [2018-12-09 19:23:44,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:23:44,179 INFO L93 Difference]: Finished difference Result 257065 states and 1188604 transitions. [2018-12-09 19:23:44,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:23:44,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-09 19:23:44,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:23:44,780 INFO L225 Difference]: With dead ends: 257065 [2018-12-09 19:23:44,780 INFO L226 Difference]: Without dead ends: 174815 [2018-12-09 19:23:44,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:23:45,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174815 states. [2018-12-09 19:23:47,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174815 to 110555. [2018-12-09 19:23:47,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110555 states. [2018-12-09 19:23:47,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110555 states to 110555 states and 511486 transitions. [2018-12-09 19:23:47,945 INFO L78 Accepts]: Start accepts. Automaton has 110555 states and 511486 transitions. Word has length 46 [2018-12-09 19:23:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:23:47,946 INFO L480 AbstractCegarLoop]: Abstraction has 110555 states and 511486 transitions. [2018-12-09 19:23:47,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:23:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 110555 states and 511486 transitions. [2018-12-09 19:23:47,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 19:23:47,956 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:23:47,956 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:23:47,956 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:23:47,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:23:47,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1733656626, now seen corresponding path program 1 times [2018-12-09 19:23:47,957 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:23:47,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:23:47,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:23:47,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:23:47,960 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:23:47,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:23:48,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:23:48,014 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:23:48,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:23:48,014 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:23:48,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:23:48,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:23:48,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:23:48,015 INFO L87 Difference]: Start difference. First operand 110555 states and 511486 transitions. Second operand 5 states. [2018-12-09 19:23:51,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:23:51,258 INFO L93 Difference]: Finished difference Result 240605 states and 1068741 transitions. [2018-12-09 19:23:51,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:23:51,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-09 19:23:51,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:23:51,867 INFO L225 Difference]: With dead ends: 240605 [2018-12-09 19:23:51,867 INFO L226 Difference]: Without dead ends: 237055 [2018-12-09 19:23:51,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:23:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237055 states. [2018-12-09 19:23:55,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237055 to 160435. [2018-12-09 19:23:55,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160435 states. [2018-12-09 19:23:55,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160435 states to 160435 states and 716930 transitions. [2018-12-09 19:23:55,527 INFO L78 Accepts]: Start accepts. Automaton has 160435 states and 716930 transitions. Word has length 54 [2018-12-09 19:23:55,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:23:55,528 INFO L480 AbstractCegarLoop]: Abstraction has 160435 states and 716930 transitions. [2018-12-09 19:23:55,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:23:55,528 INFO L276 IsEmpty]: Start isEmpty. Operand 160435 states and 716930 transitions. [2018-12-09 19:23:55,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 19:23:55,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:23:55,537 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:23:55,537 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:23:55,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:23:55,537 INFO L82 PathProgramCache]: Analyzing trace with hash 665822922, now seen corresponding path program 1 times [2018-12-09 19:23:55,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:23:55,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:23:55,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:23:55,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:23:55,540 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:23:55,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:23:55,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:23:55,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:23:55,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:23:55,586 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:23:55,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:23:55,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:23:55,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:23:55,587 INFO L87 Difference]: Start difference. First operand 160435 states and 716930 transitions. Second operand 5 states. [2018-12-09 19:23:57,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:23:57,201 INFO L93 Difference]: Finished difference Result 317175 states and 1405287 transitions. [2018-12-09 19:23:57,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:23:57,201 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-12-09 19:23:57,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:23:58,689 INFO L225 Difference]: With dead ends: 317175 [2018-12-09 19:23:58,689 INFO L226 Difference]: Without dead ends: 314275 [2018-12-09 19:23:58,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:23:59,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314275 states. [2018-12-09 19:24:02,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314275 to 178275. [2018-12-09 19:24:02,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178275 states. [2018-12-09 19:24:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178275 states to 178275 states and 791492 transitions. [2018-12-09 19:24:03,403 INFO L78 Accepts]: Start accepts. Automaton has 178275 states and 791492 transitions. Word has length 55 [2018-12-09 19:24:03,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:03,403 INFO L480 AbstractCegarLoop]: Abstraction has 178275 states and 791492 transitions. [2018-12-09 19:24:03,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:24:03,403 INFO L276 IsEmpty]: Start isEmpty. Operand 178275 states and 791492 transitions. [2018-12-09 19:24:03,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 19:24:03,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:03,417 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:03,417 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:03,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:03,417 INFO L82 PathProgramCache]: Analyzing trace with hash -137196688, now seen corresponding path program 1 times [2018-12-09 19:24:03,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:03,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:03,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:03,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:03,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:03,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:03,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:03,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:24:03,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:03,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:24:03,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:24:03,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:24:03,445 INFO L87 Difference]: Start difference. First operand 178275 states and 791492 transitions. Second operand 3 states. [2018-12-09 19:24:04,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:04,897 INFO L93 Difference]: Finished difference Result 231655 states and 1011276 transitions. [2018-12-09 19:24:04,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:24:04,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-12-09 19:24:04,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:05,487 INFO L225 Difference]: With dead ends: 231655 [2018-12-09 19:24:05,488 INFO L226 Difference]: Without dead ends: 231655 [2018-12-09 19:24:05,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:24:06,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231655 states. [2018-12-09 19:24:12,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231655 to 202940. [2018-12-09 19:24:12,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202940 states. [2018-12-09 19:24:12,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202940 states to 202940 states and 893564 transitions. [2018-12-09 19:24:12,704 INFO L78 Accepts]: Start accepts. Automaton has 202940 states and 893564 transitions. Word has length 57 [2018-12-09 19:24:12,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:12,705 INFO L480 AbstractCegarLoop]: Abstraction has 202940 states and 893564 transitions. [2018-12-09 19:24:12,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:24:12,705 INFO L276 IsEmpty]: Start isEmpty. Operand 202940 states and 893564 transitions. [2018-12-09 19:24:12,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 19:24:12,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:12,737 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:12,738 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:12,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:12,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1048459579, now seen corresponding path program 1 times [2018-12-09 19:24:12,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:12,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:12,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:12,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:12,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:12,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:12,808 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:12,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:24:12,808 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:12,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:24:12,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:24:12,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:24:12,808 INFO L87 Difference]: Start difference. First operand 202940 states and 893564 transitions. Second operand 6 states. [2018-12-09 19:24:14,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:14,864 INFO L93 Difference]: Finished difference Result 356175 states and 1552272 transitions. [2018-12-09 19:24:14,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:24:14,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-09 19:24:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:16,236 INFO L225 Difference]: With dead ends: 356175 [2018-12-09 19:24:16,236 INFO L226 Difference]: Without dead ends: 352825 [2018-12-09 19:24:16,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 19:24:17,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352825 states. [2018-12-09 19:24:23,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352825 to 205745. [2018-12-09 19:24:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205745 states. [2018-12-09 19:24:24,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205745 states to 205745 states and 906783 transitions. [2018-12-09 19:24:24,327 INFO L78 Accepts]: Start accepts. Automaton has 205745 states and 906783 transitions. Word has length 61 [2018-12-09 19:24:24,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:24,327 INFO L480 AbstractCegarLoop]: Abstraction has 205745 states and 906783 transitions. [2018-12-09 19:24:24,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:24:24,327 INFO L276 IsEmpty]: Start isEmpty. Operand 205745 states and 906783 transitions. [2018-12-09 19:24:24,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 19:24:24,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:24,359 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:24,359 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:24,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:24,359 INFO L82 PathProgramCache]: Analyzing trace with hash -639670917, now seen corresponding path program 1 times [2018-12-09 19:24:24,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:24,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:24,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:24,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:24,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:24,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:24,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:24,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:24:24,452 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:24,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:24:24,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:24:24,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:24:24,453 INFO L87 Difference]: Start difference. First operand 205745 states and 906783 transitions. Second operand 7 states. [2018-12-09 19:24:26,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:26,707 INFO L93 Difference]: Finished difference Result 363445 states and 1539808 transitions. [2018-12-09 19:24:26,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:24:26,707 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-12-09 19:24:26,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:28,079 INFO L225 Difference]: With dead ends: 363445 [2018-12-09 19:24:28,079 INFO L226 Difference]: Without dead ends: 363445 [2018-12-09 19:24:28,079 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:24:29,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363445 states. [2018-12-09 19:24:35,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363445 to 273285. [2018-12-09 19:24:35,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273285 states. [2018-12-09 19:24:37,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273285 states to 273285 states and 1180560 transitions. [2018-12-09 19:24:37,056 INFO L78 Accepts]: Start accepts. Automaton has 273285 states and 1180560 transitions. Word has length 61 [2018-12-09 19:24:37,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:37,057 INFO L480 AbstractCegarLoop]: Abstraction has 273285 states and 1180560 transitions. [2018-12-09 19:24:37,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:24:37,057 INFO L276 IsEmpty]: Start isEmpty. Operand 273285 states and 1180560 transitions. [2018-12-09 19:24:37,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 19:24:37,098 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:37,098 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:37,098 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:37,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:37,098 INFO L82 PathProgramCache]: Analyzing trace with hash 247832764, now seen corresponding path program 1 times [2018-12-09 19:24:37,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:37,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:37,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:37,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:37,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:37,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:37,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:37,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:37,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:24:37,152 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:37,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:24:37,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:24:37,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:24:37,152 INFO L87 Difference]: Start difference. First operand 273285 states and 1180560 transitions. Second operand 4 states. [2018-12-09 19:24:38,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:38,179 INFO L93 Difference]: Finished difference Result 238293 states and 1009124 transitions. [2018-12-09 19:24:38,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:24:38,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-09 19:24:38,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:38,765 INFO L225 Difference]: With dead ends: 238293 [2018-12-09 19:24:38,766 INFO L226 Difference]: Without dead ends: 230208 [2018-12-09 19:24:38,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:24:40,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230208 states. [2018-12-09 19:24:42,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230208 to 230208. [2018-12-09 19:24:42,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230208 states. [2018-12-09 19:24:43,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230208 states to 230208 states and 981402 transitions. [2018-12-09 19:24:43,712 INFO L78 Accepts]: Start accepts. Automaton has 230208 states and 981402 transitions. Word has length 61 [2018-12-09 19:24:43,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:43,713 INFO L480 AbstractCegarLoop]: Abstraction has 230208 states and 981402 transitions. [2018-12-09 19:24:43,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:24:43,713 INFO L276 IsEmpty]: Start isEmpty. Operand 230208 states and 981402 transitions. [2018-12-09 19:24:43,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 19:24:43,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:43,749 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:43,749 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:43,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:43,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1622064650, now seen corresponding path program 1 times [2018-12-09 19:24:43,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:43,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:43,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:43,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:43,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:43,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:43,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:43,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:24:43,786 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:43,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:24:43,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:24:43,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:24:43,786 INFO L87 Difference]: Start difference. First operand 230208 states and 981402 transitions. Second operand 5 states. [2018-12-09 19:24:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:44,015 INFO L93 Difference]: Finished difference Result 55500 states and 215291 transitions. [2018-12-09 19:24:44,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:24:44,016 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-12-09 19:24:44,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:44,105 INFO L225 Difference]: With dead ends: 55500 [2018-12-09 19:24:44,105 INFO L226 Difference]: Without dead ends: 48584 [2018-12-09 19:24:44,106 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:24:44,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48584 states. [2018-12-09 19:24:44,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48584 to 48344. [2018-12-09 19:24:44,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48344 states. [2018-12-09 19:24:44,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48344 states to 48344 states and 187078 transitions. [2018-12-09 19:24:44,768 INFO L78 Accepts]: Start accepts. Automaton has 48344 states and 187078 transitions. Word has length 62 [2018-12-09 19:24:44,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:44,768 INFO L480 AbstractCegarLoop]: Abstraction has 48344 states and 187078 transitions. [2018-12-09 19:24:44,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:24:44,768 INFO L276 IsEmpty]: Start isEmpty. Operand 48344 states and 187078 transitions. [2018-12-09 19:24:44,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 19:24:44,783 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:44,783 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:44,783 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:44,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:44,783 INFO L82 PathProgramCache]: Analyzing trace with hash -735521465, now seen corresponding path program 1 times [2018-12-09 19:24:44,783 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:44,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:44,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:44,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:44,785 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:44,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:44,811 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:44,811 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:44,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:24:44,811 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:44,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:24:44,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:24:44,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:24:44,812 INFO L87 Difference]: Start difference. First operand 48344 states and 187078 transitions. Second operand 4 states. [2018-12-09 19:24:45,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:45,972 INFO L93 Difference]: Finished difference Result 56631 states and 218625 transitions. [2018-12-09 19:24:45,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:24:45,972 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-09 19:24:45,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:46,076 INFO L225 Difference]: With dead ends: 56631 [2018-12-09 19:24:46,076 INFO L226 Difference]: Without dead ends: 56631 [2018-12-09 19:24:46,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:24:46,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56631 states. [2018-12-09 19:24:46,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56631 to 51431. [2018-12-09 19:24:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51431 states. [2018-12-09 19:24:46,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51431 states to 51431 states and 198665 transitions. [2018-12-09 19:24:46,790 INFO L78 Accepts]: Start accepts. Automaton has 51431 states and 198665 transitions. Word has length 72 [2018-12-09 19:24:46,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:46,790 INFO L480 AbstractCegarLoop]: Abstraction has 51431 states and 198665 transitions. [2018-12-09 19:24:46,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:24:46,790 INFO L276 IsEmpty]: Start isEmpty. Operand 51431 states and 198665 transitions. [2018-12-09 19:24:46,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 19:24:46,808 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:46,808 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:46,808 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:46,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:46,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1007288870, now seen corresponding path program 1 times [2018-12-09 19:24:46,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:46,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:46,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:46,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:46,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:46,868 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:46,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:24:46,868 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:46,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:24:46,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:24:46,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:24:46,869 INFO L87 Difference]: Start difference. First operand 51431 states and 198665 transitions. Second operand 6 states. [2018-12-09 19:24:46,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:46,936 INFO L93 Difference]: Finished difference Result 14279 states and 47593 transitions. [2018-12-09 19:24:46,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:24:46,937 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-12-09 19:24:46,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:46,952 INFO L225 Difference]: With dead ends: 14279 [2018-12-09 19:24:46,952 INFO L226 Difference]: Without dead ends: 12023 [2018-12-09 19:24:46,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:24:46,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12023 states. [2018-12-09 19:24:47,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12023 to 11433. [2018-12-09 19:24:47,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11433 states. [2018-12-09 19:24:47,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11433 states to 11433 states and 37545 transitions. [2018-12-09 19:24:47,071 INFO L78 Accepts]: Start accepts. Automaton has 11433 states and 37545 transitions. Word has length 72 [2018-12-09 19:24:47,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:47,071 INFO L480 AbstractCegarLoop]: Abstraction has 11433 states and 37545 transitions. [2018-12-09 19:24:47,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:24:47,071 INFO L276 IsEmpty]: Start isEmpty. Operand 11433 states and 37545 transitions. [2018-12-09 19:24:47,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 19:24:47,082 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:47,082 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:47,083 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:47,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:47,083 INFO L82 PathProgramCache]: Analyzing trace with hash 938486132, now seen corresponding path program 1 times [2018-12-09 19:24:47,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:47,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:47,084 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:47,084 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:47,084 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:47,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:47,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:47,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:24:47,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:47,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:24:47,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:24:47,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:24:47,121 INFO L87 Difference]: Start difference. First operand 11433 states and 37545 transitions. Second operand 4 states. [2018-12-09 19:24:47,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:47,262 INFO L93 Difference]: Finished difference Result 15878 states and 51191 transitions. [2018-12-09 19:24:47,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:24:47,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-09 19:24:47,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:47,282 INFO L225 Difference]: With dead ends: 15878 [2018-12-09 19:24:47,282 INFO L226 Difference]: Without dead ends: 15878 [2018-12-09 19:24:47,282 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:24:47,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15878 states. [2018-12-09 19:24:47,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15878 to 13895. [2018-12-09 19:24:47,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13895 states. [2018-12-09 19:24:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13895 states to 13895 states and 45044 transitions. [2018-12-09 19:24:47,439 INFO L78 Accepts]: Start accepts. Automaton has 13895 states and 45044 transitions. Word has length 91 [2018-12-09 19:24:47,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:47,439 INFO L480 AbstractCegarLoop]: Abstraction has 13895 states and 45044 transitions. [2018-12-09 19:24:47,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:24:47,440 INFO L276 IsEmpty]: Start isEmpty. Operand 13895 states and 45044 transitions. [2018-12-09 19:24:47,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 19:24:47,452 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:47,452 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:47,452 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:47,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:47,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1289286069, now seen corresponding path program 1 times [2018-12-09 19:24:47,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:47,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:47,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:47,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:47,454 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:47,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:47,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:47,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:47,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:24:47,477 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:47,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:24:47,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:24:47,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:24:47,477 INFO L87 Difference]: Start difference. First operand 13895 states and 45044 transitions. Second operand 3 states. [2018-12-09 19:24:47,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:47,584 INFO L93 Difference]: Finished difference Result 15005 states and 48497 transitions. [2018-12-09 19:24:47,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:24:47,584 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2018-12-09 19:24:47,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:47,600 INFO L225 Difference]: With dead ends: 15005 [2018-12-09 19:24:47,600 INFO L226 Difference]: Without dead ends: 15005 [2018-12-09 19:24:47,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:24:47,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15005 states. [2018-12-09 19:24:47,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15005 to 14505. [2018-12-09 19:24:47,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14505 states. [2018-12-09 19:24:47,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14505 states to 14505 states and 46952 transitions. [2018-12-09 19:24:47,793 INFO L78 Accepts]: Start accepts. Automaton has 14505 states and 46952 transitions. Word has length 91 [2018-12-09 19:24:47,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:47,793 INFO L480 AbstractCegarLoop]: Abstraction has 14505 states and 46952 transitions. [2018-12-09 19:24:47,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:24:47,793 INFO L276 IsEmpty]: Start isEmpty. Operand 14505 states and 46952 transitions. [2018-12-09 19:24:47,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 19:24:47,805 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:47,806 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:47,806 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:47,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:47,806 INFO L82 PathProgramCache]: Analyzing trace with hash -113408041, now seen corresponding path program 2 times [2018-12-09 19:24:47,806 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:47,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:47,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:47,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:47,807 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:47,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:47,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:47,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:47,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 19:24:47,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:47,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 19:24:47,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 19:24:47,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:24:47,892 INFO L87 Difference]: Start difference. First operand 14505 states and 46952 transitions. Second operand 9 states. [2018-12-09 19:24:48,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:48,076 INFO L93 Difference]: Finished difference Result 17362 states and 55727 transitions. [2018-12-09 19:24:48,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:24:48,076 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 91 [2018-12-09 19:24:48,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:48,094 INFO L225 Difference]: With dead ends: 17362 [2018-12-09 19:24:48,094 INFO L226 Difference]: Without dead ends: 17362 [2018-12-09 19:24:48,095 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-09 19:24:48,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17362 states. [2018-12-09 19:24:48,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17362 to 14570. [2018-12-09 19:24:48,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14570 states. [2018-12-09 19:24:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14570 states to 14570 states and 47129 transitions. [2018-12-09 19:24:48,246 INFO L78 Accepts]: Start accepts. Automaton has 14570 states and 47129 transitions. Word has length 91 [2018-12-09 19:24:48,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:48,246 INFO L480 AbstractCegarLoop]: Abstraction has 14570 states and 47129 transitions. [2018-12-09 19:24:48,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 19:24:48,247 INFO L276 IsEmpty]: Start isEmpty. Operand 14570 states and 47129 transitions. [2018-12-09 19:24:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 19:24:48,259 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:48,259 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:48,260 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:48,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:48,260 INFO L82 PathProgramCache]: Analyzing trace with hash -865610695, now seen corresponding path program 3 times [2018-12-09 19:24:48,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:48,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:48,261 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:24:48,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:48,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:48,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:48,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:48,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:48,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:24:48,313 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:48,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:24:48,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:24:48,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:24:48,314 INFO L87 Difference]: Start difference. First operand 14570 states and 47129 transitions. Second operand 5 states. [2018-12-09 19:24:48,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:48,495 INFO L93 Difference]: Finished difference Result 18322 states and 58640 transitions. [2018-12-09 19:24:48,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:24:48,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-09 19:24:48,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:48,514 INFO L225 Difference]: With dead ends: 18322 [2018-12-09 19:24:48,514 INFO L226 Difference]: Without dead ends: 18322 [2018-12-09 19:24:48,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:24:48,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18322 states. [2018-12-09 19:24:48,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18322 to 15055. [2018-12-09 19:24:48,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15055 states. [2018-12-09 19:24:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15055 states to 15055 states and 48542 transitions. [2018-12-09 19:24:48,683 INFO L78 Accepts]: Start accepts. Automaton has 15055 states and 48542 transitions. Word has length 91 [2018-12-09 19:24:48,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:48,683 INFO L480 AbstractCegarLoop]: Abstraction has 15055 states and 48542 transitions. [2018-12-09 19:24:48,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:24:48,683 INFO L276 IsEmpty]: Start isEmpty. Operand 15055 states and 48542 transitions. [2018-12-09 19:24:48,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 19:24:48,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:48,697 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:48,697 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:48,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:48,697 INFO L82 PathProgramCache]: Analyzing trace with hash 466894554, now seen corresponding path program 2 times [2018-12-09 19:24:48,697 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:48,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:48,698 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:24:48,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:48,698 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:48,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:48,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:48,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:24:48,765 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:48,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:24:48,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:24:48,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:24:48,765 INFO L87 Difference]: Start difference. First operand 15055 states and 48542 transitions. Second operand 7 states. [2018-12-09 19:24:49,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:49,075 INFO L93 Difference]: Finished difference Result 27728 states and 89797 transitions. [2018-12-09 19:24:49,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 19:24:49,076 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-09 19:24:49,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:49,108 INFO L225 Difference]: With dead ends: 27728 [2018-12-09 19:24:49,108 INFO L226 Difference]: Without dead ends: 27728 [2018-12-09 19:24:49,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:24:49,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27728 states. [2018-12-09 19:24:49,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27728 to 17726. [2018-12-09 19:24:49,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17726 states. [2018-12-09 19:24:49,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17726 states to 17726 states and 57679 transitions. [2018-12-09 19:24:49,339 INFO L78 Accepts]: Start accepts. Automaton has 17726 states and 57679 transitions. Word has length 91 [2018-12-09 19:24:49,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:49,340 INFO L480 AbstractCegarLoop]: Abstraction has 17726 states and 57679 transitions. [2018-12-09 19:24:49,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:24:49,340 INFO L276 IsEmpty]: Start isEmpty. Operand 17726 states and 57679 transitions. [2018-12-09 19:24:49,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 19:24:49,355 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:49,355 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:49,355 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:49,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:49,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1354398235, now seen corresponding path program 1 times [2018-12-09 19:24:49,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:49,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:49,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:24:49,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:49,357 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:49,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:49,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:49,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:49,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:24:49,426 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:49,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:24:49,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:24:49,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:24:49,427 INFO L87 Difference]: Start difference. First operand 17726 states and 57679 transitions. Second operand 6 states. [2018-12-09 19:24:49,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:49,502 INFO L93 Difference]: Finished difference Result 21545 states and 69164 transitions. [2018-12-09 19:24:49,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:24:49,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 19:24:49,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:49,526 INFO L225 Difference]: With dead ends: 21545 [2018-12-09 19:24:49,526 INFO L226 Difference]: Without dead ends: 21545 [2018-12-09 19:24:49,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:24:49,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21545 states. [2018-12-09 19:24:49,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21545 to 16211. [2018-12-09 19:24:49,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16211 states. [2018-12-09 19:24:49,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16211 states to 16211 states and 51961 transitions. [2018-12-09 19:24:49,711 INFO L78 Accepts]: Start accepts. Automaton has 16211 states and 51961 transitions. Word has length 91 [2018-12-09 19:24:49,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:49,711 INFO L480 AbstractCegarLoop]: Abstraction has 16211 states and 51961 transitions. [2018-12-09 19:24:49,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:24:49,712 INFO L276 IsEmpty]: Start isEmpty. Operand 16211 states and 51961 transitions. [2018-12-09 19:24:49,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-09 19:24:49,725 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:49,725 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:49,726 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:49,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:49,726 INFO L82 PathProgramCache]: Analyzing trace with hash -377577317, now seen corresponding path program 1 times [2018-12-09 19:24:49,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:49,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:49,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:49,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:49,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:49,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:49,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:49,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:49,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:24:49,866 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:49,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:24:49,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:24:49,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:24:49,866 INFO L87 Difference]: Start difference. First operand 16211 states and 51961 transitions. Second operand 6 states. [2018-12-09 19:24:49,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:49,972 INFO L93 Difference]: Finished difference Result 15443 states and 48825 transitions. [2018-12-09 19:24:49,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:24:49,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-09 19:24:49,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:49,988 INFO L225 Difference]: With dead ends: 15443 [2018-12-09 19:24:49,988 INFO L226 Difference]: Without dead ends: 15443 [2018-12-09 19:24:49,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:24:50,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15443 states. [2018-12-09 19:24:50,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15443 to 12741. [2018-12-09 19:24:50,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12741 states. [2018-12-09 19:24:50,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12741 states to 12741 states and 40618 transitions. [2018-12-09 19:24:50,136 INFO L78 Accepts]: Start accepts. Automaton has 12741 states and 40618 transitions. Word has length 91 [2018-12-09 19:24:50,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:50,136 INFO L480 AbstractCegarLoop]: Abstraction has 12741 states and 40618 transitions. [2018-12-09 19:24:50,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:24:50,136 INFO L276 IsEmpty]: Start isEmpty. Operand 12741 states and 40618 transitions. [2018-12-09 19:24:50,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 19:24:50,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:50,147 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:50,147 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:50,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:50,148 INFO L82 PathProgramCache]: Analyzing trace with hash -886914850, now seen corresponding path program 1 times [2018-12-09 19:24:50,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:50,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:50,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:50,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:50,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:50,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:50,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:50,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:24:50,192 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:50,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:24:50,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:24:50,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:24:50,192 INFO L87 Difference]: Start difference. First operand 12741 states and 40618 transitions. Second operand 6 states. [2018-12-09 19:24:50,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:50,501 INFO L93 Difference]: Finished difference Result 16641 states and 52728 transitions. [2018-12-09 19:24:50,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:24:50,502 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 19:24:50,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:50,519 INFO L225 Difference]: With dead ends: 16641 [2018-12-09 19:24:50,520 INFO L226 Difference]: Without dead ends: 16266 [2018-12-09 19:24:50,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:24:50,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16266 states. [2018-12-09 19:24:50,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16266 to 15261. [2018-12-09 19:24:50,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15261 states. [2018-12-09 19:24:50,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15261 states to 15261 states and 48579 transitions. [2018-12-09 19:24:50,678 INFO L78 Accepts]: Start accepts. Automaton has 15261 states and 48579 transitions. Word has length 93 [2018-12-09 19:24:50,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:50,678 INFO L480 AbstractCegarLoop]: Abstraction has 15261 states and 48579 transitions. [2018-12-09 19:24:50,678 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:24:50,678 INFO L276 IsEmpty]: Start isEmpty. Operand 15261 states and 48579 transitions. [2018-12-09 19:24:50,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 19:24:50,692 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:50,692 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:50,692 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:50,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:50,692 INFO L82 PathProgramCache]: Analyzing trace with hash -536114913, now seen corresponding path program 1 times [2018-12-09 19:24:50,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:50,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:50,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:50,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:50,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:50,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:50,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:50,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:24:50,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:50,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:24:50,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:24:50,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:24:50,744 INFO L87 Difference]: Start difference. First operand 15261 states and 48579 transitions. Second operand 6 states. [2018-12-09 19:24:50,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:50,919 INFO L93 Difference]: Finished difference Result 18581 states and 57280 transitions. [2018-12-09 19:24:50,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:24:50,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-09 19:24:50,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:50,938 INFO L225 Difference]: With dead ends: 18581 [2018-12-09 19:24:50,938 INFO L226 Difference]: Without dead ends: 18581 [2018-12-09 19:24:50,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:24:50,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18581 states. [2018-12-09 19:24:51,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18581 to 15531. [2018-12-09 19:24:51,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15531 states. [2018-12-09 19:24:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15531 states to 15531 states and 48385 transitions. [2018-12-09 19:24:51,111 INFO L78 Accepts]: Start accepts. Automaton has 15531 states and 48385 transitions. Word has length 93 [2018-12-09 19:24:51,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:51,111 INFO L480 AbstractCegarLoop]: Abstraction has 15531 states and 48385 transitions. [2018-12-09 19:24:51,111 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:24:51,111 INFO L276 IsEmpty]: Start isEmpty. Operand 15531 states and 48385 transitions. [2018-12-09 19:24:51,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 19:24:51,124 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:51,124 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:51,124 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:51,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:51,124 INFO L82 PathProgramCache]: Analyzing trace with hash -324764000, now seen corresponding path program 1 times [2018-12-09 19:24:51,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:51,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:51,125 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:51,125 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:51,126 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:51,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:51,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:51,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:24:51,193 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:51,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:24:51,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:24:51,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:24:51,193 INFO L87 Difference]: Start difference. First operand 15531 states and 48385 transitions. Second operand 5 states. [2018-12-09 19:24:51,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:51,242 INFO L93 Difference]: Finished difference Result 15531 states and 48321 transitions. [2018-12-09 19:24:51,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:24:51,243 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2018-12-09 19:24:51,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:51,259 INFO L225 Difference]: With dead ends: 15531 [2018-12-09 19:24:51,259 INFO L226 Difference]: Without dead ends: 15531 [2018-12-09 19:24:51,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:24:51,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15531 states. [2018-12-09 19:24:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15531 to 15531. [2018-12-09 19:24:51,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15531 states. [2018-12-09 19:24:51,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15531 states to 15531 states and 48321 transitions. [2018-12-09 19:24:51,417 INFO L78 Accepts]: Start accepts. Automaton has 15531 states and 48321 transitions. Word has length 93 [2018-12-09 19:24:51,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:51,417 INFO L480 AbstractCegarLoop]: Abstraction has 15531 states and 48321 transitions. [2018-12-09 19:24:51,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:24:51,417 INFO L276 IsEmpty]: Start isEmpty. Operand 15531 states and 48321 transitions. [2018-12-09 19:24:51,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 19:24:51,431 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:51,431 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:51,431 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:51,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:51,432 INFO L82 PathProgramCache]: Analyzing trace with hash 562739681, now seen corresponding path program 1 times [2018-12-09 19:24:51,432 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:51,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:51,433 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:51,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:51,433 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:51,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:51,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:51,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:24:51,525 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:51,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:24:51,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:24:51,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:24:51,526 INFO L87 Difference]: Start difference. First operand 15531 states and 48321 transitions. Second operand 10 states. [2018-12-09 19:24:52,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:52,311 INFO L93 Difference]: Finished difference Result 25784 states and 80022 transitions. [2018-12-09 19:24:52,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:24:52,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-12-09 19:24:52,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:52,333 INFO L225 Difference]: With dead ends: 25784 [2018-12-09 19:24:52,333 INFO L226 Difference]: Without dead ends: 18046 [2018-12-09 19:24:52,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-09 19:24:52,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18046 states. [2018-12-09 19:24:52,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18046 to 15751. [2018-12-09 19:24:52,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15751 states. [2018-12-09 19:24:52,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15751 states to 15751 states and 48587 transitions. [2018-12-09 19:24:52,552 INFO L78 Accepts]: Start accepts. Automaton has 15751 states and 48587 transitions. Word has length 93 [2018-12-09 19:24:52,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:52,552 INFO L480 AbstractCegarLoop]: Abstraction has 15751 states and 48587 transitions. [2018-12-09 19:24:52,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:24:52,552 INFO L276 IsEmpty]: Start isEmpty. Operand 15751 states and 48587 transitions. [2018-12-09 19:24:52,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 19:24:52,564 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:52,564 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:52,565 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:52,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:52,565 INFO L82 PathProgramCache]: Analyzing trace with hash -212858757, now seen corresponding path program 2 times [2018-12-09 19:24:52,565 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:52,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:52,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:52,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:52,566 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:52,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:52,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:52,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:52,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:24:52,646 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:52,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:24:52,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:24:52,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:24:52,647 INFO L87 Difference]: Start difference. First operand 15751 states and 48587 transitions. Second operand 10 states. [2018-12-09 19:24:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:53,189 INFO L93 Difference]: Finished difference Result 29139 states and 89472 transitions. [2018-12-09 19:24:53,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:24:53,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-12-09 19:24:53,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:53,204 INFO L225 Difference]: With dead ends: 29139 [2018-12-09 19:24:53,204 INFO L226 Difference]: Without dead ends: 13763 [2018-12-09 19:24:53,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-09 19:24:53,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13763 states. [2018-12-09 19:24:53,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13763 to 13763. [2018-12-09 19:24:53,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13763 states. [2018-12-09 19:24:53,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13763 states to 13763 states and 42215 transitions. [2018-12-09 19:24:53,344 INFO L78 Accepts]: Start accepts. Automaton has 13763 states and 42215 transitions. Word has length 93 [2018-12-09 19:24:53,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:53,344 INFO L480 AbstractCegarLoop]: Abstraction has 13763 states and 42215 transitions. [2018-12-09 19:24:53,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:24:53,344 INFO L276 IsEmpty]: Start isEmpty. Operand 13763 states and 42215 transitions. [2018-12-09 19:24:53,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 19:24:53,356 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:53,357 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:53,357 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:53,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:53,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1764786221, now seen corresponding path program 3 times [2018-12-09 19:24:53,357 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:53,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:53,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:24:53,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:53,358 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:53,423 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:53,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:24:53,423 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:53,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:24:53,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:24:53,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:24:53,423 INFO L87 Difference]: Start difference. First operand 13763 states and 42215 transitions. Second operand 7 states. [2018-12-09 19:24:53,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:53,774 INFO L93 Difference]: Finished difference Result 24004 states and 73599 transitions. [2018-12-09 19:24:53,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:24:53,774 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-09 19:24:53,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:53,788 INFO L225 Difference]: With dead ends: 24004 [2018-12-09 19:24:53,788 INFO L226 Difference]: Without dead ends: 9850 [2018-12-09 19:24:53,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:24:53,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9850 states. [2018-12-09 19:24:53,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9850 to 9850. [2018-12-09 19:24:53,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9850 states. [2018-12-09 19:24:53,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9850 states to 9850 states and 30173 transitions. [2018-12-09 19:24:53,881 INFO L78 Accepts]: Start accepts. Automaton has 9850 states and 30173 transitions. Word has length 93 [2018-12-09 19:24:53,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:53,881 INFO L480 AbstractCegarLoop]: Abstraction has 9850 states and 30173 transitions. [2018-12-09 19:24:53,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:24:53,881 INFO L276 IsEmpty]: Start isEmpty. Operand 9850 states and 30173 transitions. [2018-12-09 19:24:53,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 19:24:53,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:53,889 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:53,889 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:53,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:53,890 INFO L82 PathProgramCache]: Analyzing trace with hash 711266582, now seen corresponding path program 1 times [2018-12-09 19:24:53,890 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:53,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:53,891 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:24:53,891 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:53,891 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:53,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:53,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:53,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:24:53,952 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:53,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:24:53,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:24:53,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:24:53,953 INFO L87 Difference]: Start difference. First operand 9850 states and 30173 transitions. Second operand 7 states. [2018-12-09 19:24:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:54,171 INFO L93 Difference]: Finished difference Result 11604 states and 35638 transitions. [2018-12-09 19:24:54,171 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:24:54,171 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-09 19:24:54,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:54,183 INFO L225 Difference]: With dead ends: 11604 [2018-12-09 19:24:54,183 INFO L226 Difference]: Without dead ends: 11604 [2018-12-09 19:24:54,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:24:54,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11604 states. [2018-12-09 19:24:54,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11604 to 10168. [2018-12-09 19:24:54,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10168 states. [2018-12-09 19:24:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10168 states to 10168 states and 31309 transitions. [2018-12-09 19:24:54,285 INFO L78 Accepts]: Start accepts. Automaton has 10168 states and 31309 transitions. Word has length 93 [2018-12-09 19:24:54,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:54,285 INFO L480 AbstractCegarLoop]: Abstraction has 10168 states and 31309 transitions. [2018-12-09 19:24:54,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:24:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 10168 states and 31309 transitions. [2018-12-09 19:24:54,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 19:24:54,294 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:54,294 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:54,294 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:54,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:54,295 INFO L82 PathProgramCache]: Analyzing trace with hash -2122120715, now seen corresponding path program 4 times [2018-12-09 19:24:54,295 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:54,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:54,296 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:54,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:54,296 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:24:54,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 19:24:54,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:24:54,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 19:24:54,379 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:24:54,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 19:24:54,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 19:24:54,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:24:54,379 INFO L87 Difference]: Start difference. First operand 10168 states and 31309 transitions. Second operand 11 states. [2018-12-09 19:24:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:24:54,963 INFO L93 Difference]: Finished difference Result 16380 states and 50496 transitions. [2018-12-09 19:24:54,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 19:24:54,963 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2018-12-09 19:24:54,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:24:54,973 INFO L225 Difference]: With dead ends: 16380 [2018-12-09 19:24:54,973 INFO L226 Difference]: Without dead ends: 10854 [2018-12-09 19:24:54,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-09 19:24:54,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10854 states. [2018-12-09 19:24:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10854 to 10078. [2018-12-09 19:24:55,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10078 states. [2018-12-09 19:24:55,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10078 states to 10078 states and 31061 transitions. [2018-12-09 19:24:55,068 INFO L78 Accepts]: Start accepts. Automaton has 10078 states and 31061 transitions. Word has length 93 [2018-12-09 19:24:55,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:24:55,068 INFO L480 AbstractCegarLoop]: Abstraction has 10078 states and 31061 transitions. [2018-12-09 19:24:55,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 19:24:55,068 INFO L276 IsEmpty]: Start isEmpty. Operand 10078 states and 31061 transitions. [2018-12-09 19:24:55,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-09 19:24:55,077 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:24:55,077 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 19:24:55,077 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:24:55,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:24:55,077 INFO L82 PathProgramCache]: Analyzing trace with hash 353298899, now seen corresponding path program 5 times [2018-12-09 19:24:55,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:24:55,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:55,078 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:24:55,078 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:24:55,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:24:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:24:55,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:24:55,112 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 19:24:55,182 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 19:24:55,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:24:55 BasicIcfg [2018-12-09 19:24:55,183 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:24:55,184 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:24:55,184 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:24:55,184 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:24:55,184 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:23:20" (3/4) ... [2018-12-09 19:24:55,186 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 19:24:55,259 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8943c3cb-8fc7-4491-8ce7-fa4f5d04d137/bin-2019/utaipan/witness.graphml [2018-12-09 19:24:55,259 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:24:55,259 INFO L168 Benchmark]: Toolchain (without parser) took 95221.57 ms. Allocated memory was 1.0 GB in the beginning and 7.1 GB in the end (delta: 6.1 GB). Free memory was 947.0 MB in the beginning and 5.0 GB in the end (delta: -4.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-12-09 19:24:55,260 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:24:55,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 341.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -151.7 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-12-09 19:24:55,261 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:24:55,261 INFO L168 Benchmark]: Boogie Preprocessor took 17.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:24:55,261 INFO L168 Benchmark]: RCFGBuilder took 319.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. [2018-12-09 19:24:55,261 INFO L168 Benchmark]: TraceAbstraction took 94433.22 ms. Allocated memory was 1.2 GB in the beginning and 7.1 GB in the end (delta: 6.0 GB). Free memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: -4.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-09 19:24:55,261 INFO L168 Benchmark]: Witness Printer took 75.32 ms. Allocated memory is still 7.1 GB. Free memory was 5.1 GB in the beginning and 5.0 GB in the end (delta: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. [2018-12-09 19:24:55,262 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 341.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -151.7 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 319.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 94433.22 ms. Allocated memory was 1.2 GB in the beginning and 7.1 GB in the end (delta: 6.0 GB). Free memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: -4.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 75.32 ms. Allocated memory is still 7.1 GB. Free memory was 5.1 GB in the beginning and 5.0 GB in the end (delta: 58.6 MB). Peak memory consumption was 58.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L676] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L678] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L680] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L692] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L693] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L694] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L695] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L696] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] -1 pthread_t t1012; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] FCALL, FORK -1 pthread_create(&t1012, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] -1 pthread_t t1013; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] FCALL, FORK -1 pthread_create(&t1013, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] -1 pthread_t t1014; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] FCALL, FORK -1 pthread_create(&t1014, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L753] 0 y$w_buff1 = y$w_buff0 [L754] 0 y$w_buff0 = 1 [L755] 0 y$w_buff1_used = y$w_buff0_used [L756] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L758] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L759] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L760] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L761] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L762] 0 y$r_buff0_thd3 = (_Bool)1 [L765] 0 z = 1 [L768] 0 __unbuffered_p2_EAX = z [L771] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 x = 1 [L718] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 2 x = 2 [L728] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L729] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L730] 2 y$flush_delayed = weak$$choice2 [L731] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L775] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L776] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L776] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L733] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L734] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L735] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L736] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L738] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 2 y = y$flush_delayed ? y$mem_tmp : y [L741] 2 y$flush_delayed = (_Bool)0 [L746] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L778] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L781] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L808] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L811] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L814] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 219 locations, 3 error locations. UNSAFE Result, 94.3s OverallTime, 26 OverallIterations, 1 TraceHistogramMax, 27.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6775 SDtfs, 8732 SDslu, 18358 SDs, 0 SdLazy, 6332 SolverSat, 322 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 251 GetRequests, 66 SyntacticMatches, 13 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=273285occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 44.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 584007 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2075 NumberOfCodeBlocks, 2075 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1957 ConstructedInterpolants, 0 QuantifiedInterpolants, 413143 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...