./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix028_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_ce8542e5-5fbd-44a0-8baa-91383b9c66c5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ce8542e5-5fbd-44a0-8baa-91383b9c66c5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ce8542e5-5fbd-44a0-8baa-91383b9c66c5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ce8542e5-5fbd-44a0-8baa-91383b9c66c5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix028_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_ce8542e5-5fbd-44a0-8baa-91383b9c66c5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ce8542e5-5fbd-44a0-8baa-91383b9c66c5/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 bdc38a1b791b964a5d3ebef146a28040d23c9f7b ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:27:21,628 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:27:21,629 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:27:21,635 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:27:21,635 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:27:21,636 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:27:21,637 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:27:21,638 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:27:21,638 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:27:21,639 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:27:21,639 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:27:21,639 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:27:21,640 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:27:21,640 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:27:21,641 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:27:21,641 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:27:21,642 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:27:21,643 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:27:21,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:27:21,644 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:27:21,645 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:27:21,645 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:27:21,647 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:27:21,647 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:27:21,647 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:27:21,648 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:27:21,648 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:27:21,649 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:27:21,649 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:27:21,649 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:27:21,650 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:27:21,650 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:27:21,650 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:27:21,650 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:27:21,651 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:27:21,651 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:27:21,651 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ce8542e5-5fbd-44a0-8baa-91383b9c66c5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 00:27:21,659 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:27:21,659 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:27:21,659 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:27:21,659 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:27:21,659 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:27:21,660 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:27:21,660 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:27:21,660 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 00:27:21,660 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:27:21,660 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:27:21,660 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 00:27:21,660 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 00:27:21,660 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:27:21,661 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:27:21,661 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:27:21,661 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:27:21,661 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:27:21,661 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:27:21,661 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:27:21,661 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:27:21,662 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:27:21,662 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:27:21,662 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:27:21,662 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:27:21,662 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:27:21,662 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:27:21,662 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:27:21,662 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:27:21,662 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:27:21,663 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:27:21,663 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:27:21,663 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:27:21,663 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 00:27:21,663 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:27:21,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:27:21,663 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 00:27:21,663 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_ce8542e5-5fbd-44a0-8baa-91383b9c66c5/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 -> bdc38a1b791b964a5d3ebef146a28040d23c9f7b [2018-12-09 00:27:21,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:27:21,689 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:27:21,691 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:27:21,692 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:27:21,692 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:27:21,693 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ce8542e5-5fbd-44a0-8baa-91383b9c66c5/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix028_tso.opt_false-unreach-call.i [2018-12-09 00:27:21,732 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ce8542e5-5fbd-44a0-8baa-91383b9c66c5/bin-2019/utaipan/data/fc84372b4/0ac13fff693442babfd59625b17b0076/FLAGda4b8fc2d [2018-12-09 00:27:22,155 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:27:22,155 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ce8542e5-5fbd-44a0-8baa-91383b9c66c5/sv-benchmarks/c/pthread-wmm/mix028_tso.opt_false-unreach-call.i [2018-12-09 00:27:22,162 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ce8542e5-5fbd-44a0-8baa-91383b9c66c5/bin-2019/utaipan/data/fc84372b4/0ac13fff693442babfd59625b17b0076/FLAGda4b8fc2d [2018-12-09 00:27:22,170 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ce8542e5-5fbd-44a0-8baa-91383b9c66c5/bin-2019/utaipan/data/fc84372b4/0ac13fff693442babfd59625b17b0076 [2018-12-09 00:27:22,172 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:27:22,173 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:27:22,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:27:22,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:27:22,176 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:27:22,176 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:27:22" (1/1) ... [2018-12-09 00:27:22,178 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:22, skipping insertion in model container [2018-12-09 00:27:22,178 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:27:22" (1/1) ... [2018-12-09 00:27:22,182 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:27:22,203 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:27:22,385 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:27:22,393 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:27:22,471 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:27:22,503 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:27:22,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:22 WrapperNode [2018-12-09 00:27:22,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:27:22,504 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:27:22,504 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:27:22,504 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:27:22,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:22" (1/1) ... [2018-12-09 00:27:22,520 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:22" (1/1) ... [2018-12-09 00:27:22,538 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:27:22,539 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:27:22,539 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:27:22,539 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:27:22,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:22" (1/1) ... [2018-12-09 00:27:22,545 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:22" (1/1) ... [2018-12-09 00:27:22,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:22" (1/1) ... [2018-12-09 00:27:22,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:22" (1/1) ... [2018-12-09 00:27:22,554 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:22" (1/1) ... [2018-12-09 00:27:22,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:22" (1/1) ... [2018-12-09 00:27:22,559 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:22" (1/1) ... [2018-12-09 00:27:22,561 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:27:22,562 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:27:22,562 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:27:22,562 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:27:22,562 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ce8542e5-5fbd-44a0-8baa-91383b9c66c5/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:27:22,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 00:27:22,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 00:27:22,595 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 00:27:22,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 00:27:22,595 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 00:27:22,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 00:27:22,595 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 00:27:22,595 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 00:27:22,595 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 00:27:22,596 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 00:27:22,596 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 00:27:22,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:27:22,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:27:22,597 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 00:27:22,972 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:27:22,972 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 00:27:22,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:27:22 BoogieIcfgContainer [2018-12-09 00:27:22,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:27:22,973 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:27:22,973 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:27:22,975 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:27:22,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:27:22" (1/3) ... [2018-12-09 00:27:22,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7d2986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:27:22, skipping insertion in model container [2018-12-09 00:27:22,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:27:22" (2/3) ... [2018-12-09 00:27:22,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c7d2986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:27:22, skipping insertion in model container [2018-12-09 00:27:22,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:27:22" (3/3) ... [2018-12-09 00:27:22,977 INFO L112 eAbstractionObserver]: Analyzing ICFG mix028_tso.opt_false-unreach-call.i [2018-12-09 00:27:23,004 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,004 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,005 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,005 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,005 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,005 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,005 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,005 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,006 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,006 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,006 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,006 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,006 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,006 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,007 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,008 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,009 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,010 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,011 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,012 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,012 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,012 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,013 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,013 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,013 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet12.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,013 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet12.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet12.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet12.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,014 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,015 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,015 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,015 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,015 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,015 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,016 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,017 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,018 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,019 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,020 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,021 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,022 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,023 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,024 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,025 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,026 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,027 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,028 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,029 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet40.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet40.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,030 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet40.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,031 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet40.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 00:27:23,035 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 00:27:23,036 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:27:23,043 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 00:27:23,056 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 00:27:23,072 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:27:23,073 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:27:23,073 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:27:23,073 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:27:23,073 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:27:23,073 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:27:23,073 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:27:23,073 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:27:23,084 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 198places, 256 transitions [2018-12-09 00:28:58,303 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 385953 states. [2018-12-09 00:28:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 385953 states. [2018-12-09 00:28:58,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 00:28:58,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:28:58,312 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] [2018-12-09 00:28:58,313 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:28:58,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:28:58,317 INFO L82 PathProgramCache]: Analyzing trace with hash 654477059, now seen corresponding path program 1 times [2018-12-09 00:28:58,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:28:58,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:28:58,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:28:58,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:28:58,354 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:28:58,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:28:58,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:28:58,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:28:58,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:28:58,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:28:58,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:28:58,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:28:58,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:28:58,477 INFO L87 Difference]: Start difference. First operand 385953 states. Second operand 4 states. [2018-12-09 00:29:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:29:06,070 INFO L93 Difference]: Finished difference Result 735793 states and 3585691 transitions. [2018-12-09 00:29:06,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:29:06,072 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2018-12-09 00:29:06,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:29:08,632 INFO L225 Difference]: With dead ends: 735793 [2018-12-09 00:29:08,633 INFO L226 Difference]: Without dead ends: 634643 [2018-12-09 00:29:08,634 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:29:18,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634643 states. [2018-12-09 00:29:31,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634643 to 340233. [2018-12-09 00:29:31,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340233 states. [2018-12-09 00:29:33,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340233 states to 340233 states and 1669458 transitions. [2018-12-09 00:29:33,279 INFO L78 Accepts]: Start accepts. Automaton has 340233 states and 1669458 transitions. Word has length 44 [2018-12-09 00:29:33,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:29:33,280 INFO L480 AbstractCegarLoop]: Abstraction has 340233 states and 1669458 transitions. [2018-12-09 00:29:33,280 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:29:33,280 INFO L276 IsEmpty]: Start isEmpty. Operand 340233 states and 1669458 transitions. [2018-12-09 00:29:33,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 00:29:33,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:29:33,289 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-09 00:29:33,289 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:29:33,289 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:29:33,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1909790898, now seen corresponding path program 1 times [2018-12-09 00:29:33,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:29:33,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:29:33,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:29:33,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:29:33,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:29:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:29:33,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:29:33,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:29:33,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:29:33,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:29:33,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:29:33,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:29:33,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:29:33,354 INFO L87 Difference]: Start difference. First operand 340233 states and 1669458 transitions. Second operand 5 states. [2018-12-09 00:29:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:29:42,996 INFO L93 Difference]: Finished difference Result 1007353 states and 4689304 transitions. [2018-12-09 00:29:42,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:29:42,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-09 00:29:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:29:46,524 INFO L225 Difference]: With dead ends: 1007353 [2018-12-09 00:29:46,524 INFO L226 Difference]: Without dead ends: 1006353 [2018-12-09 00:29:46,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:30:06,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006353 states. [2018-12-09 00:30:15,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006353 to 549408. [2018-12-09 00:30:15,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549408 states. [2018-12-09 00:30:28,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549408 states to 549408 states and 2556398 transitions. [2018-12-09 00:30:28,024 INFO L78 Accepts]: Start accepts. Automaton has 549408 states and 2556398 transitions. Word has length 51 [2018-12-09 00:30:28,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:30:28,025 INFO L480 AbstractCegarLoop]: Abstraction has 549408 states and 2556398 transitions. [2018-12-09 00:30:28,025 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:30:28,025 INFO L276 IsEmpty]: Start isEmpty. Operand 549408 states and 2556398 transitions. [2018-12-09 00:30:28,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 00:30:28,031 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:30:28,031 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] [2018-12-09 00:30:28,031 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:30:28,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:30:28,031 INFO L82 PathProgramCache]: Analyzing trace with hash -988308488, now seen corresponding path program 1 times [2018-12-09 00:30:28,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:30:28,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:28,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:30:28,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:30:28,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:30:28,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:30:28,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:30:28,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:30:28,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:30:28,065 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:30:28,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:30:28,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:30:28,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:30:28,065 INFO L87 Difference]: Start difference. First operand 549408 states and 2556398 transitions. Second operand 3 states. [2018-12-09 00:30:34,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:30:34,947 INFO L93 Difference]: Finished difference Result 549408 states and 2556033 transitions. [2018-12-09 00:30:34,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:30:34,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-09 00:30:34,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:30:36,724 INFO L225 Difference]: With dead ends: 549408 [2018-12-09 00:30:36,724 INFO L226 Difference]: Without dead ends: 549408 [2018-12-09 00:30:36,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:30:45,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549408 states. [2018-12-09 00:30:52,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549408 to 549408. [2018-12-09 00:30:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549408 states. [2018-12-09 00:31:03,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549408 states to 549408 states and 2556033 transitions. [2018-12-09 00:31:03,037 INFO L78 Accepts]: Start accepts. Automaton has 549408 states and 2556033 transitions. Word has length 52 [2018-12-09 00:31:03,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:03,038 INFO L480 AbstractCegarLoop]: Abstraction has 549408 states and 2556033 transitions. [2018-12-09 00:31:03,038 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:31:03,038 INFO L276 IsEmpty]: Start isEmpty. Operand 549408 states and 2556033 transitions. [2018-12-09 00:31:03,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 00:31:03,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:03,043 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] [2018-12-09 00:31:03,043 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:03,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:03,044 INFO L82 PathProgramCache]: Analyzing trace with hash 754501847, now seen corresponding path program 1 times [2018-12-09 00:31:03,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:03,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:03,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:03,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:03,045 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:03,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:03,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:03,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:03,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:31:03,073 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:03,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:31:03,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:31:03,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:31:03,074 INFO L87 Difference]: Start difference. First operand 549408 states and 2556033 transitions. Second operand 4 states. [2018-12-09 00:31:08,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:08,229 INFO L93 Difference]: Finished difference Result 472455 states and 2161069 transitions. [2018-12-09 00:31:08,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:31:08,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2018-12-09 00:31:08,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:09,499 INFO L225 Difference]: With dead ends: 472455 [2018-12-09 00:31:09,499 INFO L226 Difference]: Without dead ends: 463970 [2018-12-09 00:31:09,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:31:17,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463970 states. [2018-12-09 00:31:22,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463970 to 463970. [2018-12-09 00:31:22,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463970 states. [2018-12-09 00:31:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463970 states to 463970 states and 2131578 transitions. [2018-12-09 00:31:24,711 INFO L78 Accepts]: Start accepts. Automaton has 463970 states and 2131578 transitions. Word has length 52 [2018-12-09 00:31:24,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:24,711 INFO L480 AbstractCegarLoop]: Abstraction has 463970 states and 2131578 transitions. [2018-12-09 00:31:24,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:31:24,711 INFO L276 IsEmpty]: Start isEmpty. Operand 463970 states and 2131578 transitions. [2018-12-09 00:31:24,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 00:31:24,716 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:24,716 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] [2018-12-09 00:31:24,716 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:24,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:24,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1302071129, now seen corresponding path program 1 times [2018-12-09 00:31:24,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:24,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:24,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:24,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:24,718 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:24,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:24,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:24,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:24,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:31:24,761 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:24,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:31:24,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:31:24,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:31:24,762 INFO L87 Difference]: Start difference. First operand 463970 states and 2131578 transitions. Second operand 5 states. [2018-12-09 00:31:25,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:25,190 INFO L93 Difference]: Finished difference Result 107974 states and 450057 transitions. [2018-12-09 00:31:25,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:31:25,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2018-12-09 00:31:25,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:25,413 INFO L225 Difference]: With dead ends: 107974 [2018-12-09 00:31:25,413 INFO L226 Difference]: Without dead ends: 100622 [2018-12-09 00:31:25,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:31:25,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100622 states. [2018-12-09 00:31:27,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100622 to 100622. [2018-12-09 00:31:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100622 states. [2018-12-09 00:31:27,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100622 states to 100622 states and 420923 transitions. [2018-12-09 00:31:27,528 INFO L78 Accepts]: Start accepts. Automaton has 100622 states and 420923 transitions. Word has length 53 [2018-12-09 00:31:27,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:27,528 INFO L480 AbstractCegarLoop]: Abstraction has 100622 states and 420923 transitions. [2018-12-09 00:31:27,528 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:31:27,528 INFO L276 IsEmpty]: Start isEmpty. Operand 100622 states and 420923 transitions. [2018-12-09 00:31:27,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-12-09 00:31:27,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:27,539 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] [2018-12-09 00:31:27,539 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:27,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:27,540 INFO L82 PathProgramCache]: Analyzing trace with hash 728190523, now seen corresponding path program 1 times [2018-12-09 00:31:27,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:27,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:27,541 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:27,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:27,541 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:27,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:27,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:27,604 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:27,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:31:27,604 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:27,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:31:27,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:31:27,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:31:27,605 INFO L87 Difference]: Start difference. First operand 100622 states and 420923 transitions. Second operand 6 states. [2018-12-09 00:31:27,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:27,671 INFO L93 Difference]: Finished difference Result 15454 states and 53779 transitions. [2018-12-09 00:31:27,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:31:27,672 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2018-12-09 00:31:27,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:27,689 INFO L225 Difference]: With dead ends: 15454 [2018-12-09 00:31:27,689 INFO L226 Difference]: Without dead ends: 13166 [2018-12-09 00:31:27,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:31:27,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13166 states. [2018-12-09 00:31:27,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13166 to 13026. [2018-12-09 00:31:27,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13026 states. [2018-12-09 00:31:27,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13026 states to 13026 states and 44819 transitions. [2018-12-09 00:31:27,835 INFO L78 Accepts]: Start accepts. Automaton has 13026 states and 44819 transitions. Word has length 66 [2018-12-09 00:31:27,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:27,835 INFO L480 AbstractCegarLoop]: Abstraction has 13026 states and 44819 transitions. [2018-12-09 00:31:27,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:31:27,835 INFO L276 IsEmpty]: Start isEmpty. Operand 13026 states and 44819 transitions. [2018-12-09 00:31:27,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 00:31:27,850 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:27,850 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:27,850 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:27,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:27,851 INFO L82 PathProgramCache]: Analyzing trace with hash -567034914, now seen corresponding path program 1 times [2018-12-09 00:31:27,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:27,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:27,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:27,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:27,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:27,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:27,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:27,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:27,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:31:27,929 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:27,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:31:27,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:31:27,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:31:27,930 INFO L87 Difference]: Start difference. First operand 13026 states and 44819 transitions. Second operand 4 states. [2018-12-09 00:31:28,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:28,130 INFO L93 Difference]: Finished difference Result 17361 states and 59227 transitions. [2018-12-09 00:31:28,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:31:28,130 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-12-09 00:31:28,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:28,149 INFO L225 Difference]: With dead ends: 17361 [2018-12-09 00:31:28,150 INFO L226 Difference]: Without dead ends: 17361 [2018-12-09 00:31:28,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:31:28,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17361 states. [2018-12-09 00:31:29,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17361 to 15901. [2018-12-09 00:31:29,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15901 states. [2018-12-09 00:31:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15901 states to 15901 states and 54609 transitions. [2018-12-09 00:31:29,281 INFO L78 Accepts]: Start accepts. Automaton has 15901 states and 54609 transitions. Word has length 115 [2018-12-09 00:31:29,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:29,281 INFO L480 AbstractCegarLoop]: Abstraction has 15901 states and 54609 transitions. [2018-12-09 00:31:29,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:31:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 15901 states and 54609 transitions. [2018-12-09 00:31:29,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 00:31:29,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:29,299 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:29,299 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:29,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:29,299 INFO L82 PathProgramCache]: Analyzing trace with hash 616312383, now seen corresponding path program 1 times [2018-12-09 00:31:29,299 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:29,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:29,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:29,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:29,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:29,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:29,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:29,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:31:29,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:29,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:31:29,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:31:29,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:31:29,397 INFO L87 Difference]: Start difference. First operand 15901 states and 54609 transitions. Second operand 7 states. [2018-12-09 00:31:29,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:29,667 INFO L93 Difference]: Finished difference Result 18856 states and 63983 transitions. [2018-12-09 00:31:29,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:31:29,667 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 115 [2018-12-09 00:31:29,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:29,689 INFO L225 Difference]: With dead ends: 18856 [2018-12-09 00:31:29,689 INFO L226 Difference]: Without dead ends: 18856 [2018-12-09 00:31:29,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:31:29,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18856 states. [2018-12-09 00:31:29,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18856 to 16191. [2018-12-09 00:31:29,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16191 states. [2018-12-09 00:31:29,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16191 states to 16191 states and 55511 transitions. [2018-12-09 00:31:29,877 INFO L78 Accepts]: Start accepts. Automaton has 16191 states and 55511 transitions. Word has length 115 [2018-12-09 00:31:29,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:29,877 INFO L480 AbstractCegarLoop]: Abstraction has 16191 states and 55511 transitions. [2018-12-09 00:31:29,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:31:29,877 INFO L276 IsEmpty]: Start isEmpty. Operand 16191 states and 55511 transitions. [2018-12-09 00:31:29,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 00:31:29,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:29,895 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:29,895 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:29,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:29,895 INFO L82 PathProgramCache]: Analyzing trace with hash 8235520, now seen corresponding path program 1 times [2018-12-09 00:31:29,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:29,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:29,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:29,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:29,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:29,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:29,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:29,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:31:29,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:29,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:31:29,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:31:29,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:31:29,962 INFO L87 Difference]: Start difference. First operand 16191 states and 55511 transitions. Second operand 5 states. [2018-12-09 00:31:30,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:30,163 INFO L93 Difference]: Finished difference Result 17730 states and 60384 transitions. [2018-12-09 00:31:30,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:31:30,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2018-12-09 00:31:30,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:30,184 INFO L225 Difference]: With dead ends: 17730 [2018-12-09 00:31:30,184 INFO L226 Difference]: Without dead ends: 17730 [2018-12-09 00:31:30,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:31:30,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17730 states. [2018-12-09 00:31:30,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17730 to 16261. [2018-12-09 00:31:30,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16261 states. [2018-12-09 00:31:30,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16261 states to 16261 states and 55717 transitions. [2018-12-09 00:31:30,369 INFO L78 Accepts]: Start accepts. Automaton has 16261 states and 55717 transitions. Word has length 115 [2018-12-09 00:31:30,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:30,369 INFO L480 AbstractCegarLoop]: Abstraction has 16261 states and 55717 transitions. [2018-12-09 00:31:30,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:31:30,369 INFO L276 IsEmpty]: Start isEmpty. Operand 16261 states and 55717 transitions. [2018-12-09 00:31:30,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 00:31:30,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:30,385 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:30,386 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:30,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:30,386 INFO L82 PathProgramCache]: Analyzing trace with hash 117787103, now seen corresponding path program 1 times [2018-12-09 00:31:30,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:30,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:30,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:30,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:30,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:30,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:30,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:30,465 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:30,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:31:30,465 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:30,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:31:30,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:31:30,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:31:30,466 INFO L87 Difference]: Start difference. First operand 16261 states and 55717 transitions. Second operand 5 states. [2018-12-09 00:31:30,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:30,510 INFO L93 Difference]: Finished difference Result 13076 states and 44064 transitions. [2018-12-09 00:31:30,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:31:30,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2018-12-09 00:31:30,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:30,526 INFO L225 Difference]: With dead ends: 13076 [2018-12-09 00:31:30,526 INFO L226 Difference]: Without dead ends: 13076 [2018-12-09 00:31:30,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:31:30,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13076 states. [2018-12-09 00:31:30,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13076 to 13016. [2018-12-09 00:31:30,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13016 states. [2018-12-09 00:31:30,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13016 states to 13016 states and 43876 transitions. [2018-12-09 00:31:30,667 INFO L78 Accepts]: Start accepts. Automaton has 13016 states and 43876 transitions. Word has length 115 [2018-12-09 00:31:30,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:30,667 INFO L480 AbstractCegarLoop]: Abstraction has 13016 states and 43876 transitions. [2018-12-09 00:31:30,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:31:30,667 INFO L276 IsEmpty]: Start isEmpty. Operand 13016 states and 43876 transitions. [2018-12-09 00:31:30,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 00:31:30,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:30,681 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:30,681 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:30,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:30,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1515313044, now seen corresponding path program 1 times [2018-12-09 00:31:30,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:30,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:30,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:30,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:30,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:30,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:30,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:30,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:31:30,724 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:30,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:31:30,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:31:30,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:31:30,725 INFO L87 Difference]: Start difference. First operand 13016 states and 43876 transitions. Second operand 4 states. [2018-12-09 00:31:30,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:30,893 INFO L93 Difference]: Finished difference Result 14454 states and 48432 transitions. [2018-12-09 00:31:30,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:31:30,894 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2018-12-09 00:31:30,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:30,910 INFO L225 Difference]: With dead ends: 14454 [2018-12-09 00:31:30,911 INFO L226 Difference]: Without dead ends: 14454 [2018-12-09 00:31:30,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:31:30,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14454 states. [2018-12-09 00:31:31,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14454 to 13226. [2018-12-09 00:31:31,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13226 states. [2018-12-09 00:31:31,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13226 states to 13226 states and 44529 transitions. [2018-12-09 00:31:31,051 INFO L78 Accepts]: Start accepts. Automaton has 13226 states and 44529 transitions. Word has length 117 [2018-12-09 00:31:31,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:31,051 INFO L480 AbstractCegarLoop]: Abstraction has 13226 states and 44529 transitions. [2018-12-09 00:31:31,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:31:31,051 INFO L276 IsEmpty]: Start isEmpty. Operand 13226 states and 44529 transitions. [2018-12-09 00:31:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 00:31:31,063 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:31,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:31,064 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:31,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:31,064 INFO L82 PathProgramCache]: Analyzing trace with hash -420347243, now seen corresponding path program 1 times [2018-12-09 00:31:31,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:31,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:31,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:31,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:31,065 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:31,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-09 00:31:31,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:31,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:31:31,099 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:31,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:31:31,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:31:31,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:31:31,099 INFO L87 Difference]: Start difference. First operand 13226 states and 44529 transitions. Second operand 3 states. [2018-12-09 00:31:31,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:31,288 INFO L93 Difference]: Finished difference Result 16696 states and 55080 transitions. [2018-12-09 00:31:31,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:31:31,289 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2018-12-09 00:31:31,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:31,306 INFO L225 Difference]: With dead ends: 16696 [2018-12-09 00:31:31,306 INFO L226 Difference]: Without dead ends: 16696 [2018-12-09 00:31:31,306 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:31:31,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16696 states. [2018-12-09 00:31:31,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16696 to 16016. [2018-12-09 00:31:31,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16016 states. [2018-12-09 00:31:31,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16016 states to 16016 states and 53101 transitions. [2018-12-09 00:31:31,477 INFO L78 Accepts]: Start accepts. Automaton has 16016 states and 53101 transitions. Word has length 117 [2018-12-09 00:31:31,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:31,477 INFO L480 AbstractCegarLoop]: Abstraction has 16016 states and 53101 transitions. [2018-12-09 00:31:31,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:31:31,478 INFO L276 IsEmpty]: Start isEmpty. Operand 16016 states and 53101 transitions. [2018-12-09 00:31:31,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-12-09 00:31:31,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:31,495 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:31,495 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:31,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:31,495 INFO L82 PathProgramCache]: Analyzing trace with hash -2094832235, now seen corresponding path program 2 times [2018-12-09 00:31:31,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:31,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:31,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:31,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:31,497 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:31,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:31,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:31,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:31,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:31:31,572 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:31,572 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:31:31,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:31:31,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:31:31,572 INFO L87 Difference]: Start difference. First operand 16016 states and 53101 transitions. Second operand 6 states. [2018-12-09 00:31:31,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:31,881 INFO L93 Difference]: Finished difference Result 19359 states and 63114 transitions. [2018-12-09 00:31:31,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:31:31,882 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2018-12-09 00:31:31,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:31,903 INFO L225 Difference]: With dead ends: 19359 [2018-12-09 00:31:31,903 INFO L226 Difference]: Without dead ends: 19359 [2018-12-09 00:31:31,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:31:31,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19359 states. [2018-12-09 00:31:32,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19359 to 15001. [2018-12-09 00:31:32,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15001 states. [2018-12-09 00:31:32,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15001 states to 15001 states and 49259 transitions. [2018-12-09 00:31:32,079 INFO L78 Accepts]: Start accepts. Automaton has 15001 states and 49259 transitions. Word has length 117 [2018-12-09 00:31:32,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:32,079 INFO L480 AbstractCegarLoop]: Abstraction has 15001 states and 49259 transitions. [2018-12-09 00:31:32,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:31:32,079 INFO L276 IsEmpty]: Start isEmpty. Operand 15001 states and 49259 transitions. [2018-12-09 00:31:32,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 00:31:32,093 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:32,093 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:32,094 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:32,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:32,094 INFO L82 PathProgramCache]: Analyzing trace with hash -753714556, now seen corresponding path program 1 times [2018-12-09 00:31:32,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:32,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:32,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:31:32,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:32,095 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:32,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:32,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:32,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:32,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:31:32,176 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:32,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:31:32,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:31:32,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:31:32,177 INFO L87 Difference]: Start difference. First operand 15001 states and 49259 transitions. Second operand 7 states. [2018-12-09 00:31:32,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:32,440 INFO L93 Difference]: Finished difference Result 21351 states and 68614 transitions. [2018-12-09 00:31:32,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 00:31:32,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-09 00:31:32,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:32,465 INFO L225 Difference]: With dead ends: 21351 [2018-12-09 00:31:32,466 INFO L226 Difference]: Without dead ends: 21251 [2018-12-09 00:31:32,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 00:31:32,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21251 states. [2018-12-09 00:31:32,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21251 to 16806. [2018-12-09 00:31:32,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16806 states. [2018-12-09 00:31:32,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16806 states to 16806 states and 54793 transitions. [2018-12-09 00:31:32,661 INFO L78 Accepts]: Start accepts. Automaton has 16806 states and 54793 transitions. Word has length 119 [2018-12-09 00:31:32,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:32,662 INFO L480 AbstractCegarLoop]: Abstraction has 16806 states and 54793 transitions. [2018-12-09 00:31:32,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:31:32,662 INFO L276 IsEmpty]: Start isEmpty. Operand 16806 states and 54793 transitions. [2018-12-09 00:31:32,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 00:31:32,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:32,675 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:32,675 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:32,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:32,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2026450529, now seen corresponding path program 1 times [2018-12-09 00:31:32,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:32,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:32,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:32,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:32,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:32,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:32,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:32,785 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:32,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:31:32,785 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:32,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:31:32,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:31:32,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:31:32,786 INFO L87 Difference]: Start difference. First operand 16806 states and 54793 transitions. Second operand 6 states. [2018-12-09 00:31:33,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:33,081 INFO L93 Difference]: Finished difference Result 30711 states and 99103 transitions. [2018-12-09 00:31:33,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:31:33,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-12-09 00:31:33,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:33,115 INFO L225 Difference]: With dead ends: 30711 [2018-12-09 00:31:33,115 INFO L226 Difference]: Without dead ends: 30711 [2018-12-09 00:31:33,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:31:33,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30711 states. [2018-12-09 00:31:33,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30711 to 21140. [2018-12-09 00:31:33,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21140 states. [2018-12-09 00:31:33,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21140 states to 21140 states and 67623 transitions. [2018-12-09 00:31:33,374 INFO L78 Accepts]: Start accepts. Automaton has 21140 states and 67623 transitions. Word has length 119 [2018-12-09 00:31:33,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:33,374 INFO L480 AbstractCegarLoop]: Abstraction has 21140 states and 67623 transitions. [2018-12-09 00:31:33,374 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:31:33,375 INFO L276 IsEmpty]: Start isEmpty. Operand 21140 states and 67623 transitions. [2018-12-09 00:31:33,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 00:31:33,391 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:33,391 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:33,391 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:33,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:33,392 INFO L82 PathProgramCache]: Analyzing trace with hash 301878431, now seen corresponding path program 1 times [2018-12-09 00:31:33,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:33,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:33,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:33,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:33,393 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:33,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:33,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:33,443 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:33,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:31:33,443 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:33,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:31:33,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:31:33,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:31:33,444 INFO L87 Difference]: Start difference. First operand 21140 states and 67623 transitions. Second operand 4 states. [2018-12-09 00:31:33,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:33,646 INFO L93 Difference]: Finished difference Result 22484 states and 72311 transitions. [2018-12-09 00:31:33,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:31:33,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2018-12-09 00:31:33,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:33,670 INFO L225 Difference]: With dead ends: 22484 [2018-12-09 00:31:33,670 INFO L226 Difference]: Without dead ends: 22484 [2018-12-09 00:31:33,670 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:31:33,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22484 states. [2018-12-09 00:31:33,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22484 to 22356. [2018-12-09 00:31:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22356 states. [2018-12-09 00:31:33,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22356 states to 22356 states and 71895 transitions. [2018-12-09 00:31:33,903 INFO L78 Accepts]: Start accepts. Automaton has 22356 states and 71895 transitions. Word has length 119 [2018-12-09 00:31:33,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:33,903 INFO L480 AbstractCegarLoop]: Abstraction has 22356 states and 71895 transitions. [2018-12-09 00:31:33,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:31:33,903 INFO L276 IsEmpty]: Start isEmpty. Operand 22356 states and 71895 transitions. [2018-12-09 00:31:33,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 00:31:33,921 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:33,922 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:33,922 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:33,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:33,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1775330912, now seen corresponding path program 1 times [2018-12-09 00:31:33,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:33,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:33,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:33,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:33,923 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:34,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:34,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:34,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:31:34,005 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:34,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:31:34,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:31:34,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:31:34,005 INFO L87 Difference]: Start difference. First operand 22356 states and 71895 transitions. Second operand 7 states. [2018-12-09 00:31:34,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:34,374 INFO L93 Difference]: Finished difference Result 37229 states and 117820 transitions. [2018-12-09 00:31:34,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:31:34,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-09 00:31:34,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:34,413 INFO L225 Difference]: With dead ends: 37229 [2018-12-09 00:31:34,414 INFO L226 Difference]: Without dead ends: 37101 [2018-12-09 00:31:34,414 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:31:34,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37101 states. [2018-12-09 00:31:34,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37101 to 26127. [2018-12-09 00:31:34,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26127 states. [2018-12-09 00:31:34,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26127 states to 26127 states and 84696 transitions. [2018-12-09 00:31:34,764 INFO L78 Accepts]: Start accepts. Automaton has 26127 states and 84696 transitions. Word has length 119 [2018-12-09 00:31:34,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:34,765 INFO L480 AbstractCegarLoop]: Abstraction has 26127 states and 84696 transitions. [2018-12-09 00:31:34,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:31:34,765 INFO L276 IsEmpty]: Start isEmpty. Operand 26127 states and 84696 transitions. [2018-12-09 00:31:34,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 00:31:34,791 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:34,791 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:34,791 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:34,792 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:34,792 INFO L82 PathProgramCache]: Analyzing trace with hash -813716895, now seen corresponding path program 1 times [2018-12-09 00:31:34,792 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:34,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:34,793 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:34,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:34,793 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:34,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:34,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:34,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:31:34,867 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:34,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:31:34,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:31:34,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:31:34,868 INFO L87 Difference]: Start difference. First operand 26127 states and 84696 transitions. Second operand 7 states. [2018-12-09 00:31:35,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:35,308 INFO L93 Difference]: Finished difference Result 39483 states and 125907 transitions. [2018-12-09 00:31:35,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:31:35,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-09 00:31:35,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:35,353 INFO L225 Difference]: With dead ends: 39483 [2018-12-09 00:31:35,353 INFO L226 Difference]: Without dead ends: 39483 [2018-12-09 00:31:35,353 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-12-09 00:31:35,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39483 states. [2018-12-09 00:31:35,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39483 to 28113. [2018-12-09 00:31:35,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28113 states. [2018-12-09 00:31:35,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28113 states to 28113 states and 91420 transitions. [2018-12-09 00:31:35,800 INFO L78 Accepts]: Start accepts. Automaton has 28113 states and 91420 transitions. Word has length 119 [2018-12-09 00:31:35,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:35,800 INFO L480 AbstractCegarLoop]: Abstraction has 28113 states and 91420 transitions. [2018-12-09 00:31:35,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:31:35,800 INFO L276 IsEmpty]: Start isEmpty. Operand 28113 states and 91420 transitions. [2018-12-09 00:31:35,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 00:31:35,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:35,824 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:35,824 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:35,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:35,824 INFO L82 PathProgramCache]: Analyzing trace with hash 431047586, now seen corresponding path program 1 times [2018-12-09 00:31:35,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:35,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:35,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:35,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:35,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:35,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:35,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:35,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:35,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:31:35,901 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:35,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:31:35,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:31:35,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:31:35,902 INFO L87 Difference]: Start difference. First operand 28113 states and 91420 transitions. Second operand 7 states. [2018-12-09 00:31:36,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:36,055 INFO L93 Difference]: Finished difference Result 42168 states and 138752 transitions. [2018-12-09 00:31:36,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:31:36,056 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-09 00:31:36,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:36,113 INFO L225 Difference]: With dead ends: 42168 [2018-12-09 00:31:36,113 INFO L226 Difference]: Without dead ends: 42168 [2018-12-09 00:31:36,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:31:36,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42168 states. [2018-12-09 00:31:36,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42168 to 29508. [2018-12-09 00:31:36,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29508 states. [2018-12-09 00:31:36,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29508 states to 29508 states and 95561 transitions. [2018-12-09 00:31:36,508 INFO L78 Accepts]: Start accepts. Automaton has 29508 states and 95561 transitions. Word has length 119 [2018-12-09 00:31:36,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:36,508 INFO L480 AbstractCegarLoop]: Abstraction has 29508 states and 95561 transitions. [2018-12-09 00:31:36,508 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:31:36,508 INFO L276 IsEmpty]: Start isEmpty. Operand 29508 states and 95561 transitions. [2018-12-09 00:31:36,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 00:31:36,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:36,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:36,537 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:36,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:36,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1504612701, now seen corresponding path program 1 times [2018-12-09 00:31:36,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:36,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:36,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:36,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:36,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:36,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:36,593 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:36,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:31:36,593 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:36,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:31:36,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:31:36,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:31:36,594 INFO L87 Difference]: Start difference. First operand 29508 states and 95561 transitions. Second operand 7 states. [2018-12-09 00:31:36,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:36,798 INFO L93 Difference]: Finished difference Result 31238 states and 100765 transitions. [2018-12-09 00:31:36,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:31:36,799 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 119 [2018-12-09 00:31:36,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:36,836 INFO L225 Difference]: With dead ends: 31238 [2018-12-09 00:31:36,837 INFO L226 Difference]: Without dead ends: 31238 [2018-12-09 00:31:36,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-09 00:31:36,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31238 states. [2018-12-09 00:31:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31238 to 29793. [2018-12-09 00:31:37,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29793 states. [2018-12-09 00:31:37,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29793 states to 29793 states and 96379 transitions. [2018-12-09 00:31:37,183 INFO L78 Accepts]: Start accepts. Automaton has 29793 states and 96379 transitions. Word has length 119 [2018-12-09 00:31:37,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:37,183 INFO L480 AbstractCegarLoop]: Abstraction has 29793 states and 96379 transitions. [2018-12-09 00:31:37,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:31:37,183 INFO L276 IsEmpty]: Start isEmpty. Operand 29793 states and 96379 transitions. [2018-12-09 00:31:37,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 00:31:37,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:37,211 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:37,211 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:37,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:37,212 INFO L82 PathProgramCache]: Analyzing trace with hash -699077499, now seen corresponding path program 1 times [2018-12-09 00:31:37,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:37,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:37,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:37,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:37,213 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:37,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:37,285 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:37,285 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:31:37,285 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:37,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:31:37,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:31:37,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:31:37,285 INFO L87 Difference]: Start difference. First operand 29793 states and 96379 transitions. Second operand 5 states. [2018-12-09 00:31:37,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:37,439 INFO L93 Difference]: Finished difference Result 28208 states and 90246 transitions. [2018-12-09 00:31:37,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:31:37,440 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2018-12-09 00:31:37,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:37,472 INFO L225 Difference]: With dead ends: 28208 [2018-12-09 00:31:37,472 INFO L226 Difference]: Without dead ends: 28208 [2018-12-09 00:31:37,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:31:37,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28208 states. [2018-12-09 00:31:37,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28208 to 28208. [2018-12-09 00:31:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28208 states. [2018-12-09 00:31:37,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28208 states to 28208 states and 90246 transitions. [2018-12-09 00:31:37,802 INFO L78 Accepts]: Start accepts. Automaton has 28208 states and 90246 transitions. Word has length 119 [2018-12-09 00:31:37,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:37,802 INFO L480 AbstractCegarLoop]: Abstraction has 28208 states and 90246 transitions. [2018-12-09 00:31:37,802 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:31:37,802 INFO L276 IsEmpty]: Start isEmpty. Operand 28208 states and 90246 transitions. [2018-12-09 00:31:37,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-12-09 00:31:37,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:37,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:37,828 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:37,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:37,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1443875998, now seen corresponding path program 1 times [2018-12-09 00:31:37,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:37,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:37,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:37,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:37,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:37,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:37,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:37,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:37,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 00:31:37,911 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:37,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 00:31:37,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 00:31:37,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:31:37,911 INFO L87 Difference]: Start difference. First operand 28208 states and 90246 transitions. Second operand 6 states. [2018-12-09 00:31:38,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:38,022 INFO L93 Difference]: Finished difference Result 25776 states and 81062 transitions. [2018-12-09 00:31:38,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:31:38,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2018-12-09 00:31:38,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:38,053 INFO L225 Difference]: With dead ends: 25776 [2018-12-09 00:31:38,053 INFO L226 Difference]: Without dead ends: 25776 [2018-12-09 00:31:38,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:31:38,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25776 states. [2018-12-09 00:31:38,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25776 to 19109. [2018-12-09 00:31:38,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19109 states. [2018-12-09 00:31:38,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19109 states to 19109 states and 60654 transitions. [2018-12-09 00:31:38,293 INFO L78 Accepts]: Start accepts. Automaton has 19109 states and 60654 transitions. Word has length 119 [2018-12-09 00:31:38,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:38,294 INFO L480 AbstractCegarLoop]: Abstraction has 19109 states and 60654 transitions. [2018-12-09 00:31:38,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 00:31:38,294 INFO L276 IsEmpty]: Start isEmpty. Operand 19109 states and 60654 transitions. [2018-12-09 00:31:38,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 00:31:38,311 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:38,311 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:38,311 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:38,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:38,311 INFO L82 PathProgramCache]: Analyzing trace with hash 950530693, now seen corresponding path program 1 times [2018-12-09 00:31:38,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:38,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:38,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:38,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:38,312 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:38,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:38,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:38,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:31:38,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:38,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:31:38,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:31:38,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:31:38,365 INFO L87 Difference]: Start difference. First operand 19109 states and 60654 transitions. Second operand 5 states. [2018-12-09 00:31:38,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:38,517 INFO L93 Difference]: Finished difference Result 20389 states and 64814 transitions. [2018-12-09 00:31:38,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:31:38,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-12-09 00:31:38,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:38,537 INFO L225 Difference]: With dead ends: 20389 [2018-12-09 00:31:38,537 INFO L226 Difference]: Without dead ends: 20389 [2018-12-09 00:31:38,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-09 00:31:38,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20389 states. [2018-12-09 00:31:38,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20389 to 19301. [2018-12-09 00:31:38,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19301 states. [2018-12-09 00:31:38,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19301 states to 19301 states and 61278 transitions. [2018-12-09 00:31:38,739 INFO L78 Accepts]: Start accepts. Automaton has 19301 states and 61278 transitions. Word has length 121 [2018-12-09 00:31:38,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:38,739 INFO L480 AbstractCegarLoop]: Abstraction has 19301 states and 61278 transitions. [2018-12-09 00:31:38,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:31:38,740 INFO L276 IsEmpty]: Start isEmpty. Operand 19301 states and 61278 transitions. [2018-12-09 00:31:38,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 00:31:38,755 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:38,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:38,756 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:38,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:38,756 INFO L82 PathProgramCache]: Analyzing trace with hash -2099672122, now seen corresponding path program 1 times [2018-12-09 00:31:38,756 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:38,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:38,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:38,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:38,757 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:38,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:38,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:38,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:38,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 00:31:38,794 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:38,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 00:31:38,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 00:31:38,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 00:31:38,795 INFO L87 Difference]: Start difference. First operand 19301 states and 61278 transitions. Second operand 5 states. [2018-12-09 00:31:38,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:38,863 INFO L93 Difference]: Finished difference Result 27569 states and 87638 transitions. [2018-12-09 00:31:38,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 00:31:38,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2018-12-09 00:31:38,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:38,895 INFO L225 Difference]: With dead ends: 27569 [2018-12-09 00:31:38,895 INFO L226 Difference]: Without dead ends: 27569 [2018-12-09 00:31:38,896 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 00:31:38,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27569 states. [2018-12-09 00:31:39,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27569 to 19301. [2018-12-09 00:31:39,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19301 states. [2018-12-09 00:31:39,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19301 states to 19301 states and 60353 transitions. [2018-12-09 00:31:39,132 INFO L78 Accepts]: Start accepts. Automaton has 19301 states and 60353 transitions. Word has length 121 [2018-12-09 00:31:39,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:39,132 INFO L480 AbstractCegarLoop]: Abstraction has 19301 states and 60353 transitions. [2018-12-09 00:31:39,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 00:31:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 19301 states and 60353 transitions. [2018-12-09 00:31:39,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 00:31:39,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:39,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:39,148 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:39,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:39,149 INFO L82 PathProgramCache]: Analyzing trace with hash -795278393, now seen corresponding path program 1 times [2018-12-09 00:31:39,149 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:39,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:39,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:39,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:39,150 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:39,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:39,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:39,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:39,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 00:31:39,223 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:39,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 00:31:39,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 00:31:39,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:31:39,223 INFO L87 Difference]: Start difference. First operand 19301 states and 60353 transitions. Second operand 4 states. [2018-12-09 00:31:39,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:39,336 INFO L93 Difference]: Finished difference Result 28852 states and 90594 transitions. [2018-12-09 00:31:39,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 00:31:39,336 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2018-12-09 00:31:39,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:39,367 INFO L225 Difference]: With dead ends: 28852 [2018-12-09 00:31:39,367 INFO L226 Difference]: Without dead ends: 28852 [2018-12-09 00:31:39,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 00:31:39,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28852 states. [2018-12-09 00:31:39,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28852 to 28503. [2018-12-09 00:31:39,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28503 states. [2018-12-09 00:31:39,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28503 states to 28503 states and 89608 transitions. [2018-12-09 00:31:39,712 INFO L78 Accepts]: Start accepts. Automaton has 28503 states and 89608 transitions. Word has length 121 [2018-12-09 00:31:39,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:39,712 INFO L480 AbstractCegarLoop]: Abstraction has 28503 states and 89608 transitions. [2018-12-09 00:31:39,713 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 00:31:39,713 INFO L276 IsEmpty]: Start isEmpty. Operand 28503 states and 89608 transitions. [2018-12-09 00:31:39,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 00:31:39,738 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:39,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:39,738 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:39,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:39,738 INFO L82 PathProgramCache]: Analyzing trace with hash -1682782074, now seen corresponding path program 1 times [2018-12-09 00:31:39,739 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:39,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:39,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:39,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:39,740 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:39,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:39,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:39,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:39,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 00:31:39,802 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:39,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:31:39,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:31:39,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 00:31:39,802 INFO L87 Difference]: Start difference. First operand 28503 states and 89608 transitions. Second operand 8 states. [2018-12-09 00:31:40,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:40,076 INFO L93 Difference]: Finished difference Result 71933 states and 222888 transitions. [2018-12-09 00:31:40,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 00:31:40,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 121 [2018-12-09 00:31:40,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:40,107 INFO L225 Difference]: With dead ends: 71933 [2018-12-09 00:31:40,107 INFO L226 Difference]: Without dead ends: 28740 [2018-12-09 00:31:40,108 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2018-12-09 00:31:40,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28740 states. [2018-12-09 00:31:40,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28740 to 24684. [2018-12-09 00:31:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24684 states. [2018-12-09 00:31:40,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24684 states to 24684 states and 77404 transitions. [2018-12-09 00:31:40,393 INFO L78 Accepts]: Start accepts. Automaton has 24684 states and 77404 transitions. Word has length 121 [2018-12-09 00:31:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:40,393 INFO L480 AbstractCegarLoop]: Abstraction has 24684 states and 77404 transitions. [2018-12-09 00:31:40,393 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:31:40,393 INFO L276 IsEmpty]: Start isEmpty. Operand 24684 states and 77404 transitions. [2018-12-09 00:31:40,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 00:31:40,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:40,414 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:40,414 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:40,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:40,414 INFO L82 PathProgramCache]: Analyzing trace with hash 920726836, now seen corresponding path program 2 times [2018-12-09 00:31:40,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:40,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:40,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:31:40,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:40,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:31:40,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:31:40,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:31:40,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 00:31:40,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:31:40,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:31:40,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:31:40,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 00:31:40,464 INFO L87 Difference]: Start difference. First operand 24684 states and 77404 transitions. Second operand 7 states. [2018-12-09 00:31:40,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:31:40,585 INFO L93 Difference]: Finished difference Result 36068 states and 116298 transitions. [2018-12-09 00:31:40,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 00:31:40,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 121 [2018-12-09 00:31:40,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:31:40,600 INFO L225 Difference]: With dead ends: 36068 [2018-12-09 00:31:40,600 INFO L226 Difference]: Without dead ends: 11692 [2018-12-09 00:31:40,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-12-09 00:31:40,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11692 states. [2018-12-09 00:31:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11692 to 11692. [2018-12-09 00:31:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11692 states. [2018-12-09 00:31:40,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11692 states to 11692 states and 39565 transitions. [2018-12-09 00:31:40,717 INFO L78 Accepts]: Start accepts. Automaton has 11692 states and 39565 transitions. Word has length 121 [2018-12-09 00:31:40,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:31:40,717 INFO L480 AbstractCegarLoop]: Abstraction has 11692 states and 39565 transitions. [2018-12-09 00:31:40,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:31:40,718 INFO L276 IsEmpty]: Start isEmpty. Operand 11692 states and 39565 transitions. [2018-12-09 00:31:40,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-09 00:31:40,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:31:40,728 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:31:40,728 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:31:40,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:31:40,728 INFO L82 PathProgramCache]: Analyzing trace with hash -608268126, now seen corresponding path program 3 times [2018-12-09 00:31:40,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:31:40,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:40,730 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 00:31:40,730 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:31:40,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:31:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:31:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 00:31:40,774 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 00:31:40,860 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 00:31:40,861 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:31:40 BasicIcfg [2018-12-09 00:31:40,861 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:31:40,862 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:31:40,862 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:31:40,862 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:31:40,862 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:27:22" (3/4) ... [2018-12-09 00:31:40,864 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 00:31:40,946 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ce8542e5-5fbd-44a0-8baa-91383b9c66c5/bin-2019/utaipan/witness.graphml [2018-12-09 00:31:40,946 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:31:40,947 INFO L168 Benchmark]: Toolchain (without parser) took 258774.30 ms. Allocated memory was 1.0 GB in the beginning and 8.6 GB in the end (delta: 7.6 GB). Free memory was 947.0 MB in the beginning and 6.3 GB in the end (delta: -5.3 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-12-09 00:31:40,948 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:31:40,948 INFO L168 Benchmark]: CACSL2BoogieTranslator took 329.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. [2018-12-09 00:31:40,948 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.74 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.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:31:40,948 INFO L168 Benchmark]: Boogie Preprocessor took 22.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:31:40,949 INFO L168 Benchmark]: RCFGBuilder took 411.23 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: 61.9 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. [2018-12-09 00:31:40,949 INFO L168 Benchmark]: TraceAbstraction took 257888.11 ms. Allocated memory was 1.2 GB in the beginning and 8.6 GB in the end (delta: 7.5 GB). Free memory was 1.1 GB in the beginning and 6.3 GB in the end (delta: -5.3 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-12-09 00:31:40,949 INFO L168 Benchmark]: Witness Printer took 84.37 ms. Allocated memory is still 8.6 GB. Free memory was 6.3 GB in the beginning and 6.3 GB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. [2018-12-09 00:31:40,950 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 329.67 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -175.3 MB). Peak memory consumption was 37.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.74 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.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.80 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 411.23 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: 61.9 MB). Peak memory consumption was 61.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 257888.11 ms. Allocated memory was 1.2 GB in the beginning and 8.6 GB in the end (delta: 7.5 GB). Free memory was 1.1 GB in the beginning and 6.3 GB in the end (delta: -5.3 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 84.37 ms. Allocated memory is still 8.6 GB. Free memory was 6.3 GB in the beginning and 6.3 GB in the end (delta: 58.9 MB). Peak memory consumption was 58.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L676] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L677] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0] [L678] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L680] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L682] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L683] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L684] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L685] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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] [L686] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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] [L687] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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] [L688] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L794] -1 pthread_t t768; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] FCALL, FORK -1 pthread_create(&t768, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] -1 pthread_t t769; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_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_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] FCALL, FORK -1 pthread_create(&t769, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] -1 pthread_t t770; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] FCALL, FORK -1 pthread_create(&t770, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 y$w_buff1 = y$w_buff0 [L742] 0 y$w_buff0 = 2 [L743] 0 y$w_buff1_used = y$w_buff0_used [L744] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L746] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 0 y$r_buff0_thd3 = (_Bool)1 [L753] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L754] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L755] 0 y$flush_delayed = weak$$choice2 [L756] 0 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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_thd3 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L758] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L762] EXPR 0 weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L762] 0 y$r_buff0_thd3 = weak$$choice2 ? y$r_buff0_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff0_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3)) [L763] EXPR 0 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L763] 0 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L764] 0 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, 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=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] 1 z = 1 [L709] 1 x = 1 [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 2 x = 2 [L724] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] EXPR 2 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=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L727] EXPR 2 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=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L727] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L729] EXPR 2 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 2 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 [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L731] EXPR 2 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_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] 2 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 [L734] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L773] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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_thd3 ? (_Bool)0 : y$w_buff0_used [L774] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, 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_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L775] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L776] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L776] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L779] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L805] -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) [L806] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L807] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] -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 [L808] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L809] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -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 [L812] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L813] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L814] -1 y$flush_delayed = weak$$choice2 [L815] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L817] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L817] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L818] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L818] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L819] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L819] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L820] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L821] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L822] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L823] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] -1 y = y$flush_delayed ? y$mem_tmp : y [L825] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 283 locations, 3 error locations. UNSAFE Result, 257.7s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 44.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8573 SDtfs, 9264 SDslu, 18389 SDs, 0 SdLazy, 4435 SolverSat, 352 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 63 SyntacticMatches, 28 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=549408occurred in iteration=2, 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: 116.0s AutomataMinimizationTime, 27 MinimizatonAttempts, 834436 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2926 NumberOfCodeBlocks, 2926 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2778 ConstructedInterpolants, 0 QuantifiedInterpolants, 736782 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...