./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix009_tso.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_1071e7c4-0938-4a47-baf9-221a9ec0b26b/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1071e7c4-0938-4a47-baf9-221a9ec0b26b/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1071e7c4-0938-4a47-baf9-221a9ec0b26b/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1071e7c4-0938-4a47-baf9-221a9ec0b26b/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1071e7c4-0938-4a47-baf9-221a9ec0b26b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1071e7c4-0938-4a47-baf9-221a9ec0b26b/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 8fe5e58ec9f352bfe46fb7ebe65bde5cd00b1134 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-01 22:00:04,586 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 22:00:04,587 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 22:00:04,593 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 22:00:04,594 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 22:00:04,594 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 22:00:04,595 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 22:00:04,596 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 22:00:04,597 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 22:00:04,597 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 22:00:04,597 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 22:00:04,598 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 22:00:04,598 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 22:00:04,599 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 22:00:04,599 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 22:00:04,600 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 22:00:04,600 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 22:00:04,601 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 22:00:04,602 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 22:00:04,603 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 22:00:04,603 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 22:00:04,604 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 22:00:04,605 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 22:00:04,605 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 22:00:04,606 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 22:00:04,606 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 22:00:04,607 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 22:00:04,607 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 22:00:04,607 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 22:00:04,608 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 22:00:04,608 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 22:00:04,608 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 22:00:04,609 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 22:00:04,609 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 22:00:04,609 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 22:00:04,610 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 22:00:04,610 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1071e7c4-0938-4a47-baf9-221a9ec0b26b/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-01 22:00:04,617 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 22:00:04,617 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 22:00:04,618 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-01 22:00:04,618 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-01 22:00:04,618 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-01 22:00:04,618 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-01 22:00:04,619 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-01 22:00:04,619 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-01 22:00:04,619 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-01 22:00:04,619 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-01 22:00:04,619 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-01 22:00:04,619 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-01 22:00:04,619 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-01 22:00:04,620 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 22:00:04,620 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 22:00:04,620 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 22:00:04,620 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 22:00:04,620 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 22:00:04,620 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-01 22:00:04,621 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-01 22:00:04,621 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-01 22:00:04,621 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 22:00:04,621 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 22:00:04,621 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-01 22:00:04,621 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 22:00:04,621 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 22:00:04,621 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-01 22:00:04,621 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-01 22:00:04,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-01 22:00:04,622 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 22:00:04,622 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-01 22:00:04,622 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-01 22:00:04,622 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-01 22:00:04,622 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-01 22:00:04,622 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-01 22:00:04,622 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-01 22:00:04,622 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_1071e7c4-0938-4a47-baf9-221a9ec0b26b/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 -> 8fe5e58ec9f352bfe46fb7ebe65bde5cd00b1134 [2018-12-01 22:00:04,640 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 22:00:04,647 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 22:00:04,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 22:00:04,650 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 22:00:04,650 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 22:00:04,651 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1071e7c4-0938-4a47-baf9-221a9ec0b26b/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix009_tso.opt_false-unreach-call.i [2018-12-01 22:00:04,689 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1071e7c4-0938-4a47-baf9-221a9ec0b26b/bin-2019/utaipan/data/31959f5a4/4c7921ab65df4d2fa3c21a85c19aefa7/FLAG21d3f15e6 [2018-12-01 22:00:05,116 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 22:00:05,116 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1071e7c4-0938-4a47-baf9-221a9ec0b26b/sv-benchmarks/c/pthread-wmm/mix009_tso.opt_false-unreach-call.i [2018-12-01 22:00:05,124 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1071e7c4-0938-4a47-baf9-221a9ec0b26b/bin-2019/utaipan/data/31959f5a4/4c7921ab65df4d2fa3c21a85c19aefa7/FLAG21d3f15e6 [2018-12-01 22:00:05,132 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1071e7c4-0938-4a47-baf9-221a9ec0b26b/bin-2019/utaipan/data/31959f5a4/4c7921ab65df4d2fa3c21a85c19aefa7 [2018-12-01 22:00:05,133 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 22:00:05,134 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 22:00:05,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 22:00:05,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 22:00:05,137 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 22:00:05,137 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:00:05" (1/1) ... [2018-12-01 22:00:05,139 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:00:05, skipping insertion in model container [2018-12-01 22:00:05,139 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 10:00:05" (1/1) ... [2018-12-01 22:00:05,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 22:00:05,168 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 22:00:05,377 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:00:05,384 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 22:00:05,471 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 22:00:05,501 INFO L195 MainTranslator]: Completed translation [2018-12-01 22:00:05,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:00:05 WrapperNode [2018-12-01 22:00:05,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 22:00:05,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 22:00:05,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 22:00:05,502 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 22:00:05,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:00:05" (1/1) ... [2018-12-01 22:00:05,517 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:00:05" (1/1) ... [2018-12-01 22:00:05,534 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 22:00:05,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 22:00:05,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 22:00:05,534 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 22:00:05,540 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:00:05" (1/1) ... [2018-12-01 22:00:05,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:00:05" (1/1) ... [2018-12-01 22:00:05,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:00:05" (1/1) ... [2018-12-01 22:00:05,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:00:05" (1/1) ... [2018-12-01 22:00:05,548 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:00:05" (1/1) ... [2018-12-01 22:00:05,550 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:00:05" (1/1) ... [2018-12-01 22:00:05,551 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:00:05" (1/1) ... [2018-12-01 22:00:05,553 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 22:00:05,554 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 22:00:05,554 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 22:00:05,554 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 22:00:05,554 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:00:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1071e7c4-0938-4a47-baf9-221a9ec0b26b/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-01 22:00:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-01 22:00:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-01 22:00:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-01 22:00:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-01 22:00:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-01 22:00:05,586 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-01 22:00:05,586 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-01 22:00:05,587 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-01 22:00:05,587 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-01 22:00:05,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 22:00:05,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 22:00:05,588 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-01 22:00:05,922 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 22:00:05,923 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-01 22:00:05,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:00:05 BoogieIcfgContainer [2018-12-01 22:00:05,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 22:00:05,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-01 22:00:05,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-01 22:00:05,925 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-01 22:00:05,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 10:00:05" (1/3) ... [2018-12-01 22:00:05,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f8ac1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:00:05, skipping insertion in model container [2018-12-01 22:00:05,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 10:00:05" (2/3) ... [2018-12-01 22:00:05,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46f8ac1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 10:00:05, skipping insertion in model container [2018-12-01 22:00:05,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:00:05" (3/3) ... [2018-12-01 22:00:05,927 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009_tso.opt_false-unreach-call.i [2018-12-01 22:00:05,952 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,953 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,953 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,953 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,953 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,953 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,953 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,953 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,953 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,954 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,954 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,954 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,954 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,954 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,954 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,954 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,954 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,954 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,954 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,955 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,955 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,955 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,955 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,955 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,955 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,955 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,955 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,955 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,955 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,955 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,956 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,956 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,956 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,956 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,956 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,956 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,956 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,956 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,956 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,956 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,957 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,957 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,957 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,957 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,957 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,957 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,957 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,957 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,957 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,957 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,957 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,958 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,958 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,958 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,958 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,958 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,958 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,958 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,958 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,958 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,958 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,958 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,958 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,959 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,959 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,959 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,959 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,959 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,959 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,959 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,959 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,959 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,959 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,959 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,960 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,960 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,960 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,960 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,960 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,960 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,960 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,960 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,960 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,960 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,960 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,961 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,961 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,961 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,961 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,961 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,961 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,961 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,961 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,961 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,961 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,961 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,962 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,962 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,963 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,963 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,963 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,963 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,963 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,963 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,964 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,965 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,966 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,967 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,968 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,969 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,970 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-01 22:00:05,978 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-01 22:00:05,978 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-01 22:00:05,985 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-01 22:00:05,996 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-01 22:00:06,010 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-01 22:00:06,010 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-01 22:00:06,011 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-01 22:00:06,011 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 22:00:06,011 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 22:00:06,011 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-01 22:00:06,011 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 22:00:06,011 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-01 22:00:06,018 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 175places, 228 transitions [2018-12-01 22:00:11,503 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83129 states. [2018-12-01 22:00:11,505 INFO L276 IsEmpty]: Start isEmpty. Operand 83129 states. [2018-12-01 22:00:11,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-01 22:00:11,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:11,511 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] [2018-12-01 22:00:11,512 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:11,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:11,516 INFO L82 PathProgramCache]: Analyzing trace with hash 459405505, now seen corresponding path program 1 times [2018-12-01 22:00:11,517 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:11,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:11,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:00:11,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:11,553 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:11,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:11,671 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-01 22:00:11,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:11,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:00:11,672 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:11,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:00:11,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:00:11,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:00:11,686 INFO L87 Difference]: Start difference. First operand 83129 states. Second operand 4 states. [2018-12-01 22:00:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:12,550 INFO L93 Difference]: Finished difference Result 150585 states and 603162 transitions. [2018-12-01 22:00:12,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:00:12,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2018-12-01 22:00:12,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:12,919 INFO L225 Difference]: With dead ends: 150585 [2018-12-01 22:00:12,919 INFO L226 Difference]: Without dead ends: 105841 [2018-12-01 22:00:12,920 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-01 22:00:14,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105841 states. [2018-12-01 22:00:15,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105841 to 61237. [2018-12-01 22:00:15,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61237 states. [2018-12-01 22:00:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61237 states to 61237 states and 248292 transitions. [2018-12-01 22:00:15,186 INFO L78 Accepts]: Start accepts. Automaton has 61237 states and 248292 transitions. Word has length 40 [2018-12-01 22:00:15,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:15,186 INFO L480 AbstractCegarLoop]: Abstraction has 61237 states and 248292 transitions. [2018-12-01 22:00:15,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:00:15,186 INFO L276 IsEmpty]: Start isEmpty. Operand 61237 states and 248292 transitions. [2018-12-01 22:00:15,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-01 22:00:15,191 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:15,191 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] [2018-12-01 22:00:15,192 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:15,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:15,192 INFO L82 PathProgramCache]: Analyzing trace with hash -465402434, now seen corresponding path program 1 times [2018-12-01 22:00:15,192 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:15,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:15,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:00:15,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:15,195 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:15,235 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-01 22:00:15,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:15,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:00:15,235 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:15,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:00:15,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:00:15,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:00:15,236 INFO L87 Difference]: Start difference. First operand 61237 states and 248292 transitions. Second operand 4 states. [2018-12-01 22:00:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:15,328 INFO L93 Difference]: Finished difference Result 14311 states and 48365 transitions. [2018-12-01 22:00:15,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:00:15,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-01 22:00:15,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:15,354 INFO L225 Difference]: With dead ends: 14311 [2018-12-01 22:00:15,354 INFO L226 Difference]: Without dead ends: 11491 [2018-12-01 22:00:15,354 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-01 22:00:15,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11491 states. [2018-12-01 22:00:15,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11491 to 11491. [2018-12-01 22:00:15,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11491 states. [2018-12-01 22:00:15,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11491 states to 11491 states and 37856 transitions. [2018-12-01 22:00:15,483 INFO L78 Accepts]: Start accepts. Automaton has 11491 states and 37856 transitions. Word has length 48 [2018-12-01 22:00:15,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:15,483 INFO L480 AbstractCegarLoop]: Abstraction has 11491 states and 37856 transitions. [2018-12-01 22:00:15,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:00:15,483 INFO L276 IsEmpty]: Start isEmpty. Operand 11491 states and 37856 transitions. [2018-12-01 22:00:15,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-01 22:00:15,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:15,484 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] [2018-12-01 22:00:15,484 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:15,484 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:15,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1761930056, now seen corresponding path program 1 times [2018-12-01 22:00:15,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:15,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:15,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:00:15,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:15,487 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:15,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:15,526 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-01 22:00:15,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:15,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:00:15,526 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:15,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:00:15,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:00:15,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:00:15,526 INFO L87 Difference]: Start difference. First operand 11491 states and 37856 transitions. Second operand 5 states. [2018-12-01 22:00:15,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:15,828 INFO L93 Difference]: Finished difference Result 23361 states and 75857 transitions. [2018-12-01 22:00:15,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 22:00:15,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-01 22:00:15,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:15,862 INFO L225 Difference]: With dead ends: 23361 [2018-12-01 22:00:15,862 INFO L226 Difference]: Without dead ends: 23286 [2018-12-01 22:00:15,862 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-01 22:00:15,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23286 states. [2018-12-01 22:00:16,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23286 to 15418. [2018-12-01 22:00:16,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15418 states. [2018-12-01 22:00:16,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15418 states to 15418 states and 49311 transitions. [2018-12-01 22:00:16,158 INFO L78 Accepts]: Start accepts. Automaton has 15418 states and 49311 transitions. Word has length 49 [2018-12-01 22:00:16,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:16,159 INFO L480 AbstractCegarLoop]: Abstraction has 15418 states and 49311 transitions. [2018-12-01 22:00:16,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:00:16,159 INFO L276 IsEmpty]: Start isEmpty. Operand 15418 states and 49311 transitions. [2018-12-01 22:00:16,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-01 22:00:16,160 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:16,160 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] [2018-12-01 22:00:16,160 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:16,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:16,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1880248814, now seen corresponding path program 1 times [2018-12-01 22:00:16,161 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:16,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:16,162 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:00:16,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:16,162 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:16,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:16,182 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-01 22:00:16,182 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:16,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:00:16,182 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:16,183 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:00:16,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:00:16,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:00:16,183 INFO L87 Difference]: Start difference. First operand 15418 states and 49311 transitions. Second operand 3 states. [2018-12-01 22:00:16,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:16,284 INFO L93 Difference]: Finished difference Result 28678 states and 90549 transitions. [2018-12-01 22:00:16,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:00:16,285 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-01 22:00:16,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:16,321 INFO L225 Difference]: With dead ends: 28678 [2018-12-01 22:00:16,321 INFO L226 Difference]: Without dead ends: 28674 [2018-12-01 22:00:16,321 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-01 22:00:16,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28674 states. [2018-12-01 22:00:16,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28674 to 24153. [2018-12-01 22:00:16,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24153 states. [2018-12-01 22:00:16,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24153 states to 24153 states and 76317 transitions. [2018-12-01 22:00:16,607 INFO L78 Accepts]: Start accepts. Automaton has 24153 states and 76317 transitions. Word has length 51 [2018-12-01 22:00:16,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:16,607 INFO L480 AbstractCegarLoop]: Abstraction has 24153 states and 76317 transitions. [2018-12-01 22:00:16,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:00:16,607 INFO L276 IsEmpty]: Start isEmpty. Operand 24153 states and 76317 transitions. [2018-12-01 22:00:16,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-01 22:00:16,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:16,609 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-01 22:00:16,609 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:16,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:16,610 INFO L82 PathProgramCache]: Analyzing trace with hash 832863033, now seen corresponding path program 1 times [2018-12-01 22:00:16,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:16,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:16,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:00:16,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:16,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:16,665 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-01 22:00:16,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:16,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 22:00:16,666 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:16,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 22:00:16,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 22:00:16,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:00:16,666 INFO L87 Difference]: Start difference. First operand 24153 states and 76317 transitions. Second operand 6 states. [2018-12-01 22:00:17,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:17,076 INFO L93 Difference]: Finished difference Result 33839 states and 105315 transitions. [2018-12-01 22:00:17,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 22:00:17,077 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-01 22:00:17,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:17,117 INFO L225 Difference]: With dead ends: 33839 [2018-12-01 22:00:17,117 INFO L226 Difference]: Without dead ends: 33742 [2018-12-01 22:00:17,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-01 22:00:17,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33742 states. [2018-12-01 22:00:17,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33742 to 23974. [2018-12-01 22:00:17,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23974 states. [2018-12-01 22:00:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23974 states to 23974 states and 75823 transitions. [2018-12-01 22:00:17,424 INFO L78 Accepts]: Start accepts. Automaton has 23974 states and 75823 transitions. Word has length 55 [2018-12-01 22:00:17,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:17,424 INFO L480 AbstractCegarLoop]: Abstraction has 23974 states and 75823 transitions. [2018-12-01 22:00:17,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 22:00:17,424 INFO L276 IsEmpty]: Start isEmpty. Operand 23974 states and 75823 transitions. [2018-12-01 22:00:17,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-01 22:00:17,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:17,430 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] [2018-12-01 22:00:17,430 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:17,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:17,430 INFO L82 PathProgramCache]: Analyzing trace with hash 974144113, now seen corresponding path program 1 times [2018-12-01 22:00:17,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:17,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:17,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:00:17,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:17,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:17,485 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-01 22:00:17,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:17,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:00:17,485 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:17,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:00:17,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:00:17,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:00:17,486 INFO L87 Difference]: Start difference. First operand 23974 states and 75823 transitions. Second operand 4 states. [2018-12-01 22:00:17,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:17,680 INFO L93 Difference]: Finished difference Result 30738 states and 97933 transitions. [2018-12-01 22:00:17,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:00:17,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-01 22:00:17,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:17,723 INFO L225 Difference]: With dead ends: 30738 [2018-12-01 22:00:17,723 INFO L226 Difference]: Without dead ends: 30738 [2018-12-01 22:00:17,723 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-01 22:00:17,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30738 states. [2018-12-01 22:00:18,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30738 to 27610. [2018-12-01 22:00:18,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27610 states. [2018-12-01 22:00:18,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27610 states to 27610 states and 87451 transitions. [2018-12-01 22:00:18,144 INFO L78 Accepts]: Start accepts. Automaton has 27610 states and 87451 transitions. Word has length 65 [2018-12-01 22:00:18,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:18,144 INFO L480 AbstractCegarLoop]: Abstraction has 27610 states and 87451 transitions. [2018-12-01 22:00:18,144 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:00:18,144 INFO L276 IsEmpty]: Start isEmpty. Operand 27610 states and 87451 transitions. [2018-12-01 22:00:18,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-01 22:00:18,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:18,149 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] [2018-12-01 22:00:18,149 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:18,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:18,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1578012848, now seen corresponding path program 1 times [2018-12-01 22:00:18,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:18,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:18,151 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:00:18,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:18,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:18,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:18,186 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-01 22:00:18,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:18,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:00:18,187 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:18,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:00:18,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:00:18,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:00:18,188 INFO L87 Difference]: Start difference. First operand 27610 states and 87451 transitions. Second operand 5 states. [2018-12-01 22:00:18,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:18,237 INFO L93 Difference]: Finished difference Result 10334 states and 27418 transitions. [2018-12-01 22:00:18,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 22:00:18,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-01 22:00:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:18,244 INFO L225 Difference]: With dead ends: 10334 [2018-12-01 22:00:18,245 INFO L226 Difference]: Without dead ends: 8706 [2018-12-01 22:00:18,245 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-01 22:00:18,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8706 states. [2018-12-01 22:00:18,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8706 to 7459. [2018-12-01 22:00:18,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7459 states. [2018-12-01 22:00:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7459 states to 7459 states and 19347 transitions. [2018-12-01 22:00:18,312 INFO L78 Accepts]: Start accepts. Automaton has 7459 states and 19347 transitions. Word has length 65 [2018-12-01 22:00:18,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:18,312 INFO L480 AbstractCegarLoop]: Abstraction has 7459 states and 19347 transitions. [2018-12-01 22:00:18,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:00:18,312 INFO L276 IsEmpty]: Start isEmpty. Operand 7459 states and 19347 transitions. [2018-12-01 22:00:18,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 22:00:18,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:18,319 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:00:18,319 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:18,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:18,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1002193287, now seen corresponding path program 1 times [2018-12-01 22:00:18,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:18,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:18,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:00:18,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:18,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:18,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:18,355 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-01 22:00:18,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:18,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:00:18,355 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:18,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:00:18,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:00:18,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:00:18,356 INFO L87 Difference]: Start difference. First operand 7459 states and 19347 transitions. Second operand 4 states. [2018-12-01 22:00:18,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:18,562 INFO L93 Difference]: Finished difference Result 14929 states and 36703 transitions. [2018-12-01 22:00:18,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:00:18,563 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-01 22:00:18,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:18,574 INFO L225 Difference]: With dead ends: 14929 [2018-12-01 22:00:18,574 INFO L226 Difference]: Without dead ends: 14929 [2018-12-01 22:00:18,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-01 22:00:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14929 states. [2018-12-01 22:00:18,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14929 to 11547. [2018-12-01 22:00:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11547 states. [2018-12-01 22:00:18,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11547 states to 11547 states and 29056 transitions. [2018-12-01 22:00:18,689 INFO L78 Accepts]: Start accepts. Automaton has 11547 states and 29056 transitions. Word has length 100 [2018-12-01 22:00:18,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:18,689 INFO L480 AbstractCegarLoop]: Abstraction has 11547 states and 29056 transitions. [2018-12-01 22:00:18,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:00:18,689 INFO L276 IsEmpty]: Start isEmpty. Operand 11547 states and 29056 transitions. [2018-12-01 22:00:18,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 22:00:18,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:18,700 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:00:18,700 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:18,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:18,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1331959048, now seen corresponding path program 1 times [2018-12-01 22:00:18,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:18,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:18,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:00:18,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:18,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:18,741 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-01 22:00:18,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:18,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:00:18,742 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:18,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:00:18,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:00:18,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:00:18,742 INFO L87 Difference]: Start difference. First operand 11547 states and 29056 transitions. Second operand 4 states. [2018-12-01 22:00:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:18,851 INFO L93 Difference]: Finished difference Result 11851 states and 29864 transitions. [2018-12-01 22:00:18,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-01 22:00:18,851 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-01 22:00:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:18,860 INFO L225 Difference]: With dead ends: 11851 [2018-12-01 22:00:18,860 INFO L226 Difference]: Without dead ends: 11851 [2018-12-01 22:00:18,861 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-01 22:00:18,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11851 states. [2018-12-01 22:00:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11851 to 11643. [2018-12-01 22:00:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11643 states. [2018-12-01 22:00:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11643 states to 11643 states and 29328 transitions. [2018-12-01 22:00:18,957 INFO L78 Accepts]: Start accepts. Automaton has 11643 states and 29328 transitions. Word has length 100 [2018-12-01 22:00:18,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:18,957 INFO L480 AbstractCegarLoop]: Abstraction has 11643 states and 29328 transitions. [2018-12-01 22:00:18,957 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:00:18,957 INFO L276 IsEmpty]: Start isEmpty. Operand 11643 states and 29328 transitions. [2018-12-01 22:00:18,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 22:00:18,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:18,968 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:00:18,968 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:18,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:18,968 INFO L82 PathProgramCache]: Analyzing trace with hash -475495415, now seen corresponding path program 1 times [2018-12-01 22:00:18,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:18,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:18,970 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:00:18,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:18,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:19,053 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-01 22:00:19,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:19,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-01 22:00:19,054 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:19,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-01 22:00:19,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-01 22:00:19,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-01 22:00:19,054 INFO L87 Difference]: Start difference. First operand 11643 states and 29328 transitions. Second operand 7 states. [2018-12-01 22:00:19,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:19,440 INFO L93 Difference]: Finished difference Result 16074 states and 39733 transitions. [2018-12-01 22:00:19,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-01 22:00:19,440 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-01 22:00:19,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:19,453 INFO L225 Difference]: With dead ends: 16074 [2018-12-01 22:00:19,453 INFO L226 Difference]: Without dead ends: 16074 [2018-12-01 22:00:19,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-01 22:00:19,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16074 states. [2018-12-01 22:00:19,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16074 to 13506. [2018-12-01 22:00:19,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13506 states. [2018-12-01 22:00:19,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13506 states to 13506 states and 33955 transitions. [2018-12-01 22:00:19,585 INFO L78 Accepts]: Start accepts. Automaton has 13506 states and 33955 transitions. Word has length 100 [2018-12-01 22:00:19,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:19,585 INFO L480 AbstractCegarLoop]: Abstraction has 13506 states and 33955 transitions. [2018-12-01 22:00:19,585 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-01 22:00:19,586 INFO L276 IsEmpty]: Start isEmpty. Operand 13506 states and 33955 transitions. [2018-12-01 22:00:19,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 22:00:19,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:19,598 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:00:19,598 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:19,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:19,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1249985482, now seen corresponding path program 1 times [2018-12-01 22:00:19,599 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:19,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:19,600 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:00:19,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:19,600 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:19,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:19,644 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-01 22:00:19,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:19,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:00:19,644 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:19,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:00:19,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:00:19,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:00:19,645 INFO L87 Difference]: Start difference. First operand 13506 states and 33955 transitions. Second operand 5 states. [2018-12-01 22:00:19,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:19,872 INFO L93 Difference]: Finished difference Result 18063 states and 44112 transitions. [2018-12-01 22:00:19,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 22:00:19,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-01 22:00:19,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:19,886 INFO L225 Difference]: With dead ends: 18063 [2018-12-01 22:00:19,886 INFO L226 Difference]: Without dead ends: 18063 [2018-12-01 22:00:19,886 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-01 22:00:19,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18063 states. [2018-12-01 22:00:20,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18063 to 15125. [2018-12-01 22:00:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15125 states. [2018-12-01 22:00:20,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15125 states to 15125 states and 37602 transitions. [2018-12-01 22:00:20,028 INFO L78 Accepts]: Start accepts. Automaton has 15125 states and 37602 transitions. Word has length 100 [2018-12-01 22:00:20,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:20,029 INFO L480 AbstractCegarLoop]: Abstraction has 15125 states and 37602 transitions. [2018-12-01 22:00:20,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:00:20,029 INFO L276 IsEmpty]: Start isEmpty. Operand 15125 states and 37602 transitions. [2018-12-01 22:00:20,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-01 22:00:20,042 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:20,042 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, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:00:20,042 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:20,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:20,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1503291686, now seen corresponding path program 2 times [2018-12-01 22:00:20,043 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:20,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:20,044 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:00:20,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:20,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:20,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:20,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-01 22:00:20,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:20,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 22:00:20,193 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:20,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 22:00:20,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 22:00:20,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:00:20,193 INFO L87 Difference]: Start difference. First operand 15125 states and 37602 transitions. Second operand 6 states. [2018-12-01 22:00:20,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:20,336 INFO L93 Difference]: Finished difference Result 15045 states and 37258 transitions. [2018-12-01 22:00:20,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-01 22:00:20,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-01 22:00:20,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:20,353 INFO L225 Difference]: With dead ends: 15045 [2018-12-01 22:00:20,353 INFO L226 Difference]: Without dead ends: 15045 [2018-12-01 22:00:20,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-01 22:00:20,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15045 states. [2018-12-01 22:00:20,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15045 to 13753. [2018-12-01 22:00:20,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13753 states. [2018-12-01 22:00:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13753 states to 13753 states and 34312 transitions. [2018-12-01 22:00:20,479 INFO L78 Accepts]: Start accepts. Automaton has 13753 states and 34312 transitions. Word has length 100 [2018-12-01 22:00:20,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:20,479 INFO L480 AbstractCegarLoop]: Abstraction has 13753 states and 34312 transitions. [2018-12-01 22:00:20,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 22:00:20,479 INFO L276 IsEmpty]: Start isEmpty. Operand 13753 states and 34312 transitions. [2018-12-01 22:00:20,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 22:00:20,489 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:20,489 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:00:20,489 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:20,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:20,489 INFO L82 PathProgramCache]: Analyzing trace with hash 2002150678, now seen corresponding path program 1 times [2018-12-01 22:00:20,489 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:20,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:20,491 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:00:20,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:20,491 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:20,609 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-01 22:00:20,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:20,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 22:00:20,610 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:20,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 22:00:20,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 22:00:20,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-01 22:00:20,610 INFO L87 Difference]: Start difference. First operand 13753 states and 34312 transitions. Second operand 8 states. [2018-12-01 22:00:20,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:20,909 INFO L93 Difference]: Finished difference Result 15795 states and 38746 transitions. [2018-12-01 22:00:20,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-01 22:00:20,910 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2018-12-01 22:00:20,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:20,921 INFO L225 Difference]: With dead ends: 15795 [2018-12-01 22:00:20,921 INFO L226 Difference]: Without dead ends: 15795 [2018-12-01 22:00:20,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-01 22:00:20,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15795 states. [2018-12-01 22:00:21,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15795 to 14771. [2018-12-01 22:00:21,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14771 states. [2018-12-01 22:00:21,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14771 states to 14771 states and 36565 transitions. [2018-12-01 22:00:21,051 INFO L78 Accepts]: Start accepts. Automaton has 14771 states and 36565 transitions. Word has length 102 [2018-12-01 22:00:21,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:21,051 INFO L480 AbstractCegarLoop]: Abstraction has 14771 states and 36565 transitions. [2018-12-01 22:00:21,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 22:00:21,051 INFO L276 IsEmpty]: Start isEmpty. Operand 14771 states and 36565 transitions. [2018-12-01 22:00:21,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 22:00:21,062 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:21,062 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:00:21,063 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:21,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:21,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1405312937, now seen corresponding path program 1 times [2018-12-01 22:00:21,063 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:21,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:21,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:00:21,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:21,064 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:21,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:21,098 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-01 22:00:21,098 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:21,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 22:00:21,098 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:21,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-01 22:00:21,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 22:00:21,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 22:00:21,099 INFO L87 Difference]: Start difference. First operand 14771 states and 36565 transitions. Second operand 3 states. [2018-12-01 22:00:21,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:21,145 INFO L93 Difference]: Finished difference Result 19038 states and 47103 transitions. [2018-12-01 22:00:21,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 22:00:21,146 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2018-12-01 22:00:21,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:21,160 INFO L225 Difference]: With dead ends: 19038 [2018-12-01 22:00:21,160 INFO L226 Difference]: Without dead ends: 19038 [2018-12-01 22:00:21,160 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-01 22:00:21,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19038 states. [2018-12-01 22:00:21,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19038 to 18955. [2018-12-01 22:00:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18955 states. [2018-12-01 22:00:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18955 states to 18955 states and 46924 transitions. [2018-12-01 22:00:21,325 INFO L78 Accepts]: Start accepts. Automaton has 18955 states and 46924 transitions. Word has length 102 [2018-12-01 22:00:21,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:21,325 INFO L480 AbstractCegarLoop]: Abstraction has 18955 states and 46924 transitions. [2018-12-01 22:00:21,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-01 22:00:21,325 INFO L276 IsEmpty]: Start isEmpty. Operand 18955 states and 46924 transitions. [2018-12-01 22:00:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 22:00:21,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:21,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:00:21,347 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:21,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:21,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1193962024, now seen corresponding path program 1 times [2018-12-01 22:00:21,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:21,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:21,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:00:21,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:21,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:21,406 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-01 22:00:21,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:21,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 22:00:21,407 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:21,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-01 22:00:21,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 22:00:21,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:00:21,407 INFO L87 Difference]: Start difference. First operand 18955 states and 46924 transitions. Second operand 4 states. [2018-12-01 22:00:21,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:21,597 INFO L93 Difference]: Finished difference Result 19455 states and 47839 transitions. [2018-12-01 22:00:21,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 22:00:21,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2018-12-01 22:00:21,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:21,613 INFO L225 Difference]: With dead ends: 19455 [2018-12-01 22:00:21,613 INFO L226 Difference]: Without dead ends: 19455 [2018-12-01 22:00:21,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 22:00:21,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19455 states. [2018-12-01 22:00:21,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19455 to 19132. [2018-12-01 22:00:21,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19132 states. [2018-12-01 22:00:21,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19132 states to 19132 states and 47144 transitions. [2018-12-01 22:00:21,764 INFO L78 Accepts]: Start accepts. Automaton has 19132 states and 47144 transitions. Word has length 102 [2018-12-01 22:00:21,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:21,764 INFO L480 AbstractCegarLoop]: Abstraction has 19132 states and 47144 transitions. [2018-12-01 22:00:21,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-01 22:00:21,764 INFO L276 IsEmpty]: Start isEmpty. Operand 19132 states and 47144 transitions. [2018-12-01 22:00:21,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 22:00:21,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:21,779 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:00:21,779 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:21,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:21,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1478572905, now seen corresponding path program 2 times [2018-12-01 22:00:21,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:21,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:21,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:00:21,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:21,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:21,823 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-01 22:00:21,823 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:21,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:00:21,824 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:21,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:00:21,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:00:21,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:00:21,824 INFO L87 Difference]: Start difference. First operand 19132 states and 47144 transitions. Second operand 5 states. [2018-12-01 22:00:22,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:22,041 INFO L93 Difference]: Finished difference Result 19768 states and 48491 transitions. [2018-12-01 22:00:22,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 22:00:22,041 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-01 22:00:22,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:22,056 INFO L225 Difference]: With dead ends: 19768 [2018-12-01 22:00:22,056 INFO L226 Difference]: Without dead ends: 19768 [2018-12-01 22:00:22,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:00:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19768 states. [2018-12-01 22:00:22,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19768 to 19132. [2018-12-01 22:00:22,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19132 states. [2018-12-01 22:00:22,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19132 states to 19132 states and 47136 transitions. [2018-12-01 22:00:22,209 INFO L78 Accepts]: Start accepts. Automaton has 19132 states and 47136 transitions. Word has length 102 [2018-12-01 22:00:22,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:22,209 INFO L480 AbstractCegarLoop]: Abstraction has 19132 states and 47136 transitions. [2018-12-01 22:00:22,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:00:22,210 INFO L276 IsEmpty]: Start isEmpty. Operand 19132 states and 47136 transitions. [2018-12-01 22:00:22,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 22:00:22,222 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:22,223 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:00:22,223 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:22,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:22,223 INFO L82 PathProgramCache]: Analyzing trace with hash 405390625, now seen corresponding path program 3 times [2018-12-01 22:00:22,223 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:22,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:22,224 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:00:22,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:22,224 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:22,277 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-01 22:00:22,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:22,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-01 22:00:22,277 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:22,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-01 22:00:22,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-01 22:00:22,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-01 22:00:22,277 INFO L87 Difference]: Start difference. First operand 19132 states and 47136 transitions. Second operand 6 states. [2018-12-01 22:00:22,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:22,599 INFO L93 Difference]: Finished difference Result 22653 states and 55732 transitions. [2018-12-01 22:00:22,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-01 22:00:22,599 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-01 22:00:22,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:22,618 INFO L225 Difference]: With dead ends: 22653 [2018-12-01 22:00:22,618 INFO L226 Difference]: Without dead ends: 22653 [2018-12-01 22:00:22,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-01 22:00:22,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22653 states. [2018-12-01 22:00:22,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22653 to 19426. [2018-12-01 22:00:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19426 states. [2018-12-01 22:00:22,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19426 states to 19426 states and 47863 transitions. [2018-12-01 22:00:22,799 INFO L78 Accepts]: Start accepts. Automaton has 19426 states and 47863 transitions. Word has length 102 [2018-12-01 22:00:22,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:22,799 INFO L480 AbstractCegarLoop]: Abstraction has 19426 states and 47863 transitions. [2018-12-01 22:00:22,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-01 22:00:22,799 INFO L276 IsEmpty]: Start isEmpty. Operand 19426 states and 47863 transitions. [2018-12-01 22:00:22,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-01 22:00:22,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:22,813 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:00:22,813 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:22,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:22,813 INFO L82 PathProgramCache]: Analyzing trace with hash 2066029025, now seen corresponding path program 4 times [2018-12-01 22:00:22,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:22,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:22,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:00:22,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:22,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:22,899 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-01 22:00:22,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:22,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-01 22:00:22,899 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:22,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-01 22:00:22,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-01 22:00:22,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-01 22:00:22,900 INFO L87 Difference]: Start difference. First operand 19426 states and 47863 transitions. Second operand 5 states. [2018-12-01 22:00:23,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:23,085 INFO L93 Difference]: Finished difference Result 21059 states and 51384 transitions. [2018-12-01 22:00:23,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-01 22:00:23,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-01 22:00:23,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:23,102 INFO L225 Difference]: With dead ends: 21059 [2018-12-01 22:00:23,102 INFO L226 Difference]: Without dead ends: 21059 [2018-12-01 22:00:23,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-01 22:00:23,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21059 states. [2018-12-01 22:00:23,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21059 to 20069. [2018-12-01 22:00:23,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20069 states. [2018-12-01 22:00:23,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20069 states to 20069 states and 49247 transitions. [2018-12-01 22:00:23,284 INFO L78 Accepts]: Start accepts. Automaton has 20069 states and 49247 transitions. Word has length 102 [2018-12-01 22:00:23,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:23,284 INFO L480 AbstractCegarLoop]: Abstraction has 20069 states and 49247 transitions. [2018-12-01 22:00:23,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-01 22:00:23,284 INFO L276 IsEmpty]: Start isEmpty. Operand 20069 states and 49247 transitions. [2018-12-01 22:00:23,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 22:00:23,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:23,298 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:00:23,298 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:23,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:23,299 INFO L82 PathProgramCache]: Analyzing trace with hash -199803975, now seen corresponding path program 1 times [2018-12-01 22:00:23,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:23,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:23,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:00:23,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:23,300 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:23,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:23,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-01 22:00:23,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:23,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-01 22:00:23,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:23,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-01 22:00:23,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-01 22:00:23,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-01 22:00:23,379 INFO L87 Difference]: Start difference. First operand 20069 states and 49247 transitions. Second operand 8 states. [2018-12-01 22:00:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:23,689 INFO L93 Difference]: Finished difference Result 21820 states and 53337 transitions. [2018-12-01 22:00:23,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 22:00:23,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 104 [2018-12-01 22:00:23,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:23,693 INFO L225 Difference]: With dead ends: 21820 [2018-12-01 22:00:23,693 INFO L226 Difference]: Without dead ends: 4847 [2018-12-01 22:00:23,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-01 22:00:23,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4847 states. [2018-12-01 22:00:23,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4847 to 4845. [2018-12-01 22:00:23,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4845 states. [2018-12-01 22:00:23,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4845 states to 4845 states and 12020 transitions. [2018-12-01 22:00:23,727 INFO L78 Accepts]: Start accepts. Automaton has 4845 states and 12020 transitions. Word has length 104 [2018-12-01 22:00:23,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:23,727 INFO L480 AbstractCegarLoop]: Abstraction has 4845 states and 12020 transitions. [2018-12-01 22:00:23,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-01 22:00:23,727 INFO L276 IsEmpty]: Start isEmpty. Operand 4845 states and 12020 transitions. [2018-12-01 22:00:23,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 22:00:23,730 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:23,730 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:00:23,730 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:23,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:23,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1411784936, now seen corresponding path program 1 times [2018-12-01 22:00:23,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:23,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:23,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:00:23,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:23,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:23,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:23,846 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-01 22:00:23,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:23,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-01 22:00:23,847 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:23,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-01 22:00:23,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-01 22:00:23,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-01 22:00:23,847 INFO L87 Difference]: Start difference. First operand 4845 states and 12020 transitions. Second operand 13 states. [2018-12-01 22:00:24,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:24,271 INFO L93 Difference]: Finished difference Result 7912 states and 19287 transitions. [2018-12-01 22:00:24,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 22:00:24,272 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2018-12-01 22:00:24,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:24,276 INFO L225 Difference]: With dead ends: 7912 [2018-12-01 22:00:24,276 INFO L226 Difference]: Without dead ends: 5829 [2018-12-01 22:00:24,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-01 22:00:24,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5829 states. [2018-12-01 22:00:24,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5829 to 4945. [2018-12-01 22:00:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4945 states. [2018-12-01 22:00:24,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 12200 transitions. [2018-12-01 22:00:24,312 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 12200 transitions. Word has length 104 [2018-12-01 22:00:24,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:24,312 INFO L480 AbstractCegarLoop]: Abstraction has 4945 states and 12200 transitions. [2018-12-01 22:00:24,312 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-01 22:00:24,312 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 12200 transitions. [2018-12-01 22:00:24,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 22:00:24,315 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:24,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:00:24,315 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:24,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:24,316 INFO L82 PathProgramCache]: Analyzing trace with hash 248602942, now seen corresponding path program 2 times [2018-12-01 22:00:24,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:24,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:24,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 22:00:24,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:24,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:24,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:24,429 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-01 22:00:24,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:24,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-01 22:00:24,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:24,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-01 22:00:24,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-01 22:00:24,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-12-01 22:00:24,429 INFO L87 Difference]: Start difference. First operand 4945 states and 12200 transitions. Second operand 14 states. [2018-12-01 22:00:24,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:24,838 INFO L93 Difference]: Finished difference Result 9535 states and 23742 transitions. [2018-12-01 22:00:24,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-01 22:00:24,838 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 104 [2018-12-01 22:00:24,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:24,842 INFO L225 Difference]: With dead ends: 9535 [2018-12-01 22:00:24,843 INFO L226 Difference]: Without dead ends: 5903 [2018-12-01 22:00:24,843 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=468, Unknown=0, NotChecked=0, Total=552 [2018-12-01 22:00:24,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5903 states. [2018-12-01 22:00:24,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5903 to 5855. [2018-12-01 22:00:24,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5855 states. [2018-12-01 22:00:24,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5855 states to 5855 states and 14554 transitions. [2018-12-01 22:00:24,885 INFO L78 Accepts]: Start accepts. Automaton has 5855 states and 14554 transitions. Word has length 104 [2018-12-01 22:00:24,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:24,885 INFO L480 AbstractCegarLoop]: Abstraction has 5855 states and 14554 transitions. [2018-12-01 22:00:24,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-01 22:00:24,885 INFO L276 IsEmpty]: Start isEmpty. Operand 5855 states and 14554 transitions. [2018-12-01 22:00:24,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 22:00:24,889 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:00:24,889 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:24,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:24,889 INFO L82 PathProgramCache]: Analyzing trace with hash 1469195098, now seen corresponding path program 3 times [2018-12-01 22:00:24,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:24,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:24,890 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:00:24,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:24,890 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 22:00:24,991 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-01 22:00:24,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 22:00:24,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-01 22:00:24,992 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-01 22:00:24,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-01 22:00:24,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-01 22:00:24,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-01 22:00:24,992 INFO L87 Difference]: Start difference. First operand 5855 states and 14554 transitions. Second operand 13 states. [2018-12-01 22:00:25,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 22:00:25,444 INFO L93 Difference]: Finished difference Result 9184 states and 22414 transitions. [2018-12-01 22:00:25,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-01 22:00:25,444 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 104 [2018-12-01 22:00:25,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-01 22:00:25,450 INFO L225 Difference]: With dead ends: 9184 [2018-12-01 22:00:25,450 INFO L226 Difference]: Without dead ends: 8253 [2018-12-01 22:00:25,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2018-12-01 22:00:25,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8253 states. [2018-12-01 22:00:25,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8253 to 5875. [2018-12-01 22:00:25,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5875 states. [2018-12-01 22:00:25,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5875 states to 5875 states and 14603 transitions. [2018-12-01 22:00:25,505 INFO L78 Accepts]: Start accepts. Automaton has 5875 states and 14603 transitions. Word has length 104 [2018-12-01 22:00:25,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-01 22:00:25,506 INFO L480 AbstractCegarLoop]: Abstraction has 5875 states and 14603 transitions. [2018-12-01 22:00:25,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-01 22:00:25,506 INFO L276 IsEmpty]: Start isEmpty. Operand 5875 states and 14603 transitions. [2018-12-01 22:00:25,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-01 22:00:25,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-01 22:00:25,510 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 22:00:25,510 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-01 22:00:25,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 22:00:25,510 INFO L82 PathProgramCache]: Analyzing trace with hash -720978081, now seen corresponding path program 1 times [2018-12-01 22:00:25,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-01 22:00:25,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:25,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 22:00:25,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 22:00:25,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-01 22:00:25,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:00:25,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 22:00:25,559 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-01 22:00:25,654 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-01 22:00:25,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 10:00:25 BasicIcfg [2018-12-01 22:00:25,656 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-01 22:00:25,656 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 22:00:25,656 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 22:00:25,656 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 22:00:25,657 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 10:00:05" (3/4) ... [2018-12-01 22:00:25,658 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-01 22:00:25,750 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1071e7c4-0938-4a47-baf9-221a9ec0b26b/bin-2019/utaipan/witness.graphml [2018-12-01 22:00:25,750 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 22:00:25,751 INFO L168 Benchmark]: Toolchain (without parser) took 20616.93 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 952.4 MB in the beginning and 924.0 MB in the end (delta: 28.4 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-01 22:00:25,752 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 22:00:25,752 INFO L168 Benchmark]: CACSL2BoogieTranslator took 366.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-12-01 22:00:25,752 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.18 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2018-12-01 22:00:25,752 INFO L168 Benchmark]: Boogie Preprocessor took 19.22 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-01 22:00:25,752 INFO L168 Benchmark]: RCFGBuilder took 369.25 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: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. [2018-12-01 22:00:25,753 INFO L168 Benchmark]: TraceAbstraction took 19732.26 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 957.3 MB in the end (delta: 83.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-01 22:00:25,753 INFO L168 Benchmark]: Witness Printer took 94.03 ms. Allocated memory is still 2.7 GB. Free memory was 957.3 MB in the beginning and 924.0 MB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. [2018-12-01 22:00:25,754 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 366.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.18 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: 7.2 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.22 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 369.25 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: 59.1 MB). Peak memory consumption was 59.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19732.26 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.6 GB). Free memory was 1.0 GB in the beginning and 957.3 MB in the end (delta: 83.8 MB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 94.03 ms. Allocated memory is still 2.7 GB. Free memory was 957.3 MB in the beginning and 924.0 MB in the end (delta: 33.3 MB). Peak memory consumption was 33.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0] [L693] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0] [L694] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L702] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L703] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L704] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L794] -1 pthread_t t257; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L795] FCALL, FORK -1 pthread_create(&t257, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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 t258; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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(&t258, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L742] 0 y$w_buff1 = y$w_buff0 [L743] 0 y$w_buff0 = 1 [L744] 0 y$w_buff1_used = y$w_buff0_used [L745] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L747] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L748] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L749] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L750] 0 y$r_buff0_thd2 = (_Bool)1 [L753] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 0 y$flush_delayed = weak$$choice2 [L756] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L757] EXPR 0 !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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L757] EXPR 0 !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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L757] 0 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) [L758] EXPR 0 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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$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)) [L759] EXPR 0 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L759] 0 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)) [L760] EXPR 0 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L760] 0 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)) [L761] EXPR 0 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L761] 0 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)) [L762] EXPR 0 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L762] 0 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)) [L763] EXPR 0 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=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L763] 0 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)) [L764] 0 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L765] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L765] 0 y = y$flush_delayed ? y$mem_tmp : y [L766] 0 y$flush_delayed = (_Bool)0 [L769] 0 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L772] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L708] 1 z = 1 [L711] 1 x = 1 [L714] 1 __unbuffered_p0_EAX = x [L717] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L718] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L719] 1 y$flush_delayed = weak$$choice2 [L720] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L721] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L721] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L722] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L722] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L723] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L723] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L724] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L724] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L725] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L726] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L726] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L727] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L727] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L729] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L772] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L773] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L729] 1 y = y$flush_delayed ? y$mem_tmp : y [L730] 1 y$flush_delayed = (_Bool)0 [L735] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L773] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L774] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L774] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L775] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L775] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L776] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L776] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L779] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L799] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L804] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L804] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L805] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L805] -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 [L806] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L806] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L807] 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=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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$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 [L810] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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 5 procedures, 285 locations, 3 error locations. UNSAFE Result, 19.6s OverallTime, 23 OverallIterations, 1 TraceHistogramMax, 6.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 7383 SDtfs, 7859 SDslu, 20856 SDs, 0 SdLazy, 6030 SolverSat, 306 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 239 GetRequests, 59 SyntacticMatches, 14 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83129occurred in iteration=0, 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: 5.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 91119 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2005 NumberOfCodeBlocks, 2005 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 1879 ConstructedInterpolants, 0 QuantifiedInterpolants, 409369 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...