./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8be31b24-6038-40f9-a1b9-64c1e7da2d80/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8be31b24-6038-40f9-a1b9-64c1e7da2d80/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8be31b24-6038-40f9-a1b9-64c1e7da2d80/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8be31b24-6038-40f9-a1b9-64c1e7da2d80/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8be31b24-6038-40f9-a1b9-64c1e7da2d80/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8be31b24-6038-40f9-a1b9-64c1e7da2d80/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 329b7a48e556584de8d61f30845ded50594e4269 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-03 07:44:41,019 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 07:44:41,020 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 07:44:41,026 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 07:44:41,026 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 07:44:41,027 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 07:44:41,028 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 07:44:41,029 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 07:44:41,030 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 07:44:41,030 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 07:44:41,031 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 07:44:41,031 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 07:44:41,031 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 07:44:41,032 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 07:44:41,032 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 07:44:41,033 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 07:44:41,033 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 07:44:41,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 07:44:41,035 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 07:44:41,036 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 07:44:41,036 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 07:44:41,037 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 07:44:41,038 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 07:44:41,038 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 07:44:41,038 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 07:44:41,039 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 07:44:41,039 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 07:44:41,040 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 07:44:41,040 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 07:44:41,041 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 07:44:41,041 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 07:44:41,041 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 07:44:41,041 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 07:44:41,041 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 07:44:41,042 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 07:44:41,042 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 07:44:41,042 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8be31b24-6038-40f9-a1b9-64c1e7da2d80/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 07:44:41,050 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 07:44:41,050 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 07:44:41,051 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 07:44:41,051 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 07:44:41,051 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 07:44:41,051 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 07:44:41,051 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 07:44:41,051 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 07:44:41,051 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 07:44:41,051 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 07:44:41,051 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 07:44:41,051 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 07:44:41,052 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 07:44:41,052 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 07:44:41,052 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 07:44:41,052 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 07:44:41,052 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 07:44:41,052 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 07:44:41,052 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 07:44:41,053 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 07:44:41,053 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 07:44:41,053 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 07:44:41,053 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 07:44:41,053 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 07:44:41,053 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 07:44:41,053 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 07:44:41,053 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 07:44:41,053 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 07:44:41,053 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 07:44:41,053 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 07:44:41,054 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 07:44:41,054 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 07:44:41,054 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 07:44:41,054 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 07:44:41,054 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 07:44:41,054 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 07:44:41,054 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_8be31b24-6038-40f9-a1b9-64c1e7da2d80/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 -> 329b7a48e556584de8d61f30845ded50594e4269 [2018-12-03 07:44:41,071 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 07:44:41,078 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 07:44:41,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 07:44:41,081 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 07:44:41,081 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 07:44:41,082 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8be31b24-6038-40f9-a1b9-64c1e7da2d80/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix041_tso.opt_false-unreach-call.i [2018-12-03 07:44:41,118 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8be31b24-6038-40f9-a1b9-64c1e7da2d80/bin-2019/utaipan/data/645432e84/680f158bde41438093ca683ea608469e/FLAG832319e66 [2018-12-03 07:44:41,519 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 07:44:41,519 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8be31b24-6038-40f9-a1b9-64c1e7da2d80/sv-benchmarks/c/pthread-wmm/mix041_tso.opt_false-unreach-call.i [2018-12-03 07:44:41,527 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8be31b24-6038-40f9-a1b9-64c1e7da2d80/bin-2019/utaipan/data/645432e84/680f158bde41438093ca683ea608469e/FLAG832319e66 [2018-12-03 07:44:41,862 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8be31b24-6038-40f9-a1b9-64c1e7da2d80/bin-2019/utaipan/data/645432e84/680f158bde41438093ca683ea608469e [2018-12-03 07:44:41,867 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 07:44:41,870 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 07:44:41,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 07:44:41,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 07:44:41,879 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 07:44:41,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:44:41" (1/1) ... [2018-12-03 07:44:41,885 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a04c23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:44:41, skipping insertion in model container [2018-12-03 07:44:41,885 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 07:44:41" (1/1) ... [2018-12-03 07:44:41,890 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 07:44:41,912 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 07:44:42,086 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:44:42,094 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 07:44:42,170 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 07:44:42,200 INFO L195 MainTranslator]: Completed translation [2018-12-03 07:44:42,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:44:42 WrapperNode [2018-12-03 07:44:42,200 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 07:44:42,200 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 07:44:42,200 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 07:44:42,201 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 07:44:42,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:44:42" (1/1) ... [2018-12-03 07:44:42,216 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:44:42" (1/1) ... [2018-12-03 07:44:42,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 07:44:42,236 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 07:44:42,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 07:44:42,236 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 07:44:42,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:44:42" (1/1) ... [2018-12-03 07:44:42,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:44:42" (1/1) ... [2018-12-03 07:44:42,246 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:44:42" (1/1) ... [2018-12-03 07:44:42,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:44:42" (1/1) ... [2018-12-03 07:44:42,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:44:42" (1/1) ... [2018-12-03 07:44:42,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:44:42" (1/1) ... [2018-12-03 07:44:42,257 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:44:42" (1/1) ... [2018-12-03 07:44:42,259 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 07:44:42,259 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 07:44:42,259 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 07:44:42,259 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 07:44:42,260 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:44:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8be31b24-6038-40f9-a1b9-64c1e7da2d80/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-03 07:44:42,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 07:44:42,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 07:44:42,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 07:44:42,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 07:44:42,306 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 07:44:42,306 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 07:44:42,307 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 07:44:42,307 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 07:44:42,307 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 07:44:42,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 07:44:42,307 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 07:44:42,308 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 07:44:42,628 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 07:44:42,629 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 07:44:42,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:44:42 BoogieIcfgContainer [2018-12-03 07:44:42,629 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 07:44:42,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 07:44:42,630 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 07:44:42,632 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 07:44:42,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 07:44:41" (1/3) ... [2018-12-03 07:44:42,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2f8614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:44:42, skipping insertion in model container [2018-12-03 07:44:42,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 07:44:42" (2/3) ... [2018-12-03 07:44:42,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a2f8614 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 07:44:42, skipping insertion in model container [2018-12-03 07:44:42,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:44:42" (3/3) ... [2018-12-03 07:44:42,634 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_tso.opt_false-unreach-call.i [2018-12-03 07:44:42,656 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,657 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,657 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,657 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,657 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,657 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,657 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,657 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,657 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,657 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,658 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,658 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,658 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,658 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,658 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,658 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,658 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,658 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,658 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,658 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,659 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,660 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,660 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,660 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,660 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,660 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,660 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,660 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,660 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,661 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,661 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,661 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,662 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,663 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,664 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet16.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 07:44:42,667 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 07:44:42,667 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 07:44:42,672 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 07:44:42,681 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 07:44:42,695 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 07:44:42,696 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 07:44:42,696 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 07:44:42,696 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 07:44:42,696 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 07:44:42,696 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 07:44:42,696 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 07:44:42,696 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 07:44:42,702 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-03 07:44:43,701 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25089 states. [2018-12-03 07:44:43,702 INFO L276 IsEmpty]: Start isEmpty. Operand 25089 states. [2018-12-03 07:44:43,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-03 07:44:43,708 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:44:43,709 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] [2018-12-03 07:44:43,710 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:44:43,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:44:43,714 INFO L82 PathProgramCache]: Analyzing trace with hash 224065163, now seen corresponding path program 1 times [2018-12-03 07:44:43,715 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:44:43,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:43,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:44:43,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:43,750 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:44:43,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:44:43,855 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-03 07:44:43,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:44:43,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:44:43,857 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:44:43,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:44:43,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:44:43,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:44:43,870 INFO L87 Difference]: Start difference. First operand 25089 states. Second operand 4 states. [2018-12-03 07:44:44,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:44:44,244 INFO L93 Difference]: Finished difference Result 45389 states and 177627 transitions. [2018-12-03 07:44:44,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:44:44,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-03 07:44:44,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:44:44,403 INFO L225 Difference]: With dead ends: 45389 [2018-12-03 07:44:44,403 INFO L226 Difference]: Without dead ends: 40629 [2018-12-03 07:44:44,404 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-03 07:44:44,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40629 states. [2018-12-03 07:44:45,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40629 to 23663. [2018-12-03 07:44:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-03 07:44:45,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92544 transitions. [2018-12-03 07:44:45,141 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92544 transitions. Word has length 38 [2018-12-03 07:44:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:44:45,141 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92544 transitions. [2018-12-03 07:44:45,141 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:44:45,141 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92544 transitions. [2018-12-03 07:44:45,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 07:44:45,144 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:44:45,144 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-03 07:44:45,144 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:44:45,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:44:45,144 INFO L82 PathProgramCache]: Analyzing trace with hash 1632937034, now seen corresponding path program 1 times [2018-12-03 07:44:45,144 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:44:45,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:45,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:44:45,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:45,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:44:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:44:45,187 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-03 07:44:45,188 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:44:45,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:44:45,188 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:44:45,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:44:45,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:44:45,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:44:45,189 INFO L87 Difference]: Start difference. First operand 23663 states and 92544 transitions. Second operand 3 states. [2018-12-03 07:44:45,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:44:45,338 INFO L93 Difference]: Finished difference Result 23663 states and 92160 transitions. [2018-12-03 07:44:45,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:44:45,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2018-12-03 07:44:45,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:44:45,403 INFO L225 Difference]: With dead ends: 23663 [2018-12-03 07:44:45,403 INFO L226 Difference]: Without dead ends: 23663 [2018-12-03 07:44:45,403 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-03 07:44:45,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23663 states. [2018-12-03 07:44:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23663 to 23663. [2018-12-03 07:44:45,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23663 states. [2018-12-03 07:44:45,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23663 states to 23663 states and 92160 transitions. [2018-12-03 07:44:45,877 INFO L78 Accepts]: Start accepts. Automaton has 23663 states and 92160 transitions. Word has length 45 [2018-12-03 07:44:45,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:44:45,877 INFO L480 AbstractCegarLoop]: Abstraction has 23663 states and 92160 transitions. [2018-12-03 07:44:45,877 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:44:45,877 INFO L276 IsEmpty]: Start isEmpty. Operand 23663 states and 92160 transitions. [2018-12-03 07:44:45,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-03 07:44:45,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:44:45,879 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-03 07:44:45,879 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:44:45,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:44:45,880 INFO L82 PathProgramCache]: Analyzing trace with hash -164014325, now seen corresponding path program 1 times [2018-12-03 07:44:45,880 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:44:45,882 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:45,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:44:45,883 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:45,883 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:44:45,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:44:45,940 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-03 07:44:45,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:44:45,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:44:45,940 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:44:45,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:44:45,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:44:45,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:44:45,941 INFO L87 Difference]: Start difference. First operand 23663 states and 92160 transitions. Second operand 5 states. [2018-12-03 07:44:46,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:44:46,514 INFO L93 Difference]: Finished difference Result 64831 states and 240932 transitions. [2018-12-03 07:44:46,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:44:46,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2018-12-03 07:44:46,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:44:46,650 INFO L225 Difference]: With dead ends: 64831 [2018-12-03 07:44:46,650 INFO L226 Difference]: Without dead ends: 64671 [2018-12-03 07:44:46,650 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-03 07:44:46,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64671 states. [2018-12-03 07:44:47,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64671 to 37143. [2018-12-03 07:44:47,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-03 07:44:47,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137901 transitions. [2018-12-03 07:44:47,403 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137901 transitions. Word has length 45 [2018-12-03 07:44:47,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:44:47,404 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137901 transitions. [2018-12-03 07:44:47,404 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:44:47,404 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137901 transitions. [2018-12-03 07:44:47,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 07:44:47,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:44:47,406 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:44:47,407 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:44:47,407 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:44:47,407 INFO L82 PathProgramCache]: Analyzing trace with hash 1508997083, now seen corresponding path program 1 times [2018-12-03 07:44:47,407 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:44:47,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:47,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:44:47,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:47,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:44:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:44:47,434 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-03 07:44:47,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:44:47,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:44:47,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:44:47,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:44:47,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:44:47,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:44:47,435 INFO L87 Difference]: Start difference. First operand 37143 states and 137901 transitions. Second operand 3 states. [2018-12-03 07:44:47,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:44:47,709 INFO L93 Difference]: Finished difference Result 37143 states and 137892 transitions. [2018-12-03 07:44:47,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:44:47,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2018-12-03 07:44:47,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:44:47,778 INFO L225 Difference]: With dead ends: 37143 [2018-12-03 07:44:47,778 INFO L226 Difference]: Without dead ends: 37143 [2018-12-03 07:44:47,778 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-03 07:44:47,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37143 states. [2018-12-03 07:44:48,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37143 to 37143. [2018-12-03 07:44:48,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37143 states. [2018-12-03 07:44:48,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37143 states to 37143 states and 137892 transitions. [2018-12-03 07:44:48,295 INFO L78 Accepts]: Start accepts. Automaton has 37143 states and 137892 transitions. Word has length 46 [2018-12-03 07:44:48,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:44:48,295 INFO L480 AbstractCegarLoop]: Abstraction has 37143 states and 137892 transitions. [2018-12-03 07:44:48,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:44:48,295 INFO L276 IsEmpty]: Start isEmpty. Operand 37143 states and 137892 transitions. [2018-12-03 07:44:48,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 07:44:48,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:44:48,297 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:44:48,297 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:44:48,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:44:48,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1043159878, now seen corresponding path program 1 times [2018-12-03 07:44:48,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:44:48,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:48,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:44:48,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:48,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:44:48,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:44:48,329 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-03 07:44:48,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:44:48,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:44:48,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:44:48,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:44:48,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:44:48,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:44:48,330 INFO L87 Difference]: Start difference. First operand 37143 states and 137892 transitions. Second operand 5 states. [2018-12-03 07:44:48,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:44:48,826 INFO L93 Difference]: Finished difference Result 66627 states and 246193 transitions. [2018-12-03 07:44:48,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:44:48,827 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-03 07:44:48,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:44:48,937 INFO L225 Difference]: With dead ends: 66627 [2018-12-03 07:44:48,937 INFO L226 Difference]: Without dead ends: 66459 [2018-12-03 07:44:48,938 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-03 07:44:49,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66459 states. [2018-12-03 07:44:49,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66459 to 38835. [2018-12-03 07:44:49,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38835 states. [2018-12-03 07:44:49,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38835 states to 38835 states and 143650 transitions. [2018-12-03 07:44:49,642 INFO L78 Accepts]: Start accepts. Automaton has 38835 states and 143650 transitions. Word has length 46 [2018-12-03 07:44:49,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:44:49,642 INFO L480 AbstractCegarLoop]: Abstraction has 38835 states and 143650 transitions. [2018-12-03 07:44:49,642 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:44:49,642 INFO L276 IsEmpty]: Start isEmpty. Operand 38835 states and 143650 transitions. [2018-12-03 07:44:49,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 07:44:49,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:44:49,649 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:44:49,649 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:44:49,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:44:49,649 INFO L82 PathProgramCache]: Analyzing trace with hash 942235242, now seen corresponding path program 1 times [2018-12-03 07:44:49,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:44:49,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:49,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:44:49,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:49,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:44:49,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:44:49,684 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-03 07:44:49,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:44:49,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:44:49,684 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:44:49,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:44:49,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:44:49,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:44:49,685 INFO L87 Difference]: Start difference. First operand 38835 states and 143650 transitions. Second operand 4 states. [2018-12-03 07:44:49,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:44:49,739 INFO L93 Difference]: Finished difference Result 14217 states and 47061 transitions. [2018-12-03 07:44:49,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:44:49,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-03 07:44:49,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:44:49,758 INFO L225 Difference]: With dead ends: 14217 [2018-12-03 07:44:49,758 INFO L226 Difference]: Without dead ends: 13696 [2018-12-03 07:44:49,758 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-03 07:44:49,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13696 states. [2018-12-03 07:44:49,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13696 to 13696. [2018-12-03 07:44:49,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13696 states. [2018-12-03 07:44:49,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13696 states to 13696 states and 45509 transitions. [2018-12-03 07:44:49,913 INFO L78 Accepts]: Start accepts. Automaton has 13696 states and 45509 transitions. Word has length 53 [2018-12-03 07:44:49,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:44:49,913 INFO L480 AbstractCegarLoop]: Abstraction has 13696 states and 45509 transitions. [2018-12-03 07:44:49,913 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:44:49,914 INFO L276 IsEmpty]: Start isEmpty. Operand 13696 states and 45509 transitions. [2018-12-03 07:44:49,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 07:44:49,916 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:44:49,916 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] [2018-12-03 07:44:49,916 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:44:49,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:44:49,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1496318134, now seen corresponding path program 1 times [2018-12-03 07:44:49,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:44:49,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:49,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:44:49,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:49,918 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:44:49,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:44:49,964 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-03 07:44:49,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:44:49,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:44:49,964 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:44:49,965 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:44:49,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:44:49,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:44:49,965 INFO L87 Difference]: Start difference. First operand 13696 states and 45509 transitions. Second operand 4 states. [2018-12-03 07:44:50,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:44:50,095 INFO L93 Difference]: Finished difference Result 19084 states and 62264 transitions. [2018-12-03 07:44:50,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:44:50,096 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-03 07:44:50,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:44:50,121 INFO L225 Difference]: With dead ends: 19084 [2018-12-03 07:44:50,121 INFO L226 Difference]: Without dead ends: 19084 [2018-12-03 07:44:50,122 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-03 07:44:50,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19084 states. [2018-12-03 07:44:50,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19084 to 14780. [2018-12-03 07:44:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14780 states. [2018-12-03 07:44:50,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14780 states to 14780 states and 48764 transitions. [2018-12-03 07:44:50,319 INFO L78 Accepts]: Start accepts. Automaton has 14780 states and 48764 transitions. Word has length 59 [2018-12-03 07:44:50,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:44:50,319 INFO L480 AbstractCegarLoop]: Abstraction has 14780 states and 48764 transitions. [2018-12-03 07:44:50,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:44:50,319 INFO L276 IsEmpty]: Start isEmpty. Operand 14780 states and 48764 transitions. [2018-12-03 07:44:50,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 07:44:50,322 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:44:50,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] [2018-12-03 07:44:50,323 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:44:50,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:44:50,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1055838827, now seen corresponding path program 1 times [2018-12-03 07:44:50,323 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:44:50,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:50,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:44:50,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:50,325 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:44:50,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:44:50,359 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-03 07:44:50,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:44:50,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:44:50,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:44:50,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:44:50,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:44:50,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:44:50,360 INFO L87 Difference]: Start difference. First operand 14780 states and 48764 transitions. Second operand 4 states. [2018-12-03 07:44:50,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:44:50,759 INFO L93 Difference]: Finished difference Result 20683 states and 67222 transitions. [2018-12-03 07:44:50,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:44:50,760 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 59 [2018-12-03 07:44:50,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:44:50,844 INFO L225 Difference]: With dead ends: 20683 [2018-12-03 07:44:50,845 INFO L226 Difference]: Without dead ends: 20683 [2018-12-03 07:44:50,845 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-03 07:44:50,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20683 states. [2018-12-03 07:44:51,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20683 to 18616. [2018-12-03 07:44:51,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18616 states. [2018-12-03 07:44:51,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18616 states to 18616 states and 60973 transitions. [2018-12-03 07:44:51,053 INFO L78 Accepts]: Start accepts. Automaton has 18616 states and 60973 transitions. Word has length 59 [2018-12-03 07:44:51,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:44:51,053 INFO L480 AbstractCegarLoop]: Abstraction has 18616 states and 60973 transitions. [2018-12-03 07:44:51,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:44:51,053 INFO L276 IsEmpty]: Start isEmpty. Operand 18616 states and 60973 transitions. [2018-12-03 07:44:51,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-03 07:44:51,056 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:44:51,057 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] [2018-12-03 07:44:51,057 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:44:51,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:44:51,057 INFO L82 PathProgramCache]: Analyzing trace with hash 297470870, now seen corresponding path program 1 times [2018-12-03 07:44:51,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:44:51,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:51,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:44:51,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:51,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:44:51,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:44:51,122 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-03 07:44:51,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:44:51,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:44:51,122 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:44:51,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:44:51,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:44:51,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:44:51,123 INFO L87 Difference]: Start difference. First operand 18616 states and 60973 transitions. Second operand 6 states. [2018-12-03 07:44:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:44:51,424 INFO L93 Difference]: Finished difference Result 24160 states and 78371 transitions. [2018-12-03 07:44:51,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 07:44:51,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-03 07:44:51,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:44:51,454 INFO L225 Difference]: With dead ends: 24160 [2018-12-03 07:44:51,454 INFO L226 Difference]: Without dead ends: 24128 [2018-12-03 07:44:51,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-03 07:44:51,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24128 states. [2018-12-03 07:44:51,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24128 to 18248. [2018-12-03 07:44:51,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18248 states. [2018-12-03 07:44:51,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18248 states to 18248 states and 59757 transitions. [2018-12-03 07:44:51,685 INFO L78 Accepts]: Start accepts. Automaton has 18248 states and 59757 transitions. Word has length 59 [2018-12-03 07:44:51,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:44:51,686 INFO L480 AbstractCegarLoop]: Abstraction has 18248 states and 59757 transitions. [2018-12-03 07:44:51,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:44:51,686 INFO L276 IsEmpty]: Start isEmpty. Operand 18248 states and 59757 transitions. [2018-12-03 07:44:51,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 07:44:51,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:44:51,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:44:51,697 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:44:51,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:44:51,698 INFO L82 PathProgramCache]: Analyzing trace with hash 508362432, now seen corresponding path program 1 times [2018-12-03 07:44:51,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:44:51,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:51,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:44:51,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:51,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:44:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:44:51,743 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:44:51,743 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:44:51,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:44:51,743 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:44:51,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:44:51,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:44:51,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:44:51,744 INFO L87 Difference]: Start difference. First operand 18248 states and 59757 transitions. Second operand 4 states. [2018-12-03 07:44:52,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:44:52,047 INFO L93 Difference]: Finished difference Result 29316 states and 94246 transitions. [2018-12-03 07:44:52,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 07:44:52,047 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2018-12-03 07:44:52,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:44:52,083 INFO L225 Difference]: With dead ends: 29316 [2018-12-03 07:44:52,083 INFO L226 Difference]: Without dead ends: 29120 [2018-12-03 07:44:52,083 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-03 07:44:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29120 states. [2018-12-03 07:44:52,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29120 to 24768. [2018-12-03 07:44:52,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24768 states. [2018-12-03 07:44:52,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24768 states to 24768 states and 80579 transitions. [2018-12-03 07:44:52,396 INFO L78 Accepts]: Start accepts. Automaton has 24768 states and 80579 transitions. Word has length 73 [2018-12-03 07:44:52,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:44:52,397 INFO L480 AbstractCegarLoop]: Abstraction has 24768 states and 80579 transitions. [2018-12-03 07:44:52,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:44:52,397 INFO L276 IsEmpty]: Start isEmpty. Operand 24768 states and 80579 transitions. [2018-12-03 07:44:52,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 07:44:52,412 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:44:52,412 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] [2018-12-03 07:44:52,412 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:44:52,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:44:52,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1861672129, now seen corresponding path program 1 times [2018-12-03 07:44:52,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:44:52,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:52,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:44:52,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:52,413 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:44:52,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:44:52,505 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-03 07:44:52,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:44:52,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 07:44:52,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:44:52,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 07:44:52,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 07:44:52,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:44:52,505 INFO L87 Difference]: Start difference. First operand 24768 states and 80579 transitions. Second operand 8 states. [2018-12-03 07:44:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:44:53,165 INFO L93 Difference]: Finished difference Result 37722 states and 118602 transitions. [2018-12-03 07:44:53,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-03 07:44:53,165 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-12-03 07:44:53,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:44:53,211 INFO L225 Difference]: With dead ends: 37722 [2018-12-03 07:44:53,211 INFO L226 Difference]: Without dead ends: 37474 [2018-12-03 07:44:53,212 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-03 07:44:53,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37474 states. [2018-12-03 07:44:53,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37474 to 27365. [2018-12-03 07:44:53,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27365 states. [2018-12-03 07:44:53,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27365 states to 27365 states and 88367 transitions. [2018-12-03 07:44:53,600 INFO L78 Accepts]: Start accepts. Automaton has 27365 states and 88367 transitions. Word has length 73 [2018-12-03 07:44:53,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:44:53,600 INFO L480 AbstractCegarLoop]: Abstraction has 27365 states and 88367 transitions. [2018-12-03 07:44:53,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 07:44:53,600 INFO L276 IsEmpty]: Start isEmpty. Operand 27365 states and 88367 transitions. [2018-12-03 07:44:53,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 07:44:53,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:44:53,618 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] [2018-12-03 07:44:53,618 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:44:53,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:44:53,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1568269122, now seen corresponding path program 1 times [2018-12-03 07:44:53,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:44:53,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:53,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:44:53,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:53,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:44:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:44:53,683 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-03 07:44:53,683 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:44:53,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 07:44:53,684 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:44:53,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 07:44:53,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 07:44:53,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:44:53,684 INFO L87 Difference]: Start difference. First operand 27365 states and 88367 transitions. Second operand 8 states. [2018-12-03 07:44:54,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:44:54,328 INFO L93 Difference]: Finished difference Result 34993 states and 111268 transitions. [2018-12-03 07:44:54,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 07:44:54,329 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 73 [2018-12-03 07:44:54,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:44:54,374 INFO L225 Difference]: With dead ends: 34993 [2018-12-03 07:44:54,374 INFO L226 Difference]: Without dead ends: 34929 [2018-12-03 07:44:54,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-12-03 07:44:54,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34929 states. [2018-12-03 07:44:54,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34929 to 29457. [2018-12-03 07:44:54,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29457 states. [2018-12-03 07:44:54,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29457 states to 29457 states and 94772 transitions. [2018-12-03 07:44:54,752 INFO L78 Accepts]: Start accepts. Automaton has 29457 states and 94772 transitions. Word has length 73 [2018-12-03 07:44:54,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:44:54,752 INFO L480 AbstractCegarLoop]: Abstraction has 29457 states and 94772 transitions. [2018-12-03 07:44:54,752 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 07:44:54,752 INFO L276 IsEmpty]: Start isEmpty. Operand 29457 states and 94772 transitions. [2018-12-03 07:44:54,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-03 07:44:54,772 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:44:54,773 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] [2018-12-03 07:44:54,773 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:44:54,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:44:54,773 INFO L82 PathProgramCache]: Analyzing trace with hash 749030577, now seen corresponding path program 1 times [2018-12-03 07:44:54,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:44:54,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:54,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:44:54,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:54,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:44:54,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:44:54,798 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-03 07:44:54,798 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:44:54,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:44:54,798 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:44:54,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:44:54,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:44:54,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:44:54,799 INFO L87 Difference]: Start difference. First operand 29457 states and 94772 transitions. Second operand 3 states. [2018-12-03 07:44:54,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:44:54,910 INFO L93 Difference]: Finished difference Result 34177 states and 108640 transitions. [2018-12-03 07:44:54,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:44:54,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 75 [2018-12-03 07:44:54,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:44:54,953 INFO L225 Difference]: With dead ends: 34177 [2018-12-03 07:44:54,953 INFO L226 Difference]: Without dead ends: 34177 [2018-12-03 07:44:54,953 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-03 07:44:55,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34177 states. [2018-12-03 07:44:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34177 to 31025. [2018-12-03 07:44:55,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31025 states. [2018-12-03 07:44:55,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31025 states to 31025 states and 99252 transitions. [2018-12-03 07:44:55,302 INFO L78 Accepts]: Start accepts. Automaton has 31025 states and 99252 transitions. Word has length 75 [2018-12-03 07:44:55,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:44:55,303 INFO L480 AbstractCegarLoop]: Abstraction has 31025 states and 99252 transitions. [2018-12-03 07:44:55,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:44:55,303 INFO L276 IsEmpty]: Start isEmpty. Operand 31025 states and 99252 transitions. [2018-12-03 07:44:55,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 07:44:55,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:44:55,327 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] [2018-12-03 07:44:55,328 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:44:55,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:44:55,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1031472080, now seen corresponding path program 1 times [2018-12-03 07:44:55,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:44:55,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:55,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:44:55,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:55,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:44:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:44:55,420 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-03 07:44:55,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:44:55,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 07:44:55,421 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:44:55,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 07:44:55,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 07:44:55,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:44:55,421 INFO L87 Difference]: Start difference. First operand 31025 states and 99252 transitions. Second operand 10 states. [2018-12-03 07:44:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:44:56,475 INFO L93 Difference]: Finished difference Result 40629 states and 126835 transitions. [2018-12-03 07:44:56,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-03 07:44:56,476 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 79 [2018-12-03 07:44:56,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:44:56,525 INFO L225 Difference]: With dead ends: 40629 [2018-12-03 07:44:56,525 INFO L226 Difference]: Without dead ends: 40565 [2018-12-03 07:44:56,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 311 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=277, Invalid=1055, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 07:44:56,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40565 states. [2018-12-03 07:44:56,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40565 to 33477. [2018-12-03 07:44:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33477 states. [2018-12-03 07:44:56,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33477 states to 33477 states and 106323 transitions. [2018-12-03 07:44:56,978 INFO L78 Accepts]: Start accepts. Automaton has 33477 states and 106323 transitions. Word has length 79 [2018-12-03 07:44:56,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:44:56,979 INFO L480 AbstractCegarLoop]: Abstraction has 33477 states and 106323 transitions. [2018-12-03 07:44:56,979 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 07:44:56,979 INFO L276 IsEmpty]: Start isEmpty. Operand 33477 states and 106323 transitions. [2018-12-03 07:44:57,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 07:44:57,003 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:44:57,003 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-03 07:44:57,003 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:44:57,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:44:57,004 INFO L82 PathProgramCache]: Analyzing trace with hash -341105651, now seen corresponding path program 1 times [2018-12-03 07:44:57,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:44:57,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:57,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:44:57,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:57,005 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:44:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:44:57,031 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-03 07:44:57,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:44:57,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 07:44:57,032 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:44:57,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 07:44:57,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 07:44:57,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 07:44:57,032 INFO L87 Difference]: Start difference. First operand 33477 states and 106323 transitions. Second operand 4 states. [2018-12-03 07:44:57,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:44:57,294 INFO L93 Difference]: Finished difference Result 39513 states and 123931 transitions. [2018-12-03 07:44:57,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:44:57,294 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2018-12-03 07:44:57,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:44:57,350 INFO L225 Difference]: With dead ends: 39513 [2018-12-03 07:44:57,351 INFO L226 Difference]: Without dead ends: 39273 [2018-12-03 07:44:57,351 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-03 07:44:57,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39273 states. [2018-12-03 07:44:57,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39273 to 37605. [2018-12-03 07:44:57,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37605 states. [2018-12-03 07:44:57,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37605 states to 37605 states and 118468 transitions. [2018-12-03 07:44:57,792 INFO L78 Accepts]: Start accepts. Automaton has 37605 states and 118468 transitions. Word has length 81 [2018-12-03 07:44:57,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:44:57,793 INFO L480 AbstractCegarLoop]: Abstraction has 37605 states and 118468 transitions. [2018-12-03 07:44:57,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 07:44:57,793 INFO L276 IsEmpty]: Start isEmpty. Operand 37605 states and 118468 transitions. [2018-12-03 07:44:57,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 07:44:57,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:44:57,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:44:57,827 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:44:57,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:44:57,828 INFO L82 PathProgramCache]: Analyzing trace with hash 2018201358, now seen corresponding path program 1 times [2018-12-03 07:44:57,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:44:57,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:57,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:44:57,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:57,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:44:57,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:44:57,856 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-03 07:44:57,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:44:57,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:44:57,856 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:44:57,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:44:57,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:44:57,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:44:57,857 INFO L87 Difference]: Start difference. First operand 37605 states and 118468 transitions. Second operand 3 states. [2018-12-03 07:44:58,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:44:58,053 INFO L93 Difference]: Finished difference Result 39589 states and 124426 transitions. [2018-12-03 07:44:58,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:44:58,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-03 07:44:58,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:44:58,103 INFO L225 Difference]: With dead ends: 39589 [2018-12-03 07:44:58,103 INFO L226 Difference]: Without dead ends: 39589 [2018-12-03 07:44:58,103 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-03 07:44:58,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39589 states. [2018-12-03 07:44:58,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39589 to 38593. [2018-12-03 07:44:58,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38593 states. [2018-12-03 07:44:58,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38593 states to 38593 states and 121424 transitions. [2018-12-03 07:44:58,540 INFO L78 Accepts]: Start accepts. Automaton has 38593 states and 121424 transitions. Word has length 81 [2018-12-03 07:44:58,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:44:58,541 INFO L480 AbstractCegarLoop]: Abstraction has 38593 states and 121424 transitions. [2018-12-03 07:44:58,541 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:44:58,541 INFO L276 IsEmpty]: Start isEmpty. Operand 38593 states and 121424 transitions. [2018-12-03 07:44:58,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 07:44:58,569 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:44:58,569 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] [2018-12-03 07:44:58,570 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:44:58,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:44:58,570 INFO L82 PathProgramCache]: Analyzing trace with hash -259330474, now seen corresponding path program 1 times [2018-12-03 07:44:58,570 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:44:58,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:58,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:44:58,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:58,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:44:58,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:44:58,597 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-03 07:44:58,597 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:44:58,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 07:44:58,597 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:44:58,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 07:44:58,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 07:44:58,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 07:44:58,598 INFO L87 Difference]: Start difference. First operand 38593 states and 121424 transitions. Second operand 3 states. [2018-12-03 07:44:58,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:44:58,702 INFO L93 Difference]: Finished difference Result 36440 states and 112816 transitions. [2018-12-03 07:44:58,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 07:44:58,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2018-12-03 07:44:58,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:44:58,750 INFO L225 Difference]: With dead ends: 36440 [2018-12-03 07:44:58,750 INFO L226 Difference]: Without dead ends: 36440 [2018-12-03 07:44:58,750 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-03 07:44:58,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36440 states. [2018-12-03 07:44:59,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36440 to 34804. [2018-12-03 07:44:59,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34804 states. [2018-12-03 07:44:59,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34804 states to 34804 states and 108109 transitions. [2018-12-03 07:44:59,255 INFO L78 Accepts]: Start accepts. Automaton has 34804 states and 108109 transitions. Word has length 82 [2018-12-03 07:44:59,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:44:59,255 INFO L480 AbstractCegarLoop]: Abstraction has 34804 states and 108109 transitions. [2018-12-03 07:44:59,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 07:44:59,255 INFO L276 IsEmpty]: Start isEmpty. Operand 34804 states and 108109 transitions. [2018-12-03 07:44:59,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 07:44:59,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:44:59,279 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] [2018-12-03 07:44:59,279 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:44:59,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:44:59,279 INFO L82 PathProgramCache]: Analyzing trace with hash 70435287, now seen corresponding path program 1 times [2018-12-03 07:44:59,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:44:59,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:59,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:44:59,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:44:59,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:44:59,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:44:59,328 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-03 07:44:59,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:44:59,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 07:44:59,328 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:44:59,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:44:59,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:44:59,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:44:59,329 INFO L87 Difference]: Start difference. First operand 34804 states and 108109 transitions. Second operand 7 states. [2018-12-03 07:44:59,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:44:59,961 INFO L93 Difference]: Finished difference Result 61448 states and 189280 transitions. [2018-12-03 07:44:59,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 07:44:59,961 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-03 07:44:59,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:45:00,039 INFO L225 Difference]: With dead ends: 61448 [2018-12-03 07:45:00,039 INFO L226 Difference]: Without dead ends: 61112 [2018-12-03 07:45:00,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-03 07:45:00,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61112 states. [2018-12-03 07:45:00,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61112 to 36161. [2018-12-03 07:45:00,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36161 states. [2018-12-03 07:45:00,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36161 states to 36161 states and 112088 transitions. [2018-12-03 07:45:00,595 INFO L78 Accepts]: Start accepts. Automaton has 36161 states and 112088 transitions. Word has length 82 [2018-12-03 07:45:00,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:45:00,596 INFO L480 AbstractCegarLoop]: Abstraction has 36161 states and 112088 transitions. [2018-12-03 07:45:00,596 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:45:00,596 INFO L276 IsEmpty]: Start isEmpty. Operand 36161 states and 112088 transitions. [2018-12-03 07:45:00,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 07:45:00,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:45:00,621 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] [2018-12-03 07:45:00,622 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:45:00,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:45:00,622 INFO L82 PathProgramCache]: Analyzing trace with hash -852248296, now seen corresponding path program 1 times [2018-12-03 07:45:00,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:45:00,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:00,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:45:00,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:00,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:45:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:45:00,702 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-03 07:45:00,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:45:00,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 07:45:00,702 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:45:00,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 07:45:00,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 07:45:00,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:45:00,703 INFO L87 Difference]: Start difference. First operand 36161 states and 112088 transitions. Second operand 8 states. [2018-12-03 07:45:01,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:45:01,474 INFO L93 Difference]: Finished difference Result 53145 states and 161315 transitions. [2018-12-03 07:45:01,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 07:45:01,475 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2018-12-03 07:45:01,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:45:01,541 INFO L225 Difference]: With dead ends: 53145 [2018-12-03 07:45:01,541 INFO L226 Difference]: Without dead ends: 53145 [2018-12-03 07:45:01,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2018-12-03 07:45:01,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53145 states. [2018-12-03 07:45:01,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53145 to 35117. [2018-12-03 07:45:01,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35117 states. [2018-12-03 07:45:02,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35117 states to 35117 states and 108430 transitions. [2018-12-03 07:45:02,051 INFO L78 Accepts]: Start accepts. Automaton has 35117 states and 108430 transitions. Word has length 82 [2018-12-03 07:45:02,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:45:02,051 INFO L480 AbstractCegarLoop]: Abstraction has 35117 states and 108430 transitions. [2018-12-03 07:45:02,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 07:45:02,052 INFO L276 IsEmpty]: Start isEmpty. Operand 35117 states and 108430 transitions. [2018-12-03 07:45:02,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-03 07:45:02,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:45:02,076 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] [2018-12-03 07:45:02,076 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:45:02,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:45:02,076 INFO L82 PathProgramCache]: Analyzing trace with hash 873232601, now seen corresponding path program 1 times [2018-12-03 07:45:02,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:45:02,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:02,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:45:02,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:02,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:45:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:45:02,116 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-03 07:45:02,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:45:02,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:45:02,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:45:02,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:45:02,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:45:02,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:45:02,117 INFO L87 Difference]: Start difference. First operand 35117 states and 108430 transitions. Second operand 5 states. [2018-12-03 07:45:02,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:45:02,137 INFO L93 Difference]: Finished difference Result 4641 states and 11865 transitions. [2018-12-03 07:45:02,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:45:02,137 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-03 07:45:02,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:45:02,140 INFO L225 Difference]: With dead ends: 4641 [2018-12-03 07:45:02,140 INFO L226 Difference]: Without dead ends: 4025 [2018-12-03 07:45:02,140 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-03 07:45:02,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2018-12-03 07:45:02,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 3903. [2018-12-03 07:45:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3903 states. [2018-12-03 07:45:02,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3903 states to 3903 states and 9981 transitions. [2018-12-03 07:45:02,169 INFO L78 Accepts]: Start accepts. Automaton has 3903 states and 9981 transitions. Word has length 82 [2018-12-03 07:45:02,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:45:02,169 INFO L480 AbstractCegarLoop]: Abstraction has 3903 states and 9981 transitions. [2018-12-03 07:45:02,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:45:02,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3903 states and 9981 transitions. [2018-12-03 07:45:02,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 07:45:02,172 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:45:02,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] [2018-12-03 07:45:02,172 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:45:02,172 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:45:02,172 INFO L82 PathProgramCache]: Analyzing trace with hash 585677774, now seen corresponding path program 1 times [2018-12-03 07:45:02,173 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:45:02,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:02,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:45:02,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:02,174 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:45:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:45:02,249 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-03 07:45:02,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:45:02,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 07:45:02,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:45:02,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 07:45:02,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 07:45:02,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:45:02,250 INFO L87 Difference]: Start difference. First operand 3903 states and 9981 transitions. Second operand 8 states. [2018-12-03 07:45:02,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:45:02,625 INFO L93 Difference]: Finished difference Result 6980 states and 17751 transitions. [2018-12-03 07:45:02,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 07:45:02,626 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-03 07:45:02,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:45:02,631 INFO L225 Difference]: With dead ends: 6980 [2018-12-03 07:45:02,632 INFO L226 Difference]: Without dead ends: 6948 [2018-12-03 07:45:02,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-03 07:45:02,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6948 states. [2018-12-03 07:45:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6948 to 4115. [2018-12-03 07:45:02,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4115 states. [2018-12-03 07:45:02,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4115 states to 4115 states and 10495 transitions. [2018-12-03 07:45:02,672 INFO L78 Accepts]: Start accepts. Automaton has 4115 states and 10495 transitions. Word has length 94 [2018-12-03 07:45:02,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:45:02,673 INFO L480 AbstractCegarLoop]: Abstraction has 4115 states and 10495 transitions. [2018-12-03 07:45:02,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 07:45:02,673 INFO L276 IsEmpty]: Start isEmpty. Operand 4115 states and 10495 transitions. [2018-12-03 07:45:02,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 07:45:02,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:45:02,675 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:45:02,675 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:45:02,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:45:02,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1547291791, now seen corresponding path program 1 times [2018-12-03 07:45:02,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:45:02,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:02,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:45:02,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:02,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:45:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:45:02,711 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-03 07:45:02,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:45:02,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:45:02,712 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:45:02,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:45:02,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:45:02,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:45:02,712 INFO L87 Difference]: Start difference. First operand 4115 states and 10495 transitions. Second operand 5 states. [2018-12-03 07:45:02,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:45:02,818 INFO L93 Difference]: Finished difference Result 4847 states and 12188 transitions. [2018-12-03 07:45:02,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 07:45:02,818 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-03 07:45:02,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:45:02,821 INFO L225 Difference]: With dead ends: 4847 [2018-12-03 07:45:02,821 INFO L226 Difference]: Without dead ends: 4847 [2018-12-03 07:45:02,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 07:45:02,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4847 states. [2018-12-03 07:45:02,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4847 to 4271. [2018-12-03 07:45:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4271 states. [2018-12-03 07:45:02,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4271 states to 4271 states and 10831 transitions. [2018-12-03 07:45:02,851 INFO L78 Accepts]: Start accepts. Automaton has 4271 states and 10831 transitions. Word has length 94 [2018-12-03 07:45:02,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:45:02,851 INFO L480 AbstractCegarLoop]: Abstraction has 4271 states and 10831 transitions. [2018-12-03 07:45:02,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:45:02,851 INFO L276 IsEmpty]: Start isEmpty. Operand 4271 states and 10831 transitions. [2018-12-03 07:45:02,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 07:45:02,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:45:02,853 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] [2018-12-03 07:45:02,854 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:45:02,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:45:02,854 INFO L82 PathProgramCache]: Analyzing trace with hash 122733116, now seen corresponding path program 1 times [2018-12-03 07:45:02,854 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:45:02,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:02,855 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:45:02,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:02,855 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:45:02,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:45:02,924 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-03 07:45:02,924 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:45:02,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 07:45:02,925 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:45:02,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 07:45:02,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 07:45:02,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:45:02,925 INFO L87 Difference]: Start difference. First operand 4271 states and 10831 transitions. Second operand 7 states. [2018-12-03 07:45:03,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:45:03,060 INFO L93 Difference]: Finished difference Result 4719 states and 11865 transitions. [2018-12-03 07:45:03,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:45:03,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-03 07:45:03,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:45:03,064 INFO L225 Difference]: With dead ends: 4719 [2018-12-03 07:45:03,064 INFO L226 Difference]: Without dead ends: 4719 [2018-12-03 07:45:03,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 07:45:03,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4719 states. [2018-12-03 07:45:03,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4719 to 4381. [2018-12-03 07:45:03,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4381 states. [2018-12-03 07:45:03,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 11051 transitions. [2018-12-03 07:45:03,108 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 11051 transitions. Word has length 94 [2018-12-03 07:45:03,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:45:03,108 INFO L480 AbstractCegarLoop]: Abstraction has 4381 states and 11051 transitions. [2018-12-03 07:45:03,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 07:45:03,108 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 11051 transitions. [2018-12-03 07:45:03,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 07:45:03,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:45:03,112 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] [2018-12-03 07:45:03,112 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:45:03,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:45:03,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1060614181, now seen corresponding path program 1 times [2018-12-03 07:45:03,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:45:03,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:03,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:45:03,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:03,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:45:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:45:03,187 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-03 07:45:03,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:45:03,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:45:03,187 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:45:03,187 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:45:03,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:45:03,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:45:03,188 INFO L87 Difference]: Start difference. First operand 4381 states and 11051 transitions. Second operand 5 states. [2018-12-03 07:45:03,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:45:03,257 INFO L93 Difference]: Finished difference Result 4101 states and 10345 transitions. [2018-12-03 07:45:03,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 07:45:03,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-03 07:45:03,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:45:03,260 INFO L225 Difference]: With dead ends: 4101 [2018-12-03 07:45:03,261 INFO L226 Difference]: Without dead ends: 4101 [2018-12-03 07:45:03,261 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:45:03,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4101 states. [2018-12-03 07:45:03,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4101 to 4021. [2018-12-03 07:45:03,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4021 states. [2018-12-03 07:45:03,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4021 states to 4021 states and 10180 transitions. [2018-12-03 07:45:03,296 INFO L78 Accepts]: Start accepts. Automaton has 4021 states and 10180 transitions. Word has length 94 [2018-12-03 07:45:03,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:45:03,296 INFO L480 AbstractCegarLoop]: Abstraction has 4021 states and 10180 transitions. [2018-12-03 07:45:03,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:45:03,296 INFO L276 IsEmpty]: Start isEmpty. Operand 4021 states and 10180 transitions. [2018-12-03 07:45:03,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 07:45:03,299 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:45:03,299 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:45:03,300 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:45:03,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:45:03,300 INFO L82 PathProgramCache]: Analyzing trace with hash -375425382, now seen corresponding path program 1 times [2018-12-03 07:45:03,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:45:03,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:03,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:45:03,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:03,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:45:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:45:03,361 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-03 07:45:03,361 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:45:03,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:45:03,361 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:45:03,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:45:03,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:45:03,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:45:03,362 INFO L87 Difference]: Start difference. First operand 4021 states and 10180 transitions. Second operand 6 states. [2018-12-03 07:45:03,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:45:03,449 INFO L93 Difference]: Finished difference Result 3781 states and 9388 transitions. [2018-12-03 07:45:03,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 07:45:03,450 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-03 07:45:03,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:45:03,453 INFO L225 Difference]: With dead ends: 3781 [2018-12-03 07:45:03,453 INFO L226 Difference]: Without dead ends: 3781 [2018-12-03 07:45:03,453 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-03 07:45:03,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3781 states. [2018-12-03 07:45:03,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3781 to 3257. [2018-12-03 07:45:03,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3257 states. [2018-12-03 07:45:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3257 states to 3257 states and 8161 transitions. [2018-12-03 07:45:03,478 INFO L78 Accepts]: Start accepts. Automaton has 3257 states and 8161 transitions. Word has length 94 [2018-12-03 07:45:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:45:03,478 INFO L480 AbstractCegarLoop]: Abstraction has 3257 states and 8161 transitions. [2018-12-03 07:45:03,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:45:03,478 INFO L276 IsEmpty]: Start isEmpty. Operand 3257 states and 8161 transitions. [2018-12-03 07:45:03,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 07:45:03,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:45:03,480 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] [2018-12-03 07:45:03,481 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:45:03,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:45:03,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1353284032, now seen corresponding path program 1 times [2018-12-03 07:45:03,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:45:03,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:03,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:45:03,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:03,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:45:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:45:03,539 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-03 07:45:03,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:45:03,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 07:45:03,540 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:45:03,540 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 07:45:03,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 07:45:03,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 07:45:03,541 INFO L87 Difference]: Start difference. First operand 3257 states and 8161 transitions. Second operand 6 states. [2018-12-03 07:45:03,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:45:03,647 INFO L93 Difference]: Finished difference Result 3648 states and 8951 transitions. [2018-12-03 07:45:03,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 07:45:03,647 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-03 07:45:03,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:45:03,649 INFO L225 Difference]: With dead ends: 3648 [2018-12-03 07:45:03,649 INFO L226 Difference]: Without dead ends: 3648 [2018-12-03 07:45:03,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-03 07:45:03,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2018-12-03 07:45:03,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 3395. [2018-12-03 07:45:03,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3395 states. [2018-12-03 07:45:03,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3395 states to 3395 states and 8440 transitions. [2018-12-03 07:45:03,672 INFO L78 Accepts]: Start accepts. Automaton has 3395 states and 8440 transitions. Word has length 96 [2018-12-03 07:45:03,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:45:03,673 INFO L480 AbstractCegarLoop]: Abstraction has 3395 states and 8440 transitions. [2018-12-03 07:45:03,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 07:45:03,673 INFO L276 IsEmpty]: Start isEmpty. Operand 3395 states and 8440 transitions. [2018-12-03 07:45:03,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 07:45:03,675 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:45:03,675 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 07:45:03,676 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:45:03,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:45:03,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2026684544, now seen corresponding path program 1 times [2018-12-03 07:45:03,676 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:45:03,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:03,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:45:03,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:03,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:45:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:45:03,721 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-03 07:45:03,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:45:03,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 07:45:03,722 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:45:03,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 07:45:03,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 07:45:03,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 07:45:03,722 INFO L87 Difference]: Start difference. First operand 3395 states and 8440 transitions. Second operand 5 states. [2018-12-03 07:45:03,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:45:03,826 INFO L93 Difference]: Finished difference Result 3843 states and 9544 transitions. [2018-12-03 07:45:03,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 07:45:03,826 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-03 07:45:03,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:45:03,829 INFO L225 Difference]: With dead ends: 3843 [2018-12-03 07:45:03,829 INFO L226 Difference]: Without dead ends: 3811 [2018-12-03 07:45:03,830 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-03 07:45:03,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3811 states. [2018-12-03 07:45:03,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3811 to 3181. [2018-12-03 07:45:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3181 states. [2018-12-03 07:45:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3181 states to 3181 states and 7917 transitions. [2018-12-03 07:45:03,861 INFO L78 Accepts]: Start accepts. Automaton has 3181 states and 7917 transitions. Word has length 96 [2018-12-03 07:45:03,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:45:03,861 INFO L480 AbstractCegarLoop]: Abstraction has 3181 states and 7917 transitions. [2018-12-03 07:45:03,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 07:45:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand 3181 states and 7917 transitions. [2018-12-03 07:45:03,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 07:45:03,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:45:03,863 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] [2018-12-03 07:45:03,863 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:45:03,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:45:03,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1023518271, now seen corresponding path program 1 times [2018-12-03 07:45:03,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:45:03,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:03,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:45:03,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:03,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:45:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:45:03,981 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-03 07:45:03,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:45:03,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 07:45:03,981 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:45:03,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 07:45:03,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 07:45:03,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 07:45:03,982 INFO L87 Difference]: Start difference. First operand 3181 states and 7917 transitions. Second operand 10 states. [2018-12-03 07:45:04,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:45:04,274 INFO L93 Difference]: Finished difference Result 5247 states and 13291 transitions. [2018-12-03 07:45:04,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 07:45:04,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-03 07:45:04,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:45:04,276 INFO L225 Difference]: With dead ends: 5247 [2018-12-03 07:45:04,276 INFO L226 Difference]: Without dead ends: 2072 [2018-12-03 07:45:04,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-03 07:45:04,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2072 states. [2018-12-03 07:45:04,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2072 to 2072. [2018-12-03 07:45:04,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2072 states. [2018-12-03 07:45:04,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2072 states to 2072 states and 5362 transitions. [2018-12-03 07:45:04,289 INFO L78 Accepts]: Start accepts. Automaton has 2072 states and 5362 transitions. Word has length 96 [2018-12-03 07:45:04,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:45:04,289 INFO L480 AbstractCegarLoop]: Abstraction has 2072 states and 5362 transitions. [2018-12-03 07:45:04,289 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 07:45:04,289 INFO L276 IsEmpty]: Start isEmpty. Operand 2072 states and 5362 transitions. [2018-12-03 07:45:04,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 07:45:04,290 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:45:04,290 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] [2018-12-03 07:45:04,291 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:45:04,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:45:04,291 INFO L82 PathProgramCache]: Analyzing trace with hash -390127679, now seen corresponding path program 2 times [2018-12-03 07:45:04,291 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:45:04,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:04,292 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 07:45:04,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:04,292 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:45:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 07:45:04,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 07:45:04,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 07:45:04,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 07:45:04,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 07:45:04,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 07:45:04,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 07:45:04,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 07:45:04,397 INFO L87 Difference]: Start difference. First operand 2072 states and 5362 transitions. Second operand 12 states. [2018-12-03 07:45:04,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 07:45:04,766 INFO L93 Difference]: Finished difference Result 3940 states and 10297 transitions. [2018-12-03 07:45:04,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 07:45:04,767 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-03 07:45:04,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 07:45:04,769 INFO L225 Difference]: With dead ends: 3940 [2018-12-03 07:45:04,769 INFO L226 Difference]: Without dead ends: 2804 [2018-12-03 07:45:04,769 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-03 07:45:04,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2804 states. [2018-12-03 07:45:04,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2804 to 2638. [2018-12-03 07:45:04,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2638 states. [2018-12-03 07:45:04,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2638 states to 2638 states and 6689 transitions. [2018-12-03 07:45:04,786 INFO L78 Accepts]: Start accepts. Automaton has 2638 states and 6689 transitions. Word has length 96 [2018-12-03 07:45:04,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 07:45:04,786 INFO L480 AbstractCegarLoop]: Abstraction has 2638 states and 6689 transitions. [2018-12-03 07:45:04,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 07:45:04,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2638 states and 6689 transitions. [2018-12-03 07:45:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 07:45:04,788 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 07:45:04,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 07:45:04,788 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 07:45:04,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 07:45:04,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1513895995, now seen corresponding path program 3 times [2018-12-03 07:45:04,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 07:45:04,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:04,789 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 07:45:04,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 07:45:04,789 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 07:45:04,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 07:45:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 07:45:04,824 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 07:45:04,883 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 07:45:04,884 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 07:45:04 BasicIcfg [2018-12-03 07:45:04,884 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 07:45:04,884 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 07:45:04,884 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 07:45:04,884 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 07:45:04,885 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 07:44:42" (3/4) ... [2018-12-03 07:45:04,886 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 07:45:04,948 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8be31b24-6038-40f9-a1b9-64c1e7da2d80/bin-2019/utaipan/witness.graphml [2018-12-03 07:45:04,949 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 07:45:04,949 INFO L168 Benchmark]: Toolchain (without parser) took 23081.28 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.7 GB). Free memory was 951.3 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 562.5 MB. Max. memory is 11.5 GB. [2018-12-03 07:45:04,950 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:45:04,950 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-03 07:45:04,950 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-03 07:45:04,950 INFO L168 Benchmark]: Boogie Preprocessor took 23.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:45:04,950 INFO L168 Benchmark]: RCFGBuilder took 369.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. [2018-12-03 07:45:04,951 INFO L168 Benchmark]: TraceAbstraction took 22254.33 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 528.7 MB. Max. memory is 11.5 GB. [2018-12-03 07:45:04,951 INFO L168 Benchmark]: Witness Printer took 64.57 ms. Allocated memory is still 3.7 GB. Free memory is still 3.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 07:45:04,952 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 156.2 MB). Free memory was 951.3 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.46 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 369.79 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22254.33 ms. Allocated memory was 1.2 GB in the beginning and 3.7 GB in the end (delta: 2.5 GB). Free memory was 1.1 GB in the beginning and 3.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 528.7 MB. Max. memory is 11.5 GB. * Witness Printer took 64.57 ms. Allocated memory is still 3.7 GB. Free memory is still 3.1 GB. There was no memory consumed. 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] [L680] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L681] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L682] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L683] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L684] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L685] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L686] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L687] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L688] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L689] -1 int *x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L690] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L691] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L692] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L693] -1 _Bool x$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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L695] -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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L697] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L698] -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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L699] -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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] -1 pthread_t t1105; 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L766] FCALL, FORK -1 pthread_create(&t1105, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L767] -1 pthread_t t1106; 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L768] FCALL, FORK -1 pthread_create(&t1106, ((void *)0), P1, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L723] 0 x$w_buff1 = x$w_buff0 [L724] 0 x$w_buff0 = 2 [L725] 0 x$w_buff1_used = x$w_buff0_used [L726] 0 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) 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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L728] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L729] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L730] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L731] 0 x$r_buff0_thd2 = (_Bool)1 [L734] 0 y = 1 [L737] 0 __unbuffered_p1_EAX = y [L740] 0 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L743] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L703] 1 z = 1 [L706] 1 x = 1 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=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L743] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L744] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) 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=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L744] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L709] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x 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=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L745] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L709] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) 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=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=1, z=1] [L709] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L710] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L710] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L746] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L746] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L747] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_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=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L747] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L750] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __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=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __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=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L711] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L712] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __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=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L712] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L713] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __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=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L713] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __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=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L770] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L774] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L775] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L776] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L776] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L777] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L778] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L778] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L781] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L782] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L783] -1 x$flush_delayed = weak$$choice2 [L784] -1 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] EXPR -1 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L785] -1 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L786] EXPR -1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L786] -1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L787] EXPR -1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L787] -1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L788] EXPR -1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L788] -1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L789] EXPR -1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L789] -1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L790] EXPR -1 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L790] -1 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L791] EXPR -1 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L791] -1 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L792] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] EXPR -1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L793] -1 x = x$flush_delayed ? x$mem_tmp : x [L794] -1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 181 locations, 3 error locations. UNSAFE Result, 22.1s OverallTime, 30 OverallIterations, 1 TraceHistogramMax, 10.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8296 SDtfs, 9101 SDslu, 19961 SDs, 0 SdLazy, 9431 SolverSat, 506 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 329 GetRequests, 87 SyntacticMatches, 17 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 622 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38835occurred in iteration=5, 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: 8.5s AutomataMinimizationTime, 29 MinimizatonAttempts, 167343 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2263 NumberOfCodeBlocks, 2263 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2138 ConstructedInterpolants, 0 QuantifiedInterpolants, 427249 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...