./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_tso.opt_true-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_381e9630-7f47-457a-8550-2547d6b1011e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_381e9630-7f47-457a-8550-2547d6b1011e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_381e9630-7f47-457a-8550-2547d6b1011e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_381e9630-7f47-457a-8550-2547d6b1011e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_tso.opt_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_381e9630-7f47-457a-8550-2547d6b1011e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_381e9630-7f47-457a-8550-2547d6b1011e/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 790725247cef75c6754a6505b2fc4c22454b4126 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-02 18:48:19,262 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 18:48:19,263 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 18:48:19,269 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 18:48:19,269 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 18:48:19,270 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 18:48:19,270 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 18:48:19,271 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 18:48:19,272 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 18:48:19,273 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 18:48:19,273 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 18:48:19,273 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 18:48:19,274 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 18:48:19,274 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 18:48:19,275 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 18:48:19,275 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 18:48:19,276 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 18:48:19,276 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 18:48:19,277 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 18:48:19,278 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 18:48:19,279 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 18:48:19,279 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 18:48:19,281 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 18:48:19,281 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 18:48:19,281 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 18:48:19,281 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 18:48:19,282 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 18:48:19,282 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 18:48:19,283 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 18:48:19,283 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 18:48:19,283 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 18:48:19,284 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 18:48:19,284 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 18:48:19,284 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 18:48:19,285 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 18:48:19,285 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 18:48:19,285 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_381e9630-7f47-457a-8550-2547d6b1011e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 18:48:19,292 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 18:48:19,292 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 18:48:19,293 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 18:48:19,293 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 18:48:19,293 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 18:48:19,293 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 18:48:19,293 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 18:48:19,293 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 18:48:19,294 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 18:48:19,294 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 18:48:19,294 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 18:48:19,294 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 18:48:19,294 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 18:48:19,294 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 18:48:19,295 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 18:48:19,295 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 18:48:19,295 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 18:48:19,295 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 18:48:19,295 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 18:48:19,295 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 18:48:19,295 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 18:48:19,295 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 18:48:19,295 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 18:48:19,296 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 18:48:19,296 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 18:48:19,296 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 18:48:19,296 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 18:48:19,296 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 18:48:19,296 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 18:48:19,296 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 18:48:19,296 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 18:48:19,296 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 18:48:19,297 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 18:48:19,297 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 18:48:19,297 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 18:48:19,297 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 18:48:19,297 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_381e9630-7f47-457a-8550-2547d6b1011e/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 -> 790725247cef75c6754a6505b2fc4c22454b4126 [2018-12-02 18:48:19,314 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 18:48:19,321 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 18:48:19,323 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 18:48:19,324 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 18:48:19,324 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 18:48:19,325 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_381e9630-7f47-457a-8550-2547d6b1011e/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi000_tso.opt_true-unreach-call.i [2018-12-02 18:48:19,359 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_381e9630-7f47-457a-8550-2547d6b1011e/bin-2019/utaipan/data/586a04cda/5570438bedf34a60af553ad9608151ec/FLAGdefeaf9bc [2018-12-02 18:48:19,735 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 18:48:19,735 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_381e9630-7f47-457a-8550-2547d6b1011e/sv-benchmarks/c/pthread-wmm/rfi000_tso.opt_true-unreach-call.i [2018-12-02 18:48:19,744 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_381e9630-7f47-457a-8550-2547d6b1011e/bin-2019/utaipan/data/586a04cda/5570438bedf34a60af553ad9608151ec/FLAGdefeaf9bc [2018-12-02 18:48:20,095 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_381e9630-7f47-457a-8550-2547d6b1011e/bin-2019/utaipan/data/586a04cda/5570438bedf34a60af553ad9608151ec [2018-12-02 18:48:20,099 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 18:48:20,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 18:48:20,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 18:48:20,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 18:48:20,106 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 18:48:20,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:48:20" (1/1) ... [2018-12-02 18:48:20,110 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@126510b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:48:20, skipping insertion in model container [2018-12-02 18:48:20,110 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 06:48:20" (1/1) ... [2018-12-02 18:48:20,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 18:48:20,143 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 18:48:20,359 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 18:48:20,369 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 18:48:20,468 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 18:48:20,500 INFO L195 MainTranslator]: Completed translation [2018-12-02 18:48:20,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:48:20 WrapperNode [2018-12-02 18:48:20,501 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 18:48:20,501 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 18:48:20,501 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 18:48:20,502 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 18:48:20,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:48:20" (1/1) ... [2018-12-02 18:48:20,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:48:20" (1/1) ... [2018-12-02 18:48:20,541 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 18:48:20,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 18:48:20,541 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 18:48:20,541 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 18:48:20,547 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:48:20" (1/1) ... [2018-12-02 18:48:20,547 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:48:20" (1/1) ... [2018-12-02 18:48:20,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:48:20" (1/1) ... [2018-12-02 18:48:20,550 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:48:20" (1/1) ... [2018-12-02 18:48:20,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:48:20" (1/1) ... [2018-12-02 18:48:20,562 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:48:20" (1/1) ... [2018-12-02 18:48:20,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:48:20" (1/1) ... [2018-12-02 18:48:20,567 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 18:48:20,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 18:48:20,568 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 18:48:20,568 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 18:48:20,568 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:48:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_381e9630-7f47-457a-8550-2547d6b1011e/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-02 18:48:20,609 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 18:48:20,609 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 18:48:20,609 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 18:48:20,609 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 18:48:20,609 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 18:48:20,609 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 18:48:20,609 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 18:48:20,610 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 18:48:20,610 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 18:48:20,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 18:48:20,610 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 18:48:20,611 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 18:48:21,011 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 18:48:21,012 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 18:48:21,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:48:21 BoogieIcfgContainer [2018-12-02 18:48:21,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 18:48:21,013 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 18:48:21,013 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 18:48:21,015 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 18:48:21,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 06:48:20" (1/3) ... [2018-12-02 18:48:21,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b10d2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:48:21, skipping insertion in model container [2018-12-02 18:48:21,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 06:48:20" (2/3) ... [2018-12-02 18:48:21,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b10d2ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 06:48:21, skipping insertion in model container [2018-12-02 18:48:21,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:48:21" (3/3) ... [2018-12-02 18:48:21,018 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_tso.opt_true-unreach-call.i [2018-12-02 18:48:21,053 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,054 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,054 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,054 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,054 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,054 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,055 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,055 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,055 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,055 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,055 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,056 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,056 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,056 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,056 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,056 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,056 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,056 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,057 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,057 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,057 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,057 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,057 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,057 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,057 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,058 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,058 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,058 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,058 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,058 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,058 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,058 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,059 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,059 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,060 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,060 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,060 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,060 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,060 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,060 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,060 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,061 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,061 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,062 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,063 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,064 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,065 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,066 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,067 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,068 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,069 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,070 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,071 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,072 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,072 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,072 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,072 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,072 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,072 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,072 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,073 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,073 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,073 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,073 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,073 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,073 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,073 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,074 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,075 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,076 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,077 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,078 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,079 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,080 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,081 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,082 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,083 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,084 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,085 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,086 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,087 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,088 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,089 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 18:48:21,093 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 18:48:21,094 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 18:48:21,100 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 18:48:21,109 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 18:48:21,124 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 18:48:21,124 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 18:48:21,124 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 18:48:21,124 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 18:48:21,124 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 18:48:21,124 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 18:48:21,124 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 18:48:21,124 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 18:48:21,132 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 226places, 306 transitions [2018-12-02 18:48:29,613 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 125048 states. [2018-12-02 18:48:29,614 INFO L276 IsEmpty]: Start isEmpty. Operand 125048 states. [2018-12-02 18:48:29,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 18:48:29,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:48:29,620 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] [2018-12-02 18:48:29,621 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:48:29,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:48:29,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1224915915, now seen corresponding path program 1 times [2018-12-02 18:48:29,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:48:29,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:48:29,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:48:29,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:48:29,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:48:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:48:29,777 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-02 18:48:29,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:48:29,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 18:48:29,778 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:48:29,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 18:48:29,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 18:48:29,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 18:48:29,791 INFO L87 Difference]: Start difference. First operand 125048 states. Second operand 4 states. [2018-12-02 18:48:31,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:48:31,160 INFO L93 Difference]: Finished difference Result 240604 states and 990158 transitions. [2018-12-02 18:48:31,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 18:48:31,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-02 18:48:31,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:48:31,870 INFO L225 Difference]: With dead ends: 240604 [2018-12-02 18:48:31,870 INFO L226 Difference]: Without dead ends: 212996 [2018-12-02 18:48:31,872 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-02 18:48:35,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212996 states. [2018-12-02 18:48:37,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212996 to 112198. [2018-12-02 18:48:37,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112198 states. [2018-12-02 18:48:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112198 states to 112198 states and 465587 transitions. [2018-12-02 18:48:37,784 INFO L78 Accepts]: Start accepts. Automaton has 112198 states and 465587 transitions. Word has length 37 [2018-12-02 18:48:37,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:48:37,785 INFO L480 AbstractCegarLoop]: Abstraction has 112198 states and 465587 transitions. [2018-12-02 18:48:37,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 18:48:37,785 INFO L276 IsEmpty]: Start isEmpty. Operand 112198 states and 465587 transitions. [2018-12-02 18:48:37,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-02 18:48:37,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:48:37,788 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-02 18:48:37,788 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:48:37,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:48:37,788 INFO L82 PathProgramCache]: Analyzing trace with hash -694802140, now seen corresponding path program 1 times [2018-12-02 18:48:37,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:48:37,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:48:37,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:48:37,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:48:37,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:48:37,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:48:37,842 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-02 18:48:37,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:48:37,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 18:48:37,842 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:48:37,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 18:48:37,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 18:48:37,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 18:48:37,844 INFO L87 Difference]: Start difference. First operand 112198 states and 465587 transitions. Second operand 5 states. [2018-12-02 18:48:39,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:48:39,831 INFO L93 Difference]: Finished difference Result 337662 states and 1310633 transitions. [2018-12-02 18:48:39,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 18:48:39,832 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-02 18:48:39,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:48:40,624 INFO L225 Difference]: With dead ends: 337662 [2018-12-02 18:48:40,624 INFO L226 Difference]: Without dead ends: 337502 [2018-12-02 18:48:40,625 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-02 18:48:43,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337502 states. [2018-12-02 18:48:48,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337502 to 182336. [2018-12-02 18:48:48,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182336 states. [2018-12-02 18:48:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182336 states to 182336 states and 707538 transitions. [2018-12-02 18:48:48,800 INFO L78 Accepts]: Start accepts. Automaton has 182336 states and 707538 transitions. Word has length 44 [2018-12-02 18:48:48,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:48:48,801 INFO L480 AbstractCegarLoop]: Abstraction has 182336 states and 707538 transitions. [2018-12-02 18:48:48,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 18:48:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 182336 states and 707538 transitions. [2018-12-02 18:48:48,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 18:48:48,804 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:48:48,804 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] [2018-12-02 18:48:48,805 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:48:48,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:48:48,805 INFO L82 PathProgramCache]: Analyzing trace with hash -7464308, now seen corresponding path program 1 times [2018-12-02 18:48:48,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:48:48,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:48:48,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:48:48,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:48:48,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:48:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:48:48,860 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-02 18:48:48,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:48:48,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 18:48:48,860 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:48:48,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 18:48:48,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 18:48:48,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 18:48:48,861 INFO L87 Difference]: Start difference. First operand 182336 states and 707538 transitions. Second operand 4 states. [2018-12-02 18:48:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:48:48,990 INFO L93 Difference]: Finished difference Result 39892 states and 138215 transitions. [2018-12-02 18:48:48,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 18:48:48,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-02 18:48:48,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:48:49,350 INFO L225 Difference]: With dead ends: 39892 [2018-12-02 18:48:49,351 INFO L226 Difference]: Without dead ends: 37019 [2018-12-02 18:48:49,351 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-02 18:48:49,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37019 states. [2018-12-02 18:48:49,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37019 to 37019. [2018-12-02 18:48:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37019 states. [2018-12-02 18:48:49,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37019 states to 37019 states and 128876 transitions. [2018-12-02 18:48:49,792 INFO L78 Accepts]: Start accepts. Automaton has 37019 states and 128876 transitions. Word has length 45 [2018-12-02 18:48:49,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:48:49,792 INFO L480 AbstractCegarLoop]: Abstraction has 37019 states and 128876 transitions. [2018-12-02 18:48:49,792 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 18:48:49,792 INFO L276 IsEmpty]: Start isEmpty. Operand 37019 states and 128876 transitions. [2018-12-02 18:48:49,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 18:48:49,795 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:48:49,795 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] [2018-12-02 18:48:49,795 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:48:49,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:48:49,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1439202624, now seen corresponding path program 1 times [2018-12-02 18:48:49,795 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:48:49,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:48:49,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:48:49,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:48:49,797 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:48:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:48:49,833 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-02 18:48:49,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:48:49,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 18:48:49,834 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:48:49,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 18:48:49,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 18:48:49,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 18:48:49,834 INFO L87 Difference]: Start difference. First operand 37019 states and 128876 transitions. Second operand 4 states. [2018-12-02 18:48:50,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:48:50,144 INFO L93 Difference]: Finished difference Result 49059 states and 166861 transitions. [2018-12-02 18:48:50,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 18:48:50,145 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-02 18:48:50,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:48:50,209 INFO L225 Difference]: With dead ends: 49059 [2018-12-02 18:48:50,209 INFO L226 Difference]: Without dead ends: 49059 [2018-12-02 18:48:50,209 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 18:48:50,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49059 states. [2018-12-02 18:48:50,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49059 to 42063. [2018-12-02 18:48:50,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42063 states. [2018-12-02 18:48:50,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42063 states to 42063 states and 144442 transitions. [2018-12-02 18:48:50,767 INFO L78 Accepts]: Start accepts. Automaton has 42063 states and 144442 transitions. Word has length 58 [2018-12-02 18:48:50,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:48:50,767 INFO L480 AbstractCegarLoop]: Abstraction has 42063 states and 144442 transitions. [2018-12-02 18:48:50,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 18:48:50,767 INFO L276 IsEmpty]: Start isEmpty. Operand 42063 states and 144442 transitions. [2018-12-02 18:48:50,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 18:48:50,771 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:48:50,771 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] [2018-12-02 18:48:50,771 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:48:50,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:48:50,772 INFO L82 PathProgramCache]: Analyzing trace with hash -340567146, now seen corresponding path program 1 times [2018-12-02 18:48:50,772 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:48:50,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:48:50,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:48:50,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:48:50,773 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:48:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:48:50,816 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-02 18:48:50,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:48:50,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 18:48:50,816 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:48:50,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 18:48:50,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 18:48:50,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 18:48:50,817 INFO L87 Difference]: Start difference. First operand 42063 states and 144442 transitions. Second operand 4 states. [2018-12-02 18:48:51,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:48:51,578 INFO L93 Difference]: Finished difference Result 49638 states and 166843 transitions. [2018-12-02 18:48:51,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 18:48:51,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-02 18:48:51,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:48:51,651 INFO L225 Difference]: With dead ends: 49638 [2018-12-02 18:48:51,651 INFO L226 Difference]: Without dead ends: 49638 [2018-12-02 18:48:51,651 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 18:48:51,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49638 states. [2018-12-02 18:48:52,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49638 to 46731. [2018-12-02 18:48:52,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46731 states. [2018-12-02 18:48:52,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46731 states to 46731 states and 158580 transitions. [2018-12-02 18:48:52,226 INFO L78 Accepts]: Start accepts. Automaton has 46731 states and 158580 transitions. Word has length 58 [2018-12-02 18:48:52,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:48:52,226 INFO L480 AbstractCegarLoop]: Abstraction has 46731 states and 158580 transitions. [2018-12-02 18:48:52,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 18:48:52,226 INFO L276 IsEmpty]: Start isEmpty. Operand 46731 states and 158580 transitions. [2018-12-02 18:48:52,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 18:48:52,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:48:52,230 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] [2018-12-02 18:48:52,230 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:48:52,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:48:52,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1012742551, now seen corresponding path program 1 times [2018-12-02 18:48:52,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:48:52,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:48:52,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:48:52,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:48:52,232 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:48:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:48:52,272 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-02 18:48:52,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:48:52,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 18:48:52,272 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:48:52,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 18:48:52,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 18:48:52,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 18:48:52,273 INFO L87 Difference]: Start difference. First operand 46731 states and 158580 transitions. Second operand 6 states. [2018-12-02 18:48:53,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:48:53,242 INFO L93 Difference]: Finished difference Result 69263 states and 233515 transitions. [2018-12-02 18:48:53,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 18:48:53,242 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-02 18:48:53,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:48:53,343 INFO L225 Difference]: With dead ends: 69263 [2018-12-02 18:48:53,343 INFO L226 Difference]: Without dead ends: 69231 [2018-12-02 18:48:53,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-02 18:48:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69231 states. [2018-12-02 18:48:54,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69231 to 55787. [2018-12-02 18:48:54,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55787 states. [2018-12-02 18:48:54,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55787 states to 55787 states and 187260 transitions. [2018-12-02 18:48:54,117 INFO L78 Accepts]: Start accepts. Automaton has 55787 states and 187260 transitions. Word has length 58 [2018-12-02 18:48:54,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:48:54,118 INFO L480 AbstractCegarLoop]: Abstraction has 55787 states and 187260 transitions. [2018-12-02 18:48:54,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 18:48:54,118 INFO L276 IsEmpty]: Start isEmpty. Operand 55787 states and 187260 transitions. [2018-12-02 18:48:54,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 18:48:54,131 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:48:54,131 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:48:54,131 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:48:54,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:48:54,132 INFO L82 PathProgramCache]: Analyzing trace with hash 1986386371, now seen corresponding path program 1 times [2018-12-02 18:48:54,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:48:54,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:48:54,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:48:54,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:48:54,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:48:54,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:48:54,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-02 18:48:54,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:48:54,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 18:48:54,175 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:48:54,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 18:48:54,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 18:48:54,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 18:48:54,175 INFO L87 Difference]: Start difference. First operand 55787 states and 187260 transitions. Second operand 4 states. [2018-12-02 18:48:54,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:48:54,895 INFO L93 Difference]: Finished difference Result 88791 states and 294033 transitions. [2018-12-02 18:48:54,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 18:48:54,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-02 18:48:54,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:48:55,024 INFO L225 Difference]: With dead ends: 88791 [2018-12-02 18:48:55,024 INFO L226 Difference]: Without dead ends: 88595 [2018-12-02 18:48:55,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 18:48:55,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88595 states. [2018-12-02 18:48:55,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88595 to 75939. [2018-12-02 18:48:55,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75939 states. [2018-12-02 18:48:56,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75939 states to 75939 states and 253670 transitions. [2018-12-02 18:48:56,073 INFO L78 Accepts]: Start accepts. Automaton has 75939 states and 253670 transitions. Word has length 72 [2018-12-02 18:48:56,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:48:56,073 INFO L480 AbstractCegarLoop]: Abstraction has 75939 states and 253670 transitions. [2018-12-02 18:48:56,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 18:48:56,073 INFO L276 IsEmpty]: Start isEmpty. Operand 75939 states and 253670 transitions. [2018-12-02 18:48:56,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 18:48:56,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:48:56,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:48:56,089 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:48:56,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:48:56,089 INFO L82 PathProgramCache]: Analyzing trace with hash -955271228, now seen corresponding path program 1 times [2018-12-02 18:48:56,090 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:48:56,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:48:56,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:48:56,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:48:56,091 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:48:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:48:56,199 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-02 18:48:56,199 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:48:56,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 18:48:56,200 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:48:56,200 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 18:48:56,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 18:48:56,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 18:48:56,200 INFO L87 Difference]: Start difference. First operand 75939 states and 253670 transitions. Second operand 8 states. [2018-12-02 18:48:58,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:48:58,549 INFO L93 Difference]: Finished difference Result 111793 states and 364107 transitions. [2018-12-02 18:48:58,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 18:48:58,550 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-12-02 18:48:58,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:48:58,705 INFO L225 Difference]: With dead ends: 111793 [2018-12-02 18:48:58,705 INFO L226 Difference]: Without dead ends: 111529 [2018-12-02 18:48:58,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-02 18:48:58,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111529 states. [2018-12-02 18:48:59,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111529 to 90424. [2018-12-02 18:48:59,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90424 states. [2018-12-02 18:49:00,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90424 states to 90424 states and 298936 transitions. [2018-12-02 18:49:00,001 INFO L78 Accepts]: Start accepts. Automaton has 90424 states and 298936 transitions. Word has length 72 [2018-12-02 18:49:00,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:00,001 INFO L480 AbstractCegarLoop]: Abstraction has 90424 states and 298936 transitions. [2018-12-02 18:49:00,001 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 18:49:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 90424 states and 298936 transitions. [2018-12-02 18:49:00,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 18:49:00,023 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:00,023 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:49:00,023 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:00,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:00,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1248674235, now seen corresponding path program 1 times [2018-12-02 18:49:00,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:00,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:00,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:00,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:00,025 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:00,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:00,077 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-02 18:49:00,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:00,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 18:49:00,077 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:00,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 18:49:00,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 18:49:00,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 18:49:00,078 INFO L87 Difference]: Start difference. First operand 90424 states and 298936 transitions. Second operand 7 states. [2018-12-02 18:49:01,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:01,163 INFO L93 Difference]: Finished difference Result 114912 states and 379658 transitions. [2018-12-02 18:49:01,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-02 18:49:01,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2018-12-02 18:49:01,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:01,343 INFO L225 Difference]: With dead ends: 114912 [2018-12-02 18:49:01,343 INFO L226 Difference]: Without dead ends: 114848 [2018-12-02 18:49:01,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-02 18:49:01,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114848 states. [2018-12-02 18:49:02,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114848 to 99644. [2018-12-02 18:49:02,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99644 states. [2018-12-02 18:49:02,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99644 states to 99644 states and 327295 transitions. [2018-12-02 18:49:02,798 INFO L78 Accepts]: Start accepts. Automaton has 99644 states and 327295 transitions. Word has length 72 [2018-12-02 18:49:02,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:02,799 INFO L480 AbstractCegarLoop]: Abstraction has 99644 states and 327295 transitions. [2018-12-02 18:49:02,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 18:49:02,799 INFO L276 IsEmpty]: Start isEmpty. Operand 99644 states and 327295 transitions. [2018-12-02 18:49:02,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 18:49:02,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:02,825 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] [2018-12-02 18:49:02,825 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:02,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:02,826 INFO L82 PathProgramCache]: Analyzing trace with hash 21000313, now seen corresponding path program 1 times [2018-12-02 18:49:02,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:02,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:02,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:02,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:02,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:02,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:02,847 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-02 18:49:02,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:02,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 18:49:02,847 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:02,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 18:49:02,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 18:49:02,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 18:49:02,848 INFO L87 Difference]: Start difference. First operand 99644 states and 327295 transitions. Second operand 3 states. [2018-12-02 18:49:03,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:03,329 INFO L93 Difference]: Finished difference Result 149994 states and 480376 transitions. [2018-12-02 18:49:03,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 18:49:03,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-12-02 18:49:03,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:03,561 INFO L225 Difference]: With dead ends: 149994 [2018-12-02 18:49:03,561 INFO L226 Difference]: Without dead ends: 149994 [2018-12-02 18:49:03,562 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-02 18:49:03,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149994 states. [2018-12-02 18:49:05,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149994 to 127827. [2018-12-02 18:49:05,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127827 states. [2018-12-02 18:49:05,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127827 states to 127827 states and 411652 transitions. [2018-12-02 18:49:05,665 INFO L78 Accepts]: Start accepts. Automaton has 127827 states and 411652 transitions. Word has length 74 [2018-12-02 18:49:05,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:05,665 INFO L480 AbstractCegarLoop]: Abstraction has 127827 states and 411652 transitions. [2018-12-02 18:49:05,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 18:49:05,665 INFO L276 IsEmpty]: Start isEmpty. Operand 127827 states and 411652 transitions. [2018-12-02 18:49:05,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-02 18:49:05,700 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:05,700 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:49:05,701 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:05,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:05,701 INFO L82 PathProgramCache]: Analyzing trace with hash 744217605, now seen corresponding path program 1 times [2018-12-02 18:49:05,701 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:05,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:05,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:05,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:05,703 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:05,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:05,752 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-02 18:49:05,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:05,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 18:49:05,753 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:05,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 18:49:05,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 18:49:05,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-02 18:49:05,754 INFO L87 Difference]: Start difference. First operand 127827 states and 411652 transitions. Second operand 8 states. [2018-12-02 18:49:07,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:07,515 INFO L93 Difference]: Finished difference Result 145051 states and 462606 transitions. [2018-12-02 18:49:07,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-02 18:49:07,515 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-12-02 18:49:07,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:07,740 INFO L225 Difference]: With dead ends: 145051 [2018-12-02 18:49:07,740 INFO L226 Difference]: Without dead ends: 144987 [2018-12-02 18:49:07,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-12-02 18:49:08,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144987 states. [2018-12-02 18:49:09,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144987 to 128275. [2018-12-02 18:49:09,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128275 states. [2018-12-02 18:49:09,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128275 states to 128275 states and 413192 transitions. [2018-12-02 18:49:09,486 INFO L78 Accepts]: Start accepts. Automaton has 128275 states and 413192 transitions. Word has length 78 [2018-12-02 18:49:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:09,487 INFO L480 AbstractCegarLoop]: Abstraction has 128275 states and 413192 transitions. [2018-12-02 18:49:09,487 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 18:49:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 128275 states and 413192 transitions. [2018-12-02 18:49:09,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 18:49:09,530 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:09,531 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] [2018-12-02 18:49:09,531 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:09,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:09,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1691318381, now seen corresponding path program 1 times [2018-12-02 18:49:09,531 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:09,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:09,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:09,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:09,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:09,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:09,582 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-02 18:49:09,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:09,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 18:49:09,582 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:09,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 18:49:09,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 18:49:09,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 18:49:09,583 INFO L87 Difference]: Start difference. First operand 128275 states and 413192 transitions. Second operand 6 states. [2018-12-02 18:49:10,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:10,607 INFO L93 Difference]: Finished difference Result 160065 states and 514282 transitions. [2018-12-02 18:49:10,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 18:49:10,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-12-02 18:49:10,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:10,842 INFO L225 Difference]: With dead ends: 160065 [2018-12-02 18:49:10,842 INFO L226 Difference]: Without dead ends: 160065 [2018-12-02 18:49:10,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 18:49:11,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160065 states. [2018-12-02 18:49:12,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160065 to 130671. [2018-12-02 18:49:12,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130671 states. [2018-12-02 18:49:12,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130671 states to 130671 states and 420722 transitions. [2018-12-02 18:49:12,660 INFO L78 Accepts]: Start accepts. Automaton has 130671 states and 420722 transitions. Word has length 81 [2018-12-02 18:49:12,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:12,660 INFO L480 AbstractCegarLoop]: Abstraction has 130671 states and 420722 transitions. [2018-12-02 18:49:12,660 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 18:49:12,660 INFO L276 IsEmpty]: Start isEmpty. Operand 130671 states and 420722 transitions. [2018-12-02 18:49:12,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 18:49:12,703 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:12,703 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] [2018-12-02 18:49:12,704 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:12,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:12,704 INFO L82 PathProgramCache]: Analyzing trace with hash -878168018, now seen corresponding path program 1 times [2018-12-02 18:49:12,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:12,705 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:12,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:12,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:12,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:12,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:12,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:49:12,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:12,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 18:49:12,742 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:12,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 18:49:12,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 18:49:12,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 18:49:12,742 INFO L87 Difference]: Start difference. First operand 130671 states and 420722 transitions. Second operand 3 states. [2018-12-02 18:49:13,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:13,164 INFO L93 Difference]: Finished difference Result 126035 states and 401713 transitions. [2018-12-02 18:49:13,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 18:49:13,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-02 18:49:13,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:13,356 INFO L225 Difference]: With dead ends: 126035 [2018-12-02 18:49:13,357 INFO L226 Difference]: Without dead ends: 125771 [2018-12-02 18:49:13,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 18:49:13,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125771 states. [2018-12-02 18:49:14,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125771 to 125563. [2018-12-02 18:49:14,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125563 states. [2018-12-02 18:49:15,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125563 states to 125563 states and 400455 transitions. [2018-12-02 18:49:15,061 INFO L78 Accepts]: Start accepts. Automaton has 125563 states and 400455 transitions. Word has length 81 [2018-12-02 18:49:15,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:15,061 INFO L480 AbstractCegarLoop]: Abstraction has 125563 states and 400455 transitions. [2018-12-02 18:49:15,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 18:49:15,061 INFO L276 IsEmpty]: Start isEmpty. Operand 125563 states and 400455 transitions. [2018-12-02 18:49:15,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 18:49:15,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:15,104 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] [2018-12-02 18:49:15,104 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:15,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:15,104 INFO L82 PathProgramCache]: Analyzing trace with hash 1825660350, now seen corresponding path program 1 times [2018-12-02 18:49:15,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:15,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:15,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:15,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:15,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:15,172 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-02 18:49:15,172 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:15,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 18:49:15,172 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:15,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 18:49:15,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 18:49:15,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 18:49:15,173 INFO L87 Difference]: Start difference. First operand 125563 states and 400455 transitions. Second operand 6 states. [2018-12-02 18:49:15,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:15,994 INFO L93 Difference]: Finished difference Result 126351 states and 402250 transitions. [2018-12-02 18:49:15,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 18:49:15,994 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-12-02 18:49:15,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:16,183 INFO L225 Difference]: With dead ends: 126351 [2018-12-02 18:49:16,183 INFO L226 Difference]: Without dead ends: 126351 [2018-12-02 18:49:16,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 18:49:16,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126351 states. [2018-12-02 18:49:17,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126351 to 124144. [2018-12-02 18:49:17,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124144 states. [2018-12-02 18:49:17,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124144 states to 124144 states and 396466 transitions. [2018-12-02 18:49:17,856 INFO L78 Accepts]: Start accepts. Automaton has 124144 states and 396466 transitions. Word has length 81 [2018-12-02 18:49:17,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:17,857 INFO L480 AbstractCegarLoop]: Abstraction has 124144 states and 396466 transitions. [2018-12-02 18:49:17,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 18:49:17,857 INFO L276 IsEmpty]: Start isEmpty. Operand 124144 states and 396466 transitions. [2018-12-02 18:49:17,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 18:49:17,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:17,897 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] [2018-12-02 18:49:17,897 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:17,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:17,897 INFO L82 PathProgramCache]: Analyzing trace with hash -109999937, now seen corresponding path program 1 times [2018-12-02 18:49:17,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:17,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:17,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:17,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:17,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:17,956 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-02 18:49:17,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:17,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 18:49:17,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:17,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 18:49:17,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 18:49:17,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 18:49:17,957 INFO L87 Difference]: Start difference. First operand 124144 states and 396466 transitions. Second operand 7 states. [2018-12-02 18:49:18,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:18,839 INFO L93 Difference]: Finished difference Result 131826 states and 419584 transitions. [2018-12-02 18:49:18,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 18:49:18,839 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-12-02 18:49:18,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:19,048 INFO L225 Difference]: With dead ends: 131826 [2018-12-02 18:49:19,049 INFO L226 Difference]: Without dead ends: 131826 [2018-12-02 18:49:19,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 18:49:19,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131826 states. [2018-12-02 18:49:20,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131826 to 126150. [2018-12-02 18:49:20,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126150 states. [2018-12-02 18:49:20,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126150 states to 126150 states and 402000 transitions. [2018-12-02 18:49:20,985 INFO L78 Accepts]: Start accepts. Automaton has 126150 states and 402000 transitions. Word has length 81 [2018-12-02 18:49:20,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:20,985 INFO L480 AbstractCegarLoop]: Abstraction has 126150 states and 402000 transitions. [2018-12-02 18:49:20,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 18:49:20,985 INFO L276 IsEmpty]: Start isEmpty. Operand 126150 states and 402000 transitions. [2018-12-02 18:49:21,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 18:49:21,024 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:21,024 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] [2018-12-02 18:49:21,024 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:21,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:21,024 INFO L82 PathProgramCache]: Analyzing trace with hash 219765824, now seen corresponding path program 1 times [2018-12-02 18:49:21,025 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:21,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:21,026 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:21,026 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:21,026 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:21,057 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-02 18:49:21,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:21,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 18:49:21,058 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:21,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 18:49:21,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 18:49:21,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 18:49:21,058 INFO L87 Difference]: Start difference. First operand 126150 states and 402000 transitions. Second operand 5 states. [2018-12-02 18:49:21,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:21,105 INFO L93 Difference]: Finished difference Result 15022 states and 38122 transitions. [2018-12-02 18:49:21,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 18:49:21,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-12-02 18:49:21,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:21,114 INFO L225 Difference]: With dead ends: 15022 [2018-12-02 18:49:21,114 INFO L226 Difference]: Without dead ends: 11832 [2018-12-02 18:49:21,114 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-02 18:49:21,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11832 states. [2018-12-02 18:49:21,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11832 to 9190. [2018-12-02 18:49:21,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9190 states. [2018-12-02 18:49:21,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9190 states to 9190 states and 23229 transitions. [2018-12-02 18:49:21,196 INFO L78 Accepts]: Start accepts. Automaton has 9190 states and 23229 transitions. Word has length 81 [2018-12-02 18:49:21,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:21,196 INFO L480 AbstractCegarLoop]: Abstraction has 9190 states and 23229 transitions. [2018-12-02 18:49:21,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 18:49:21,196 INFO L276 IsEmpty]: Start isEmpty. Operand 9190 states and 23229 transitions. [2018-12-02 18:49:21,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-02 18:49:21,202 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:21,202 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, 1, 1, 1, 1] [2018-12-02 18:49:21,202 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:21,203 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:21,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1241095565, now seen corresponding path program 1 times [2018-12-02 18:49:21,203 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:21,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:21,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:21,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:21,204 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:21,271 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-02 18:49:21,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:21,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 18:49:21,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:21,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 18:49:21,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 18:49:21,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-02 18:49:21,272 INFO L87 Difference]: Start difference. First operand 9190 states and 23229 transitions. Second operand 7 states. [2018-12-02 18:49:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:21,562 INFO L93 Difference]: Finished difference Result 10010 states and 25092 transitions. [2018-12-02 18:49:21,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 18:49:21,563 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2018-12-02 18:49:21,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:21,570 INFO L225 Difference]: With dead ends: 10010 [2018-12-02 18:49:21,570 INFO L226 Difference]: Without dead ends: 10010 [2018-12-02 18:49:21,570 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-02 18:49:21,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10010 states. [2018-12-02 18:49:21,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10010 to 9262. [2018-12-02 18:49:21,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9262 states. [2018-12-02 18:49:21,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9262 states to 9262 states and 23391 transitions. [2018-12-02 18:49:21,640 INFO L78 Accepts]: Start accepts. Automaton has 9262 states and 23391 transitions. Word has length 125 [2018-12-02 18:49:21,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:21,640 INFO L480 AbstractCegarLoop]: Abstraction has 9262 states and 23391 transitions. [2018-12-02 18:49:21,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 18:49:21,640 INFO L276 IsEmpty]: Start isEmpty. Operand 9262 states and 23391 transitions. [2018-12-02 18:49:21,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-02 18:49:21,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:21,646 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, 1, 1, 1, 1] [2018-12-02 18:49:21,646 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:21,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:21,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1446211312, now seen corresponding path program 1 times [2018-12-02 18:49:21,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:21,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:21,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:21,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:21,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:21,687 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-02 18:49:21,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:21,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 18:49:21,688 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:21,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 18:49:21,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 18:49:21,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 18:49:21,688 INFO L87 Difference]: Start difference. First operand 9262 states and 23391 transitions. Second operand 5 states. [2018-12-02 18:49:21,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:21,927 INFO L93 Difference]: Finished difference Result 9908 states and 24738 transitions. [2018-12-02 18:49:21,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 18:49:21,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2018-12-02 18:49:21,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:21,934 INFO L225 Difference]: With dead ends: 9908 [2018-12-02 18:49:21,934 INFO L226 Difference]: Without dead ends: 9908 [2018-12-02 18:49:21,934 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-02 18:49:21,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9908 states. [2018-12-02 18:49:21,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9908 to 9531. [2018-12-02 18:49:21,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9531 states. [2018-12-02 18:49:22,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9531 states to 9531 states and 23965 transitions. [2018-12-02 18:49:22,007 INFO L78 Accepts]: Start accepts. Automaton has 9531 states and 23965 transitions. Word has length 125 [2018-12-02 18:49:22,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:22,007 INFO L480 AbstractCegarLoop]: Abstraction has 9531 states and 23965 transitions. [2018-12-02 18:49:22,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 18:49:22,007 INFO L276 IsEmpty]: Start isEmpty. Operand 9531 states and 23965 transitions. [2018-12-02 18:49:22,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-02 18:49:22,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:22,013 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, 1, 1, 1, 1] [2018-12-02 18:49:22,013 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:22,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:22,014 INFO L82 PathProgramCache]: Analyzing trace with hash -40867375, now seen corresponding path program 1 times [2018-12-02 18:49:22,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:22,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:22,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:22,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:22,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:22,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:22,051 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-02 18:49:22,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:22,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 18:49:22,051 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:22,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 18:49:22,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 18:49:22,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 18:49:22,052 INFO L87 Difference]: Start difference. First operand 9531 states and 23965 transitions. Second operand 4 states. [2018-12-02 18:49:22,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:22,185 INFO L93 Difference]: Finished difference Result 10128 states and 25362 transitions. [2018-12-02 18:49:22,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 18:49:22,185 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-12-02 18:49:22,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:22,194 INFO L225 Difference]: With dead ends: 10128 [2018-12-02 18:49:22,194 INFO L226 Difference]: Without dead ends: 10100 [2018-12-02 18:49:22,194 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-02 18:49:22,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10100 states. [2018-12-02 18:49:22,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10100 to 9754. [2018-12-02 18:49:22,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9754 states. [2018-12-02 18:49:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9754 states to 9754 states and 24467 transitions. [2018-12-02 18:49:22,275 INFO L78 Accepts]: Start accepts. Automaton has 9754 states and 24467 transitions. Word has length 125 [2018-12-02 18:49:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:22,275 INFO L480 AbstractCegarLoop]: Abstraction has 9754 states and 24467 transitions. [2018-12-02 18:49:22,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 18:49:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 9754 states and 24467 transitions. [2018-12-02 18:49:22,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-02 18:49:22,281 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:22,281 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, 1, 1, 1, 1] [2018-12-02 18:49:22,281 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:22,282 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:22,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1224214672, now seen corresponding path program 1 times [2018-12-02 18:49:22,282 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:22,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:22,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:22,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:22,282 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:22,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:22,369 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-02 18:49:22,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:22,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 18:49:22,369 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:22,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 18:49:22,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 18:49:22,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 18:49:22,369 INFO L87 Difference]: Start difference. First operand 9754 states and 24467 transitions. Second operand 8 states. [2018-12-02 18:49:24,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:24,396 INFO L93 Difference]: Finished difference Result 26186 states and 62182 transitions. [2018-12-02 18:49:24,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-02 18:49:24,396 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 125 [2018-12-02 18:49:24,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:24,415 INFO L225 Difference]: With dead ends: 26186 [2018-12-02 18:49:24,415 INFO L226 Difference]: Without dead ends: 25944 [2018-12-02 18:49:24,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2018-12-02 18:49:24,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25944 states. [2018-12-02 18:49:24,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25944 to 17342. [2018-12-02 18:49:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17342 states. [2018-12-02 18:49:24,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17342 states to 17342 states and 43112 transitions. [2018-12-02 18:49:24,611 INFO L78 Accepts]: Start accepts. Automaton has 17342 states and 43112 transitions. Word has length 125 [2018-12-02 18:49:24,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:24,612 INFO L480 AbstractCegarLoop]: Abstraction has 17342 states and 43112 transitions. [2018-12-02 18:49:24,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 18:49:24,612 INFO L276 IsEmpty]: Start isEmpty. Operand 17342 states and 43112 transitions. [2018-12-02 18:49:24,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-02 18:49:24,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:24,624 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, 1, 1, 1, 1] [2018-12-02 18:49:24,624 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:24,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:24,624 INFO L82 PathProgramCache]: Analyzing trace with hash -835819147, now seen corresponding path program 1 times [2018-12-02 18:49:24,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:24,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:24,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:24,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:24,625 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:24,672 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-02 18:49:24,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:24,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 18:49:24,672 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:24,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 18:49:24,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 18:49:24,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-02 18:49:24,673 INFO L87 Difference]: Start difference. First operand 17342 states and 43112 transitions. Second operand 6 states. [2018-12-02 18:49:25,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:25,283 INFO L93 Difference]: Finished difference Result 38796 states and 95861 transitions. [2018-12-02 18:49:25,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 18:49:25,284 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-12-02 18:49:25,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:25,316 INFO L225 Difference]: With dead ends: 38796 [2018-12-02 18:49:25,316 INFO L226 Difference]: Without dead ends: 38796 [2018-12-02 18:49:25,316 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-02 18:49:25,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38796 states. [2018-12-02 18:49:25,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38796 to 19128. [2018-12-02 18:49:25,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19128 states. [2018-12-02 18:49:25,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19128 states to 19128 states and 47668 transitions. [2018-12-02 18:49:25,562 INFO L78 Accepts]: Start accepts. Automaton has 19128 states and 47668 transitions. Word has length 125 [2018-12-02 18:49:25,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:25,562 INFO L480 AbstractCegarLoop]: Abstraction has 19128 states and 47668 transitions. [2018-12-02 18:49:25,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 18:49:25,562 INFO L276 IsEmpty]: Start isEmpty. Operand 19128 states and 47668 transitions. [2018-12-02 18:49:25,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-02 18:49:25,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:25,575 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, 1, 1, 1, 1] [2018-12-02 18:49:25,575 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:25,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:25,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1884308971, now seen corresponding path program 1 times [2018-12-02 18:49:25,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:25,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:25,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:25,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:25,577 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:25,631 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-02 18:49:25,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:25,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 18:49:25,632 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:25,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 18:49:25,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 18:49:25,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 18:49:25,633 INFO L87 Difference]: Start difference. First operand 19128 states and 47668 transitions. Second operand 6 states. [2018-12-02 18:49:25,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:25,934 INFO L93 Difference]: Finished difference Result 20465 states and 50483 transitions. [2018-12-02 18:49:25,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 18:49:25,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-12-02 18:49:25,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:25,960 INFO L225 Difference]: With dead ends: 20465 [2018-12-02 18:49:25,960 INFO L226 Difference]: Without dead ends: 20465 [2018-12-02 18:49:25,960 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-02 18:49:25,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20465 states. [2018-12-02 18:49:26,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20465 to 19186. [2018-12-02 18:49:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19186 states. [2018-12-02 18:49:26,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19186 states to 19186 states and 47784 transitions. [2018-12-02 18:49:26,160 INFO L78 Accepts]: Start accepts. Automaton has 19186 states and 47784 transitions. Word has length 125 [2018-12-02 18:49:26,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:26,160 INFO L480 AbstractCegarLoop]: Abstraction has 19186 states and 47784 transitions. [2018-12-02 18:49:26,160 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 18:49:26,160 INFO L276 IsEmpty]: Start isEmpty. Operand 19186 states and 47784 transitions. [2018-12-02 18:49:26,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-02 18:49:26,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:26,172 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, 1, 1, 1, 1] [2018-12-02 18:49:26,172 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:26,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:26,173 INFO L82 PathProgramCache]: Analyzing trace with hash -855839804, now seen corresponding path program 1 times [2018-12-02 18:49:26,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:26,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:26,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:26,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:26,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:26,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:26,243 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-02 18:49:26,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:26,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 18:49:26,243 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:26,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 18:49:26,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 18:49:26,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 18:49:26,244 INFO L87 Difference]: Start difference. First operand 19186 states and 47784 transitions. Second operand 8 states. [2018-12-02 18:49:26,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:26,595 INFO L93 Difference]: Finished difference Result 28711 states and 70319 transitions. [2018-12-02 18:49:26,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 18:49:26,595 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 125 [2018-12-02 18:49:26,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:26,618 INFO L225 Difference]: With dead ends: 28711 [2018-12-02 18:49:26,618 INFO L226 Difference]: Without dead ends: 28632 [2018-12-02 18:49:26,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-02 18:49:26,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28632 states. [2018-12-02 18:49:26,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28632 to 23771. [2018-12-02 18:49:26,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23771 states. [2018-12-02 18:49:26,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23771 states to 23771 states and 59039 transitions. [2018-12-02 18:49:26,850 INFO L78 Accepts]: Start accepts. Automaton has 23771 states and 59039 transitions. Word has length 125 [2018-12-02 18:49:26,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:26,850 INFO L480 AbstractCegarLoop]: Abstraction has 23771 states and 59039 transitions. [2018-12-02 18:49:26,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 18:49:26,850 INFO L276 IsEmpty]: Start isEmpty. Operand 23771 states and 59039 transitions. [2018-12-02 18:49:26,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-02 18:49:26,866 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:26,867 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, 1, 1, 1, 1] [2018-12-02 18:49:26,867 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:26,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:26,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1719044832, now seen corresponding path program 2 times [2018-12-02 18:49:26,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:26,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:26,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:26,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:26,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:26,947 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-02 18:49:26,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:26,947 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 18:49:26,947 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:26,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 18:49:26,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 18:49:26,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-02 18:49:26,948 INFO L87 Difference]: Start difference. First operand 23771 states and 59039 transitions. Second operand 9 states. [2018-12-02 18:49:27,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:27,495 INFO L93 Difference]: Finished difference Result 25846 states and 63640 transitions. [2018-12-02 18:49:27,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 18:49:27,496 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2018-12-02 18:49:27,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:27,515 INFO L225 Difference]: With dead ends: 25846 [2018-12-02 18:49:27,515 INFO L226 Difference]: Without dead ends: 25846 [2018-12-02 18:49:27,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-12-02 18:49:27,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25846 states. [2018-12-02 18:49:27,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25846 to 24433. [2018-12-02 18:49:27,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24433 states. [2018-12-02 18:49:27,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24433 states to 24433 states and 60587 transitions. [2018-12-02 18:49:27,720 INFO L78 Accepts]: Start accepts. Automaton has 24433 states and 60587 transitions. Word has length 125 [2018-12-02 18:49:27,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:27,721 INFO L480 AbstractCegarLoop]: Abstraction has 24433 states and 60587 transitions. [2018-12-02 18:49:27,721 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 18:49:27,721 INFO L276 IsEmpty]: Start isEmpty. Operand 24433 states and 60587 transitions. [2018-12-02 18:49:27,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-02 18:49:27,736 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:27,736 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, 1, 1, 1, 1] [2018-12-02 18:49:27,736 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:27,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:27,736 INFO L82 PathProgramCache]: Analyzing trace with hash -2048810593, now seen corresponding path program 1 times [2018-12-02 18:49:27,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:27,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:27,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 18:49:27,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:27,737 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:27,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:27,851 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-02 18:49:27,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:27,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 18:49:27,851 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:27,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 18:49:27,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 18:49:27,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-02 18:49:27,852 INFO L87 Difference]: Start difference. First operand 24433 states and 60587 transitions. Second operand 9 states. [2018-12-02 18:49:28,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:28,479 INFO L93 Difference]: Finished difference Result 29203 states and 71067 transitions. [2018-12-02 18:49:28,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-02 18:49:28,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2018-12-02 18:49:28,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:28,502 INFO L225 Difference]: With dead ends: 29203 [2018-12-02 18:49:28,502 INFO L226 Difference]: Without dead ends: 29118 [2018-12-02 18:49:28,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-12-02 18:49:28,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29118 states. [2018-12-02 18:49:28,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29118 to 26341. [2018-12-02 18:49:28,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26341 states. [2018-12-02 18:49:28,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26341 states to 26341 states and 64947 transitions. [2018-12-02 18:49:28,753 INFO L78 Accepts]: Start accepts. Automaton has 26341 states and 64947 transitions. Word has length 125 [2018-12-02 18:49:28,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:28,753 INFO L480 AbstractCegarLoop]: Abstraction has 26341 states and 64947 transitions. [2018-12-02 18:49:28,753 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 18:49:28,753 INFO L276 IsEmpty]: Start isEmpty. Operand 26341 states and 64947 transitions. [2018-12-02 18:49:28,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-02 18:49:28,775 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:28,775 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, 1, 1, 1, 1] [2018-12-02 18:49:28,775 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:28,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:28,775 INFO L82 PathProgramCache]: Analyzing trace with hash -604502304, now seen corresponding path program 1 times [2018-12-02 18:49:28,775 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:28,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:28,776 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:28,776 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:28,776 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:28,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:28,853 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-02 18:49:28,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:28,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 18:49:28,853 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:28,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 18:49:28,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 18:49:28,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 18:49:28,854 INFO L87 Difference]: Start difference. First operand 26341 states and 64947 transitions. Second operand 6 states. [2018-12-02 18:49:29,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:29,049 INFO L93 Difference]: Finished difference Result 13137 states and 31368 transitions. [2018-12-02 18:49:29,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 18:49:29,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-12-02 18:49:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:29,058 INFO L225 Difference]: With dead ends: 13137 [2018-12-02 18:49:29,058 INFO L226 Difference]: Without dead ends: 13137 [2018-12-02 18:49:29,058 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-02 18:49:29,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13137 states. [2018-12-02 18:49:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13137 to 9814. [2018-12-02 18:49:29,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9814 states. [2018-12-02 18:49:29,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9814 states to 9814 states and 23462 transitions. [2018-12-02 18:49:29,141 INFO L78 Accepts]: Start accepts. Automaton has 9814 states and 23462 transitions. Word has length 125 [2018-12-02 18:49:29,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:29,141 INFO L480 AbstractCegarLoop]: Abstraction has 9814 states and 23462 transitions. [2018-12-02 18:49:29,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 18:49:29,142 INFO L276 IsEmpty]: Start isEmpty. Operand 9814 states and 23462 transitions. [2018-12-02 18:49:29,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 18:49:29,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:29,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, 1, 1, 1, 1, 1, 1] [2018-12-02 18:49:29,148 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:29,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:29,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1727711016, now seen corresponding path program 1 times [2018-12-02 18:49:29,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:29,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:29,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:29,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:29,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:29,183 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-02 18:49:29,184 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:29,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 18:49:29,184 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:29,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 18:49:29,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 18:49:29,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 18:49:29,184 INFO L87 Difference]: Start difference. First operand 9814 states and 23462 transitions. Second operand 4 states. [2018-12-02 18:49:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:29,235 INFO L93 Difference]: Finished difference Result 9654 states and 22982 transitions. [2018-12-02 18:49:29,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 18:49:29,236 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-02 18:49:29,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:29,242 INFO L225 Difference]: With dead ends: 9654 [2018-12-02 18:49:29,242 INFO L226 Difference]: Without dead ends: 9654 [2018-12-02 18:49:29,243 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 18:49:29,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9654 states. [2018-12-02 18:49:29,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9654 to 8946. [2018-12-02 18:49:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8946 states. [2018-12-02 18:49:29,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8946 states to 8946 states and 21317 transitions. [2018-12-02 18:49:29,315 INFO L78 Accepts]: Start accepts. Automaton has 8946 states and 21317 transitions. Word has length 127 [2018-12-02 18:49:29,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:29,316 INFO L480 AbstractCegarLoop]: Abstraction has 8946 states and 21317 transitions. [2018-12-02 18:49:29,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 18:49:29,316 INFO L276 IsEmpty]: Start isEmpty. Operand 8946 states and 21317 transitions. [2018-12-02 18:49:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 18:49:29,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:29,322 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, 1, 1, 1, 1, 1, 1] [2018-12-02 18:49:29,322 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:29,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash 679221192, now seen corresponding path program 1 times [2018-12-02 18:49:29,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:29,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:29,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:29,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:29,324 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:29,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 18:49:29,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:29,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 18:49:29,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:29,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 18:49:29,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 18:49:29,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 18:49:29,379 INFO L87 Difference]: Start difference. First operand 8946 states and 21317 transitions. Second operand 5 states. [2018-12-02 18:49:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:29,419 INFO L93 Difference]: Finished difference Result 11563 states and 27277 transitions. [2018-12-02 18:49:29,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 18:49:29,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-12-02 18:49:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:29,427 INFO L225 Difference]: With dead ends: 11563 [2018-12-02 18:49:29,427 INFO L226 Difference]: Without dead ends: 11563 [2018-12-02 18:49:29,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 18:49:29,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11563 states. [2018-12-02 18:49:29,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11563 to 8931. [2018-12-02 18:49:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8931 states. [2018-12-02 18:49:29,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8931 states to 8931 states and 20823 transitions. [2018-12-02 18:49:29,498 INFO L78 Accepts]: Start accepts. Automaton has 8931 states and 20823 transitions. Word has length 127 [2018-12-02 18:49:29,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:29,498 INFO L480 AbstractCegarLoop]: Abstraction has 8931 states and 20823 transitions. [2018-12-02 18:49:29,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 18:49:29,498 INFO L276 IsEmpty]: Start isEmpty. Operand 8931 states and 20823 transitions. [2018-12-02 18:49:29,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 18:49:29,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:29,504 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, 1, 1, 1, 1, 1, 1] [2018-12-02 18:49:29,504 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:29,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:29,504 INFO L82 PathProgramCache]: Analyzing trace with hash 195545865, now seen corresponding path program 1 times [2018-12-02 18:49:29,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:29,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:29,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:29,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:29,505 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:29,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:29,558 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-02 18:49:29,558 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:29,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 18:49:29,558 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:29,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 18:49:29,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 18:49:29,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 18:49:29,559 INFO L87 Difference]: Start difference. First operand 8931 states and 20823 transitions. Second operand 5 states. [2018-12-02 18:49:29,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:29,713 INFO L93 Difference]: Finished difference Result 9379 states and 21927 transitions. [2018-12-02 18:49:29,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 18:49:29,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-12-02 18:49:29,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:29,719 INFO L225 Difference]: With dead ends: 9379 [2018-12-02 18:49:29,719 INFO L226 Difference]: Without dead ends: 9347 [2018-12-02 18:49:29,719 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-02 18:49:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9347 states. [2018-12-02 18:49:29,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9347 to 8747. [2018-12-02 18:49:29,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8747 states. [2018-12-02 18:49:29,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8747 states to 8747 states and 20364 transitions. [2018-12-02 18:49:29,781 INFO L78 Accepts]: Start accepts. Automaton has 8747 states and 20364 transitions. Word has length 127 [2018-12-02 18:49:29,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:29,781 INFO L480 AbstractCegarLoop]: Abstraction has 8747 states and 20364 transitions. [2018-12-02 18:49:29,781 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 18:49:29,781 INFO L276 IsEmpty]: Start isEmpty. Operand 8747 states and 20364 transitions. [2018-12-02 18:49:29,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-02 18:49:29,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:29,786 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, 1, 1, 1, 1, 1, 1] [2018-12-02 18:49:29,786 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:29,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:29,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1440310346, now seen corresponding path program 1 times [2018-12-02 18:49:29,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:29,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:29,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:29,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:29,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:29,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:29,843 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-02 18:49:29,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:29,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 18:49:29,844 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:29,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 18:49:29,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 18:49:29,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 18:49:29,844 INFO L87 Difference]: Start difference. First operand 8747 states and 20364 transitions. Second operand 7 states. [2018-12-02 18:49:30,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:30,279 INFO L93 Difference]: Finished difference Result 11283 states and 25850 transitions. [2018-12-02 18:49:30,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 18:49:30,280 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2018-12-02 18:49:30,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:30,287 INFO L225 Difference]: With dead ends: 11283 [2018-12-02 18:49:30,287 INFO L226 Difference]: Without dead ends: 11283 [2018-12-02 18:49:30,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 18:49:30,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11283 states. [2018-12-02 18:49:30,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11283 to 8644. [2018-12-02 18:49:30,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8644 states. [2018-12-02 18:49:30,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8644 states to 8644 states and 20022 transitions. [2018-12-02 18:49:30,356 INFO L78 Accepts]: Start accepts. Automaton has 8644 states and 20022 transitions. Word has length 127 [2018-12-02 18:49:30,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:30,357 INFO L480 AbstractCegarLoop]: Abstraction has 8644 states and 20022 transitions. [2018-12-02 18:49:30,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 18:49:30,357 INFO L276 IsEmpty]: Start isEmpty. Operand 8644 states and 20022 transitions. [2018-12-02 18:49:30,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-02 18:49:30,362 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:30,362 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:49:30,363 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:30,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:30,363 INFO L82 PathProgramCache]: Analyzing trace with hash -2128747213, now seen corresponding path program 1 times [2018-12-02 18:49:30,363 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:30,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:30,364 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:30,364 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:30,364 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:30,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:30,428 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-02 18:49:30,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:30,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 18:49:30,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:30,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 18:49:30,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 18:49:30,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 18:49:30,429 INFO L87 Difference]: Start difference. First operand 8644 states and 20022 transitions. Second operand 7 states. [2018-12-02 18:49:30,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:30,776 INFO L93 Difference]: Finished difference Result 11554 states and 26417 transitions. [2018-12-02 18:49:30,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 18:49:30,776 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2018-12-02 18:49:30,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:30,783 INFO L225 Difference]: With dead ends: 11554 [2018-12-02 18:49:30,783 INFO L226 Difference]: Without dead ends: 11554 [2018-12-02 18:49:30,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 18:49:30,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11554 states. [2018-12-02 18:49:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11554 to 8715. [2018-12-02 18:49:30,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8715 states. [2018-12-02 18:49:30,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8715 states to 8715 states and 20188 transitions. [2018-12-02 18:49:30,850 INFO L78 Accepts]: Start accepts. Automaton has 8715 states and 20188 transitions. Word has length 129 [2018-12-02 18:49:30,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:30,850 INFO L480 AbstractCegarLoop]: Abstraction has 8715 states and 20188 transitions. [2018-12-02 18:49:30,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 18:49:30,851 INFO L276 IsEmpty]: Start isEmpty. Operand 8715 states and 20188 transitions. [2018-12-02 18:49:30,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-02 18:49:30,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:30,856 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:49:30,856 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:30,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:30,856 INFO L82 PathProgramCache]: Analyzing trace with hash -1367975553, now seen corresponding path program 1 times [2018-12-02 18:49:30,856 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:30,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:30,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:30,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:30,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:30,918 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-02 18:49:30,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:30,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 18:49:30,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:30,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 18:49:30,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 18:49:30,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-02 18:49:30,919 INFO L87 Difference]: Start difference. First operand 8715 states and 20188 transitions. Second operand 8 states. [2018-12-02 18:49:31,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:31,125 INFO L93 Difference]: Finished difference Result 9070 states and 20927 transitions. [2018-12-02 18:49:31,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 18:49:31,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 129 [2018-12-02 18:49:31,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:31,131 INFO L225 Difference]: With dead ends: 9070 [2018-12-02 18:49:31,131 INFO L226 Difference]: Without dead ends: 9070 [2018-12-02 18:49:31,131 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-02 18:49:31,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9070 states. [2018-12-02 18:49:31,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9070 to 8771. [2018-12-02 18:49:31,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8771 states. [2018-12-02 18:49:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8771 states to 8771 states and 20296 transitions. [2018-12-02 18:49:31,194 INFO L78 Accepts]: Start accepts. Automaton has 8771 states and 20296 transitions. Word has length 129 [2018-12-02 18:49:31,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:31,194 INFO L480 AbstractCegarLoop]: Abstraction has 8771 states and 20296 transitions. [2018-12-02 18:49:31,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 18:49:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand 8771 states and 20296 transitions. [2018-12-02 18:49:31,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-02 18:49:31,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:31,199 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:49:31,199 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:31,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:31,200 INFO L82 PathProgramCache]: Analyzing trace with hash -590399197, now seen corresponding path program 2 times [2018-12-02 18:49:31,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:31,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:31,200 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:31,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:31,201 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:31,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:31,248 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-02 18:49:31,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:31,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 18:49:31,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:31,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 18:49:31,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 18:49:31,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 18:49:31,249 INFO L87 Difference]: Start difference. First operand 8771 states and 20296 transitions. Second operand 6 states. [2018-12-02 18:49:31,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:31,418 INFO L93 Difference]: Finished difference Result 9751 states and 22301 transitions. [2018-12-02 18:49:31,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 18:49:31,418 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2018-12-02 18:49:31,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:31,424 INFO L225 Difference]: With dead ends: 9751 [2018-12-02 18:49:31,424 INFO L226 Difference]: Without dead ends: 9751 [2018-12-02 18:49:31,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 18:49:31,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9751 states. [2018-12-02 18:49:31,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9751 to 9091. [2018-12-02 18:49:31,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9091 states. [2018-12-02 18:49:31,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9091 states to 9091 states and 20952 transitions. [2018-12-02 18:49:31,494 INFO L78 Accepts]: Start accepts. Automaton has 9091 states and 20952 transitions. Word has length 129 [2018-12-02 18:49:31,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:31,494 INFO L480 AbstractCegarLoop]: Abstraction has 9091 states and 20952 transitions. [2018-12-02 18:49:31,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 18:49:31,494 INFO L276 IsEmpty]: Start isEmpty. Operand 9091 states and 20952 transitions. [2018-12-02 18:49:31,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-02 18:49:31,500 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:31,500 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:49:31,500 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:31,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:31,501 INFO L82 PathProgramCache]: Analyzing trace with hash 267672579, now seen corresponding path program 3 times [2018-12-02 18:49:31,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:31,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:31,502 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 18:49:31,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:31,502 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:31,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:31,555 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-02 18:49:31,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:31,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 18:49:31,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:31,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 18:49:31,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 18:49:31,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 18:49:31,556 INFO L87 Difference]: Start difference. First operand 9091 states and 20952 transitions. Second operand 8 states. [2018-12-02 18:49:32,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:32,059 INFO L93 Difference]: Finished difference Result 11762 states and 26832 transitions. [2018-12-02 18:49:32,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 18:49:32,060 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 129 [2018-12-02 18:49:32,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:32,072 INFO L225 Difference]: With dead ends: 11762 [2018-12-02 18:49:32,072 INFO L226 Difference]: Without dead ends: 11762 [2018-12-02 18:49:32,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-02 18:49:32,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11762 states. [2018-12-02 18:49:32,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11762 to 9091. [2018-12-02 18:49:32,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9091 states. [2018-12-02 18:49:32,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9091 states to 9091 states and 20952 transitions. [2018-12-02 18:49:32,156 INFO L78 Accepts]: Start accepts. Automaton has 9091 states and 20952 transitions. Word has length 129 [2018-12-02 18:49:32,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:32,156 INFO L480 AbstractCegarLoop]: Abstraction has 9091 states and 20952 transitions. [2018-12-02 18:49:32,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 18:49:32,156 INFO L276 IsEmpty]: Start isEmpty. Operand 9091 states and 20952 transitions. [2018-12-02 18:49:32,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-02 18:49:32,162 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:32,162 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:49:32,162 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:32,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:32,163 INFO L82 PathProgramCache]: Analyzing trace with hash 879166141, now seen corresponding path program 4 times [2018-12-02 18:49:32,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:32,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:32,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 18:49:32,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:32,164 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:32,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:32,240 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-02 18:49:32,241 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:32,241 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 18:49:32,241 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:32,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 18:49:32,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 18:49:32,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 18:49:32,241 INFO L87 Difference]: Start difference. First operand 9091 states and 20952 transitions. Second operand 8 states. [2018-12-02 18:49:32,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:32,725 INFO L93 Difference]: Finished difference Result 12313 states and 28006 transitions. [2018-12-02 18:49:32,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 18:49:32,725 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 129 [2018-12-02 18:49:32,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:32,733 INFO L225 Difference]: With dead ends: 12313 [2018-12-02 18:49:32,733 INFO L226 Difference]: Without dead ends: 12313 [2018-12-02 18:49:32,733 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-02 18:49:32,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12313 states. [2018-12-02 18:49:32,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12313 to 8958. [2018-12-02 18:49:32,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8958 states. [2018-12-02 18:49:32,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8958 states to 8958 states and 20698 transitions. [2018-12-02 18:49:32,808 INFO L78 Accepts]: Start accepts. Automaton has 8958 states and 20698 transitions. Word has length 129 [2018-12-02 18:49:32,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:32,808 INFO L480 AbstractCegarLoop]: Abstraction has 8958 states and 20698 transitions. [2018-12-02 18:49:32,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 18:49:32,808 INFO L276 IsEmpty]: Start isEmpty. Operand 8958 states and 20698 transitions. [2018-12-02 18:49:32,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-02 18:49:32,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:32,814 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:49:32,814 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:32,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:32,814 INFO L82 PathProgramCache]: Analyzing trace with hash -1450566523, now seen corresponding path program 1 times [2018-12-02 18:49:32,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:32,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:32,815 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:32,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:32,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:32,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:32,884 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-02 18:49:32,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:32,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 18:49:32,885 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:32,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 18:49:32,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 18:49:32,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 18:49:32,885 INFO L87 Difference]: Start difference. First operand 8958 states and 20698 transitions. Second operand 7 states. [2018-12-02 18:49:33,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:33,172 INFO L93 Difference]: Finished difference Result 9476 states and 21784 transitions. [2018-12-02 18:49:33,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 18:49:33,173 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2018-12-02 18:49:33,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:33,181 INFO L225 Difference]: With dead ends: 9476 [2018-12-02 18:49:33,181 INFO L226 Difference]: Without dead ends: 9456 [2018-12-02 18:49:33,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-02 18:49:33,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9456 states. [2018-12-02 18:49:33,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9456 to 8985. [2018-12-02 18:49:33,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8985 states. [2018-12-02 18:49:33,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8985 states to 8985 states and 20751 transitions. [2018-12-02 18:49:33,252 INFO L78 Accepts]: Start accepts. Automaton has 8985 states and 20751 transitions. Word has length 129 [2018-12-02 18:49:33,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:33,252 INFO L480 AbstractCegarLoop]: Abstraction has 8985 states and 20751 transitions. [2018-12-02 18:49:33,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 18:49:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 8985 states and 20751 transitions. [2018-12-02 18:49:33,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-02 18:49:33,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:33,258 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:49:33,259 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:33,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:33,259 INFO L82 PathProgramCache]: Analyzing trace with hash -13943097, now seen corresponding path program 1 times [2018-12-02 18:49:33,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:33,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:33,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:33,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:33,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:33,338 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-02 18:49:33,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:33,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 18:49:33,338 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:33,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 18:49:33,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 18:49:33,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 18:49:33,339 INFO L87 Difference]: Start difference. First operand 8985 states and 20751 transitions. Second operand 11 states. [2018-12-02 18:49:33,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:33,792 INFO L93 Difference]: Finished difference Result 21073 states and 48611 transitions. [2018-12-02 18:49:33,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-12-02 18:49:33,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 129 [2018-12-02 18:49:33,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:33,805 INFO L225 Difference]: With dead ends: 21073 [2018-12-02 18:49:33,805 INFO L226 Difference]: Without dead ends: 12439 [2018-12-02 18:49:33,805 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2018-12-02 18:49:33,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12439 states. [2018-12-02 18:49:33,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12439 to 9067. [2018-12-02 18:49:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9067 states. [2018-12-02 18:49:33,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9067 states to 9067 states and 20823 transitions. [2018-12-02 18:49:33,889 INFO L78 Accepts]: Start accepts. Automaton has 9067 states and 20823 transitions. Word has length 129 [2018-12-02 18:49:33,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:33,889 INFO L480 AbstractCegarLoop]: Abstraction has 9067 states and 20823 transitions. [2018-12-02 18:49:33,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 18:49:33,889 INFO L276 IsEmpty]: Start isEmpty. Operand 9067 states and 20823 transitions. [2018-12-02 18:49:33,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-02 18:49:33,895 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:33,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:49:33,895 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:33,895 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:33,895 INFO L82 PathProgramCache]: Analyzing trace with hash -1412683190, now seen corresponding path program 1 times [2018-12-02 18:49:33,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:33,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:33,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:33,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:33,896 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:33,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 18:49:34,017 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-02 18:49:34,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 18:49:34,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-02 18:49:34,017 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 18:49:34,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 18:49:34,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 18:49:34,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-12-02 18:49:34,018 INFO L87 Difference]: Start difference. First operand 9067 states and 20823 transitions. Second operand 14 states. [2018-12-02 18:49:34,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 18:49:34,482 INFO L93 Difference]: Finished difference Result 14300 states and 33438 transitions. [2018-12-02 18:49:34,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 18:49:34,482 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 131 [2018-12-02 18:49:34,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 18:49:34,492 INFO L225 Difference]: With dead ends: 14300 [2018-12-02 18:49:34,493 INFO L226 Difference]: Without dead ends: 12462 [2018-12-02 18:49:34,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2018-12-02 18:49:34,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12462 states. [2018-12-02 18:49:34,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12462 to 10192. [2018-12-02 18:49:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10192 states. [2018-12-02 18:49:34,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10192 states to 10192 states and 23241 transitions. [2018-12-02 18:49:34,580 INFO L78 Accepts]: Start accepts. Automaton has 10192 states and 23241 transitions. Word has length 131 [2018-12-02 18:49:34,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 18:49:34,580 INFO L480 AbstractCegarLoop]: Abstraction has 10192 states and 23241 transitions. [2018-12-02 18:49:34,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 18:49:34,580 INFO L276 IsEmpty]: Start isEmpty. Operand 10192 states and 23241 transitions. [2018-12-02 18:49:34,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-02 18:49:34,587 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 18:49:34,587 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 18:49:34,587 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 18:49:34,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 18:49:34,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1660627428, now seen corresponding path program 2 times [2018-12-02 18:49:34,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 18:49:34,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:34,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 18:49:34,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 18:49:34,588 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 18:49:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:49:34,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 18:49:34,656 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 18:49:34,744 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 18:49:34,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 06:49:34 BasicIcfg [2018-12-02 18:49:34,745 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 18:49:34,746 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 18:49:34,746 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 18:49:34,746 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 18:49:34,746 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 06:48:21" (3/4) ... [2018-12-02 18:49:34,748 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 18:49:34,840 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_381e9630-7f47-457a-8550-2547d6b1011e/bin-2019/utaipan/witness.graphml [2018-12-02 18:49:34,840 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 18:49:34,841 INFO L168 Benchmark]: Toolchain (without parser) took 74741.74 ms. Allocated memory was 1.0 GB in the beginning and 6.5 GB in the end (delta: 5.5 GB). Free memory was 947.0 MB in the beginning and 3.8 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-12-02 18:49:34,842 INFO L168 Benchmark]: CDTParser took 0.12 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-02 18:49:34,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 399.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -140.3 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. [2018-12-02 18:49:34,842 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 18:49:34,842 INFO L168 Benchmark]: Boogie Preprocessor took 26.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 18:49:34,842 INFO L168 Benchmark]: RCFGBuilder took 444.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. [2018-12-02 18:49:34,842 INFO L168 Benchmark]: TraceAbstraction took 73732.65 ms. Allocated memory was 1.1 GB in the beginning and 6.5 GB in the end (delta: 5.4 GB). Free memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-12-02 18:49:34,842 INFO L168 Benchmark]: Witness Printer took 94.65 ms. Allocated memory is still 6.5 GB. Free memory was 3.9 GB in the beginning and 3.8 GB in the end (delta: 83.2 MB). Peak memory consumption was 83.2 MB. Max. memory is 11.5 GB. [2018-12-02 18:49:34,843 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 399.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -140.3 MB). Peak memory consumption was 37.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.32 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 444.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 67.5 MB). Peak memory consumption was 67.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 73732.65 ms. Allocated memory was 1.1 GB in the beginning and 6.5 GB in the end (delta: 5.4 GB). Free memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: -2.9 GB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 94.65 ms. Allocated memory is still 6.5 GB. Free memory was 3.9 GB in the beginning and 3.8 GB in the end (delta: 83.2 MB). Peak memory consumption was 83.2 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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] -1 pthread_t t1601; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] FCALL, FORK -1 pthread_create(&t1601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L701] 0 y = 2 [L704] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L707] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] -1 pthread_t t1602; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L792] FCALL, FORK -1 pthread_create(&t1602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L707] EXPR 0 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L721] 1 x = 2 [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L707] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd2 = (_Bool)1 [L735] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L736] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L744] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L745] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L747] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L747] 1 y = y$flush_delayed ? y$mem_tmp : y [L748] 1 y$flush_delayed = (_Bool)0 [L751] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L752] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L753] 1 y$flush_delayed = weak$$choice2 [L754] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L755] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L755] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L755] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L756] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L757] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L758] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L759] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L760] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L761] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L761] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L763] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L763] 1 y = y$flush_delayed ? y$mem_tmp : y [L764] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L767] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L767] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L768] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L707] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L769] EXPR 1 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 1 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 [L708] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] EXPR 1 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=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 1 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 [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L708] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L709] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L709] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L710] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0] [L710] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L711] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0] [L711] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L714] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] -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) [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] -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 [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] -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 [L805] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L806] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L807] -1 y$flush_delayed = weak$$choice2 [L808] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L809] -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) [L810] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L810] -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)) [L811] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L811] -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)) [L812] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L812] -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)) [L813] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] -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)) [L814] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] -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)) [L815] 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=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] -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)) [L816] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] -1 y = y$flush_delayed ? y$mem_tmp : y [L818] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, 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=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 348 locations, 3 error locations. UNSAFE Result, 73.6s OverallTime, 39 OverallIterations, 1 TraceHistogramMax, 28.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 21201 SDtfs, 21798 SDslu, 59600 SDs, 0 SdLazy, 24246 SolverSat, 1105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 496 GetRequests, 118 SyntacticMatches, 47 SemanticMatches, 331 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 693 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182336occurred 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: 33.7s AutomataMinimizationTime, 38 MinimizatonAttempts, 473192 StatesRemovedByMinimization, 37 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 3996 NumberOfCodeBlocks, 3996 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3827 ConstructedInterpolants, 0 QuantifiedInterpolants, 1117672 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 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...