./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc_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_a9fe84ae-b796-4918-a1b6-abd10651e572/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a9fe84ae-b796-4918-a1b6-abd10651e572/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a9fe84ae-b796-4918-a1b6-abd10651e572/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a9fe84ae-b796-4918-a1b6-abd10651e572/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a9fe84ae-b796-4918-a1b6-abd10651e572/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a9fe84ae-b796-4918-a1b6-abd10651e572/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 874a9972fda7c5371d5beee908ce94ffa39446d7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 06:31:05,576 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 06:31:05,577 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 06:31:05,583 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 06:31:05,583 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 06:31:05,584 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 06:31:05,584 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 06:31:05,585 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 06:31:05,586 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 06:31:05,586 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 06:31:05,587 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 06:31:05,587 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 06:31:05,587 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 06:31:05,588 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 06:31:05,588 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 06:31:05,589 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 06:31:05,589 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 06:31:05,590 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 06:31:05,591 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 06:31:05,592 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 06:31:05,592 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 06:31:05,593 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 06:31:05,594 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 06:31:05,594 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 06:31:05,594 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 06:31:05,595 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 06:31:05,595 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 06:31:05,596 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 06:31:05,596 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 06:31:05,597 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 06:31:05,597 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 06:31:05,597 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 06:31:05,597 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 06:31:05,597 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 06:31:05,598 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 06:31:05,598 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 06:31:05,598 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a9fe84ae-b796-4918-a1b6-abd10651e572/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 06:31:05,606 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 06:31:05,606 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 06:31:05,606 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 06:31:05,606 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 06:31:05,606 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 06:31:05,606 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 06:31:05,607 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 06:31:05,607 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 06:31:05,607 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 06:31:05,607 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 06:31:05,607 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 06:31:05,607 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 06:31:05,607 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 06:31:05,607 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 06:31:05,607 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 06:31:05,607 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 06:31:05,608 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 06:31:05,608 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 06:31:05,608 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 06:31:05,608 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 06:31:05,608 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 06:31:05,608 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 06:31:05,608 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 06:31:05,608 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 06:31:05,608 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 06:31:05,608 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 06:31:05,608 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 06:31:05,608 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 06:31:05,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 06:31:05,609 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 06:31:05,609 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 06:31:05,609 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 06:31:05,609 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 06:31:05,609 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 06:31:05,609 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 06:31:05,609 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 06:31:05,609 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_a9fe84ae-b796-4918-a1b6-abd10651e572/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 -> 874a9972fda7c5371d5beee908ce94ffa39446d7 [2018-12-03 06:31:05,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 06:31:05,636 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 06:31:05,639 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 06:31:05,640 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 06:31:05,640 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 06:31:05,641 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a9fe84ae-b796-4918-a1b6-abd10651e572/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc_false-unreach-call.i [2018-12-03 06:31:05,686 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a9fe84ae-b796-4918-a1b6-abd10651e572/bin-2019/utaipan/data/5ca49a48c/c56f2ddf95144a0c93528dc3408a6058/FLAGba498513a [2018-12-03 06:31:06,117 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 06:31:06,118 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a9fe84ae-b796-4918-a1b6-abd10651e572/sv-benchmarks/c/pthread-wmm/mix012_rmo.oepc_false-unreach-call.i [2018-12-03 06:31:06,124 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a9fe84ae-b796-4918-a1b6-abd10651e572/bin-2019/utaipan/data/5ca49a48c/c56f2ddf95144a0c93528dc3408a6058/FLAGba498513a [2018-12-03 06:31:06,464 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a9fe84ae-b796-4918-a1b6-abd10651e572/bin-2019/utaipan/data/5ca49a48c/c56f2ddf95144a0c93528dc3408a6058 [2018-12-03 06:31:06,468 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 06:31:06,471 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 06:31:06,473 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 06:31:06,473 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 06:31:06,479 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 06:31:06,480 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:31:06" (1/1) ... [2018-12-03 06:31:06,483 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee6021e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:31:06, skipping insertion in model container [2018-12-03 06:31:06,483 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:31:06" (1/1) ... [2018-12-03 06:31:06,491 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 06:31:06,534 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 06:31:06,740 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:31:06,748 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 06:31:06,822 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:31:06,851 INFO L195 MainTranslator]: Completed translation [2018-12-03 06:31:06,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:31:06 WrapperNode [2018-12-03 06:31:06,852 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 06:31:06,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 06:31:06,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 06:31:06,852 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 06:31:06,858 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:31:06" (1/1) ... [2018-12-03 06:31:06,867 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:31:06" (1/1) ... [2018-12-03 06:31:06,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 06:31:06,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 06:31:06,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 06:31:06,884 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 06:31:06,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:31:06" (1/1) ... [2018-12-03 06:31:06,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:31:06" (1/1) ... [2018-12-03 06:31:06,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:31:06" (1/1) ... [2018-12-03 06:31:06,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:31:06" (1/1) ... [2018-12-03 06:31:06,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:31:06" (1/1) ... [2018-12-03 06:31:06,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:31:06" (1/1) ... [2018-12-03 06:31:06,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:31:06" (1/1) ... [2018-12-03 06:31:06,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 06:31:06,905 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 06:31:06,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 06:31:06,905 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 06:31:06,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:31:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a9fe84ae-b796-4918-a1b6-abd10651e572/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 06:31:06,938 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 06:31:06,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 06:31:06,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 06:31:06,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 06:31:06,938 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 06:31:06,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 06:31:06,939 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 06:31:06,939 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 06:31:06,939 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 06:31:06,939 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 06:31:06,939 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 06:31:06,940 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 06:31:07,249 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 06:31:07,249 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 06:31:07,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:31:07 BoogieIcfgContainer [2018-12-03 06:31:07,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 06:31:07,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 06:31:07,250 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 06:31:07,252 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 06:31:07,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 06:31:06" (1/3) ... [2018-12-03 06:31:07,252 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2316b882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:31:07, skipping insertion in model container [2018-12-03 06:31:07,252 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:31:06" (2/3) ... [2018-12-03 06:31:07,253 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2316b882 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:31:07, skipping insertion in model container [2018-12-03 06:31:07,253 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:31:07" (3/3) ... [2018-12-03 06:31:07,254 INFO L112 eAbstractionObserver]: Analyzing ICFG mix012_rmo.oepc_false-unreach-call.i [2018-12-03 06:31:07,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,276 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,276 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,276 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,276 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,277 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,277 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,277 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,280 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,281 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,281 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,281 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,282 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,282 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,282 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,282 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,282 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,282 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,282 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,282 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,282 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,283 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,284 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,285 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,286 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,287 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,288 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,289 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,290 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,291 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,292 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:31:07,296 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 06:31:07,296 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 06:31:07,301 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 06:31:07,310 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 06:31:07,326 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 06:31:07,326 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 06:31:07,326 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 06:31:07,326 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 06:31:07,326 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 06:31:07,326 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 06:31:07,326 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 06:31:07,326 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 06:31:07,332 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-03 06:31:08,934 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-03 06:31:08,935 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-03 06:31:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-03 06:31:08,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:08,940 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] [2018-12-03 06:31:08,942 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:08,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:08,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1782476305, now seen corresponding path program 1 times [2018-12-03 06:31:08,947 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:08,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:08,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:08,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:08,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:09,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:09,084 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 06:31:09,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:09,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:31:09,086 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:09,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:31:09,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:31:09,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:31:09,099 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-03 06:31:09,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:09,579 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-03 06:31:09,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:31:09,581 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-03 06:31:09,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:09,737 INFO L225 Difference]: With dead ends: 60791 [2018-12-03 06:31:09,737 INFO L226 Difference]: Without dead ends: 44271 [2018-12-03 06:31:09,739 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 06:31:09,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-03 06:31:10,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-03 06:31:10,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-03 06:31:10,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-03 06:31:10,514 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-03 06:31:10,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:10,514 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-03 06:31:10,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:31:10,515 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-03 06:31:10,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-03 06:31:10,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:10,521 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 06:31:10,521 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:10,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:10,522 INFO L82 PathProgramCache]: Analyzing trace with hash -983112731, now seen corresponding path program 1 times [2018-12-03 06:31:10,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:10,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:10,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:10,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:10,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:10,585 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 06:31:10,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:10,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:31:10,586 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:10,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:31:10,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:31:10,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:31:10,587 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2018-12-03 06:31:11,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:11,105 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2018-12-03 06:31:11,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:31:11,106 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-03 06:31:11,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:11,345 INFO L225 Difference]: With dead ends: 64005 [2018-12-03 06:31:11,346 INFO L226 Difference]: Without dead ends: 63453 [2018-12-03 06:31:11,346 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 06:31:11,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-03 06:31:11,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-03 06:31:11,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-03 06:31:12,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2018-12-03 06:31:12,090 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2018-12-03 06:31:12,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:12,091 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2018-12-03 06:31:12,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:31:12,091 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2018-12-03 06:31:12,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 06:31:12,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:12,096 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] [2018-12-03 06:31:12,096 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:12,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:12,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1484418599, now seen corresponding path program 1 times [2018-12-03 06:31:12,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:12,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:12,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:12,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:12,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:12,162 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 06:31:12,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:12,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:31:12,163 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:12,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:31:12,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:31:12,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:31:12,164 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2018-12-03 06:31:12,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:12,694 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2018-12-03 06:31:12,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:31:12,695 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-03 06:31:12,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:12,839 INFO L225 Difference]: With dead ends: 81367 [2018-12-03 06:31:12,839 INFO L226 Difference]: Without dead ends: 80855 [2018-12-03 06:31:12,839 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 06:31:13,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-03 06:31:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-03 06:31:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-03 06:31:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2018-12-03 06:31:13,810 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2018-12-03 06:31:13,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:13,810 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2018-12-03 06:31:13,810 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:31:13,810 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2018-12-03 06:31:13,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-03 06:31:13,815 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:13,815 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:31:13,815 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:13,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:13,815 INFO L82 PathProgramCache]: Analyzing trace with hash 375052511, now seen corresponding path program 1 times [2018-12-03 06:31:13,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:13,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:13,817 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:13,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:13,817 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:13,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:31:13,846 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:13,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:31:13,846 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:13,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:31:13,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:31:13,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:31:13,847 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2018-12-03 06:31:14,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:14,063 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2018-12-03 06:31:14,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:31:14,064 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-03 06:31:14,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:14,177 INFO L225 Difference]: With dead ends: 65251 [2018-12-03 06:31:14,177 INFO L226 Difference]: Without dead ends: 65251 [2018-12-03 06:31:14,177 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 06:31:14,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-03 06:31:15,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-03 06:31:15,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-03 06:31:15,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2018-12-03 06:31:15,173 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2018-12-03 06:31:15,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:15,174 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2018-12-03 06:31:15,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:31:15,174 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2018-12-03 06:31:15,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 06:31:15,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:15,181 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 06:31:15,181 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:15,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:15,182 INFO L82 PathProgramCache]: Analyzing trace with hash -559765890, now seen corresponding path program 1 times [2018-12-03 06:31:15,182 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:15,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:15,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:15,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:15,183 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:15,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:15,262 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 06:31:15,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:15,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:31:15,262 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:15,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:31:15,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:31:15,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:31:15,262 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2018-12-03 06:31:15,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:15,791 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2018-12-03 06:31:15,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:31:15,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-03 06:31:15,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:15,908 INFO L225 Difference]: With dead ends: 67511 [2018-12-03 06:31:15,908 INFO L226 Difference]: Without dead ends: 67511 [2018-12-03 06:31:15,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:31:16,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-03 06:31:16,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-03 06:31:16,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-03 06:31:16,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2018-12-03 06:31:16,959 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2018-12-03 06:31:16,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:16,959 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2018-12-03 06:31:16,959 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:31:16,959 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2018-12-03 06:31:16,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 06:31:16,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:16,967 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 06:31:16,967 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:16,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:16,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1938250047, now seen corresponding path program 1 times [2018-12-03 06:31:16,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:16,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:16,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:16,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:16,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:17,033 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 06:31:17,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:17,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:31:17,034 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:17,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:31:17,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:31:17,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:31:17,034 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2018-12-03 06:31:17,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:17,791 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2018-12-03 06:31:17,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 06:31:17,791 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-03 06:31:17,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:17,936 INFO L225 Difference]: With dead ends: 88528 [2018-12-03 06:31:17,936 INFO L226 Difference]: Without dead ends: 88528 [2018-12-03 06:31:17,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-03 06:31:18,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-03 06:31:18,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-03 06:31:18,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-03 06:31:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2018-12-03 06:31:19,343 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2018-12-03 06:31:19,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:19,343 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2018-12-03 06:31:19,343 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:31:19,343 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2018-12-03 06:31:19,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 06:31:19,352 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:19,352 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 06:31:19,352 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:19,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:19,352 INFO L82 PathProgramCache]: Analyzing trace with hash -1469213568, now seen corresponding path program 1 times [2018-12-03 06:31:19,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:19,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:19,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:19,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:19,353 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:19,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:19,385 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 06:31:19,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:19,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:31:19,385 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:19,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:31:19,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:31:19,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:31:19,386 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 3 states. [2018-12-03 06:31:19,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:19,570 INFO L93 Difference]: Finished difference Result 57182 states and 199435 transitions. [2018-12-03 06:31:19,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:31:19,571 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2018-12-03 06:31:19,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:19,671 INFO L225 Difference]: With dead ends: 57182 [2018-12-03 06:31:19,671 INFO L226 Difference]: Without dead ends: 57182 [2018-12-03 06:31:19,671 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 06:31:19,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57182 states. [2018-12-03 06:31:20,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57182 to 56447. [2018-12-03 06:31:20,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56447 states. [2018-12-03 06:31:20,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56447 states to 56447 states and 197181 transitions. [2018-12-03 06:31:20,486 INFO L78 Accepts]: Start accepts. Automaton has 56447 states and 197181 transitions. Word has length 53 [2018-12-03 06:31:20,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:20,486 INFO L480 AbstractCegarLoop]: Abstraction has 56447 states and 197181 transitions. [2018-12-03 06:31:20,486 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:31:20,486 INFO L276 IsEmpty]: Start isEmpty. Operand 56447 states and 197181 transitions. [2018-12-03 06:31:20,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-03 06:31:20,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:20,493 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 06:31:20,493 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:20,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:20,493 INFO L82 PathProgramCache]: Analyzing trace with hash -211879190, now seen corresponding path program 1 times [2018-12-03 06:31:20,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:20,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:20,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:20,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:20,494 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:20,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:20,531 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 06:31:20,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:20,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:31:20,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:20,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:31:20,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:31:20,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:31:20,532 INFO L87 Difference]: Start difference. First operand 56447 states and 197181 transitions. Second operand 6 states. [2018-12-03 06:31:21,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:21,043 INFO L93 Difference]: Finished difference Result 97908 states and 340995 transitions. [2018-12-03 06:31:21,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 06:31:21,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-03 06:31:21,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:21,206 INFO L225 Difference]: With dead ends: 97908 [2018-12-03 06:31:21,206 INFO L226 Difference]: Without dead ends: 97332 [2018-12-03 06:31:21,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-03 06:31:21,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97332 states. [2018-12-03 06:31:23,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97332 to 56676. [2018-12-03 06:31:23,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56676 states. [2018-12-03 06:31:23,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56676 states to 56676 states and 198353 transitions. [2018-12-03 06:31:23,132 INFO L78 Accepts]: Start accepts. Automaton has 56676 states and 198353 transitions. Word has length 53 [2018-12-03 06:31:23,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:23,132 INFO L480 AbstractCegarLoop]: Abstraction has 56676 states and 198353 transitions. [2018-12-03 06:31:23,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:31:23,132 INFO L276 IsEmpty]: Start isEmpty. Operand 56676 states and 198353 transitions. [2018-12-03 06:31:23,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 06:31:23,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:23,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:31:23,140 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:23,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:23,140 INFO L82 PathProgramCache]: Analyzing trace with hash 2074481868, now seen corresponding path program 1 times [2018-12-03 06:31:23,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:23,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:23,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:23,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:23,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:23,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:23,205 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 06:31:23,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:23,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:31:23,205 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:23,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:31:23,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:31:23,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:31:23,205 INFO L87 Difference]: Start difference. First operand 56676 states and 198353 transitions. Second operand 5 states. [2018-12-03 06:31:23,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:23,492 INFO L93 Difference]: Finished difference Result 56810 states and 198218 transitions. [2018-12-03 06:31:23,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:31:23,493 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-03 06:31:23,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:23,589 INFO L225 Difference]: With dead ends: 56810 [2018-12-03 06:31:23,590 INFO L226 Difference]: Without dead ends: 56810 [2018-12-03 06:31:23,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:31:23,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56810 states. [2018-12-03 06:31:24,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56810 to 56721. [2018-12-03 06:31:24,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56721 states. [2018-12-03 06:31:24,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56721 states to 56721 states and 197943 transitions. [2018-12-03 06:31:24,393 INFO L78 Accepts]: Start accepts. Automaton has 56721 states and 197943 transitions. Word has length 54 [2018-12-03 06:31:24,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:24,394 INFO L480 AbstractCegarLoop]: Abstraction has 56721 states and 197943 transitions. [2018-12-03 06:31:24,394 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:31:24,394 INFO L276 IsEmpty]: Start isEmpty. Operand 56721 states and 197943 transitions. [2018-12-03 06:31:24,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 06:31:24,400 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:24,400 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:31:24,401 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:24,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:24,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1332981747, now seen corresponding path program 1 times [2018-12-03 06:31:24,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:24,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:24,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:24,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:24,402 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:24,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:24,419 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 06:31:24,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:24,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:31:24,420 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:24,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:31:24,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:31:24,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:31:24,420 INFO L87 Difference]: Start difference. First operand 56721 states and 197943 transitions. Second operand 4 states. [2018-12-03 06:31:24,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:24,456 INFO L93 Difference]: Finished difference Result 12705 states and 39562 transitions. [2018-12-03 06:31:24,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:31:24,457 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2018-12-03 06:31:24,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:24,468 INFO L225 Difference]: With dead ends: 12705 [2018-12-03 06:31:24,468 INFO L226 Difference]: Without dead ends: 10887 [2018-12-03 06:31:24,469 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 06:31:24,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10887 states. [2018-12-03 06:31:24,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10887 to 10839. [2018-12-03 06:31:24,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10839 states. [2018-12-03 06:31:24,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10839 states to 10839 states and 33378 transitions. [2018-12-03 06:31:24,569 INFO L78 Accepts]: Start accepts. Automaton has 10839 states and 33378 transitions. Word has length 54 [2018-12-03 06:31:24,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:24,569 INFO L480 AbstractCegarLoop]: Abstraction has 10839 states and 33378 transitions. [2018-12-03 06:31:24,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:31:24,570 INFO L276 IsEmpty]: Start isEmpty. Operand 10839 states and 33378 transitions. [2018-12-03 06:31:24,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 06:31:24,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:24,572 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:31:24,572 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:24,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:24,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1760614074, now seen corresponding path program 1 times [2018-12-03 06:31:24,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:24,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:24,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:24,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:24,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:24,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:24,598 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 06:31:24,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:24,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:31:24,599 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:24,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:31:24,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:31:24,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:31:24,599 INFO L87 Difference]: Start difference. First operand 10839 states and 33378 transitions. Second operand 4 states. [2018-12-03 06:31:24,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:24,690 INFO L93 Difference]: Finished difference Result 12386 states and 38207 transitions. [2018-12-03 06:31:24,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:31:24,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-03 06:31:24,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:24,703 INFO L225 Difference]: With dead ends: 12386 [2018-12-03 06:31:24,703 INFO L226 Difference]: Without dead ends: 12386 [2018-12-03 06:31:24,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:31:24,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12386 states. [2018-12-03 06:31:24,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12386 to 11359. [2018-12-03 06:31:24,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11359 states. [2018-12-03 06:31:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11359 states to 11359 states and 34991 transitions. [2018-12-03 06:31:24,821 INFO L78 Accepts]: Start accepts. Automaton has 11359 states and 34991 transitions. Word has length 61 [2018-12-03 06:31:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:24,821 INFO L480 AbstractCegarLoop]: Abstraction has 11359 states and 34991 transitions. [2018-12-03 06:31:24,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:31:24,822 INFO L276 IsEmpty]: Start isEmpty. Operand 11359 states and 34991 transitions. [2018-12-03 06:31:24,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-03 06:31:24,824 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:24,824 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:31:24,824 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:24,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:24,824 INFO L82 PathProgramCache]: Analyzing trace with hash -17803739, now seen corresponding path program 1 times [2018-12-03 06:31:24,824 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:24,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:24,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:24,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:24,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:24,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:24,859 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 06:31:24,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:24,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:31:24,860 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:24,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:31:24,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:31:24,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:31:24,860 INFO L87 Difference]: Start difference. First operand 11359 states and 34991 transitions. Second operand 6 states. [2018-12-03 06:31:25,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:25,089 INFO L93 Difference]: Finished difference Result 20935 states and 64392 transitions. [2018-12-03 06:31:25,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 06:31:25,089 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-03 06:31:25,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:25,111 INFO L225 Difference]: With dead ends: 20935 [2018-12-03 06:31:25,111 INFO L226 Difference]: Without dead ends: 20864 [2018-12-03 06:31:25,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-03 06:31:25,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20864 states. [2018-12-03 06:31:25,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20864 to 13298. [2018-12-03 06:31:25,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13298 states. [2018-12-03 06:31:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13298 states to 13298 states and 40676 transitions. [2018-12-03 06:31:25,284 INFO L78 Accepts]: Start accepts. Automaton has 13298 states and 40676 transitions. Word has length 61 [2018-12-03 06:31:25,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:25,284 INFO L480 AbstractCegarLoop]: Abstraction has 13298 states and 40676 transitions. [2018-12-03 06:31:25,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:31:25,284 INFO L276 IsEmpty]: Start isEmpty. Operand 13298 states and 40676 transitions. [2018-12-03 06:31:25,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 06:31:25,288 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:25,288 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] [2018-12-03 06:31:25,288 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:25,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:25,288 INFO L82 PathProgramCache]: Analyzing trace with hash 859851853, now seen corresponding path program 1 times [2018-12-03 06:31:25,289 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:25,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:25,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:25,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:25,290 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:25,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:25,318 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 06:31:25,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:25,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:31:25,318 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:25,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:31:25,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:31:25,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:31:25,319 INFO L87 Difference]: Start difference. First operand 13298 states and 40676 transitions. Second operand 3 states. [2018-12-03 06:31:25,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:25,434 INFO L93 Difference]: Finished difference Result 13930 states and 42328 transitions. [2018-12-03 06:31:25,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:31:25,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-03 06:31:25,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:25,448 INFO L225 Difference]: With dead ends: 13930 [2018-12-03 06:31:25,448 INFO L226 Difference]: Without dead ends: 13930 [2018-12-03 06:31:25,449 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 06:31:25,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13930 states. [2018-12-03 06:31:25,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13930 to 13614. [2018-12-03 06:31:25,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13614 states. [2018-12-03 06:31:25,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13614 states to 13614 states and 41502 transitions. [2018-12-03 06:31:25,676 INFO L78 Accepts]: Start accepts. Automaton has 13614 states and 41502 transitions. Word has length 67 [2018-12-03 06:31:25,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:25,677 INFO L480 AbstractCegarLoop]: Abstraction has 13614 states and 41502 transitions. [2018-12-03 06:31:25,677 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:31:25,677 INFO L276 IsEmpty]: Start isEmpty. Operand 13614 states and 41502 transitions. [2018-12-03 06:31:25,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 06:31:25,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:25,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:31:25,681 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:25,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:25,681 INFO L82 PathProgramCache]: Analyzing trace with hash -101762164, now seen corresponding path program 1 times [2018-12-03 06:31:25,681 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:25,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:25,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:25,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:25,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:25,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:25,708 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 06:31:25,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:25,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:31:25,708 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:25,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:31:25,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:31:25,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:31:25,709 INFO L87 Difference]: Start difference. First operand 13614 states and 41502 transitions. Second operand 4 states. [2018-12-03 06:31:25,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:25,872 INFO L93 Difference]: Finished difference Result 17463 states and 52707 transitions. [2018-12-03 06:31:25,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:31:25,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-03 06:31:25,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:25,890 INFO L225 Difference]: With dead ends: 17463 [2018-12-03 06:31:25,890 INFO L226 Difference]: Without dead ends: 17463 [2018-12-03 06:31:25,890 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:31:25,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17463 states. [2018-12-03 06:31:26,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17463 to 15244. [2018-12-03 06:31:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15244 states. [2018-12-03 06:31:26,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15244 states to 15244 states and 46162 transitions. [2018-12-03 06:31:26,055 INFO L78 Accepts]: Start accepts. Automaton has 15244 states and 46162 transitions. Word has length 67 [2018-12-03 06:31:26,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:26,055 INFO L480 AbstractCegarLoop]: Abstraction has 15244 states and 46162 transitions. [2018-12-03 06:31:26,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:31:26,055 INFO L276 IsEmpty]: Start isEmpty. Operand 15244 states and 46162 transitions. [2018-12-03 06:31:26,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 06:31:26,061 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:26,061 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] [2018-12-03 06:31:26,061 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:26,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:26,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1143002317, now seen corresponding path program 1 times [2018-12-03 06:31:26,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:26,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:26,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:26,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:26,063 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:26,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:26,101 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 06:31:26,101 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:26,101 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:31:26,101 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:26,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:31:26,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:31:26,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:31:26,102 INFO L87 Difference]: Start difference. First operand 15244 states and 46162 transitions. Second operand 6 states. [2018-12-03 06:31:26,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:26,625 INFO L93 Difference]: Finished difference Result 18862 states and 56070 transitions. [2018-12-03 06:31:26,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:31:26,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-03 06:31:26,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:26,644 INFO L225 Difference]: With dead ends: 18862 [2018-12-03 06:31:26,644 INFO L226 Difference]: Without dead ends: 18862 [2018-12-03 06:31:26,644 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 06:31:26,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18862 states. [2018-12-03 06:31:26,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18862 to 17720. [2018-12-03 06:31:26,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17720 states. [2018-12-03 06:31:26,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17720 states to 17720 states and 53130 transitions. [2018-12-03 06:31:26,819 INFO L78 Accepts]: Start accepts. Automaton has 17720 states and 53130 transitions. Word has length 67 [2018-12-03 06:31:26,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:26,819 INFO L480 AbstractCegarLoop]: Abstraction has 17720 states and 53130 transitions. [2018-12-03 06:31:26,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:31:26,819 INFO L276 IsEmpty]: Start isEmpty. Operand 17720 states and 53130 transitions. [2018-12-03 06:31:26,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 06:31:26,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:26,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:31:26,825 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:26,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:26,826 INFO L82 PathProgramCache]: Analyzing trace with hash -934207026, now seen corresponding path program 1 times [2018-12-03 06:31:26,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:26,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:26,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:26,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:26,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:26,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:26,887 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 06:31:26,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:26,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:31:26,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:26,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:31:26,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:31:26,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:31:26,888 INFO L87 Difference]: Start difference. First operand 17720 states and 53130 transitions. Second operand 6 states. [2018-12-03 06:31:27,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:27,136 INFO L93 Difference]: Finished difference Result 20389 states and 59192 transitions. [2018-12-03 06:31:27,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 06:31:27,136 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-03 06:31:27,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:27,157 INFO L225 Difference]: With dead ends: 20389 [2018-12-03 06:31:27,157 INFO L226 Difference]: Without dead ends: 20389 [2018-12-03 06:31:27,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:31:27,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20389 states. [2018-12-03 06:31:27,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20389 to 18002. [2018-12-03 06:31:27,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18002 states. [2018-12-03 06:31:27,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18002 states to 18002 states and 53141 transitions. [2018-12-03 06:31:27,342 INFO L78 Accepts]: Start accepts. Automaton has 18002 states and 53141 transitions. Word has length 67 [2018-12-03 06:31:27,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:27,342 INFO L480 AbstractCegarLoop]: Abstraction has 18002 states and 53141 transitions. [2018-12-03 06:31:27,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:31:27,342 INFO L276 IsEmpty]: Start isEmpty. Operand 18002 states and 53141 transitions. [2018-12-03 06:31:27,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 06:31:27,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:27,348 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] [2018-12-03 06:31:27,348 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:27,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:27,348 INFO L82 PathProgramCache]: Analyzing trace with hash -722856113, now seen corresponding path program 1 times [2018-12-03 06:31:27,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:27,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:27,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:27,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:27,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:27,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:27,397 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 06:31:27,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:27,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:31:27,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:27,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:31:27,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:31:27,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:31:27,398 INFO L87 Difference]: Start difference. First operand 18002 states and 53141 transitions. Second operand 5 states. [2018-12-03 06:31:27,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:27,604 INFO L93 Difference]: Finished difference Result 23413 states and 68634 transitions. [2018-12-03 06:31:27,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:31:27,604 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-03 06:31:27,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:27,627 INFO L225 Difference]: With dead ends: 23413 [2018-12-03 06:31:27,627 INFO L226 Difference]: Without dead ends: 23413 [2018-12-03 06:31:27,627 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 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 06:31:27,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23413 states. [2018-12-03 06:31:27,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23413 to 21350. [2018-12-03 06:31:27,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21350 states. [2018-12-03 06:31:27,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21350 states to 21350 states and 62545 transitions. [2018-12-03 06:31:27,846 INFO L78 Accepts]: Start accepts. Automaton has 21350 states and 62545 transitions. Word has length 67 [2018-12-03 06:31:27,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:27,847 INFO L480 AbstractCegarLoop]: Abstraction has 21350 states and 62545 transitions. [2018-12-03 06:31:27,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:31:27,847 INFO L276 IsEmpty]: Start isEmpty. Operand 21350 states and 62545 transitions. [2018-12-03 06:31:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 06:31:27,853 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:27,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] [2018-12-03 06:31:27,853 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:27,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:27,853 INFO L82 PathProgramCache]: Analyzing trace with hash -1233390290, now seen corresponding path program 1 times [2018-12-03 06:31:27,853 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:27,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:27,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:27,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:27,854 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:27,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:27,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:31:27,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:27,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:31:27,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:27,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:31:27,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:31:27,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:31:27,893 INFO L87 Difference]: Start difference. First operand 21350 states and 62545 transitions. Second operand 4 states. [2018-12-03 06:31:28,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:28,201 INFO L93 Difference]: Finished difference Result 26638 states and 78155 transitions. [2018-12-03 06:31:28,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:31:28,201 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-03 06:31:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:28,229 INFO L225 Difference]: With dead ends: 26638 [2018-12-03 06:31:28,229 INFO L226 Difference]: Without dead ends: 26342 [2018-12-03 06:31:28,229 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 06:31:28,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26342 states. [2018-12-03 06:31:28,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26342 to 25026. [2018-12-03 06:31:28,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25026 states. [2018-12-03 06:31:28,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25026 states to 25026 states and 73322 transitions. [2018-12-03 06:31:28,498 INFO L78 Accepts]: Start accepts. Automaton has 25026 states and 73322 transitions. Word has length 67 [2018-12-03 06:31:28,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:28,498 INFO L480 AbstractCegarLoop]: Abstraction has 25026 states and 73322 transitions. [2018-12-03 06:31:28,498 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:31:28,498 INFO L276 IsEmpty]: Start isEmpty. Operand 25026 states and 73322 transitions. [2018-12-03 06:31:28,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 06:31:28,505 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:28,505 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] [2018-12-03 06:31:28,505 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:28,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:28,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1264625647, now seen corresponding path program 1 times [2018-12-03 06:31:28,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:28,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:28,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:28,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:28,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:28,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:28,532 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 06:31:28,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:28,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:31:28,532 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:28,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:31:28,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:31:28,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:31:28,533 INFO L87 Difference]: Start difference. First operand 25026 states and 73322 transitions. Second operand 5 states. [2018-12-03 06:31:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:28,571 INFO L93 Difference]: Finished difference Result 7314 states and 17674 transitions. [2018-12-03 06:31:28,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:31:28,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-03 06:31:28,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:28,576 INFO L225 Difference]: With dead ends: 7314 [2018-12-03 06:31:28,576 INFO L226 Difference]: Without dead ends: 6004 [2018-12-03 06:31:28,576 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 06:31:28,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6004 states. [2018-12-03 06:31:28,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6004 to 5514. [2018-12-03 06:31:28,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5514 states. [2018-12-03 06:31:28,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5514 states to 5514 states and 12848 transitions. [2018-12-03 06:31:28,614 INFO L78 Accepts]: Start accepts. Automaton has 5514 states and 12848 transitions. Word has length 67 [2018-12-03 06:31:28,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:28,614 INFO L480 AbstractCegarLoop]: Abstraction has 5514 states and 12848 transitions. [2018-12-03 06:31:28,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:31:28,614 INFO L276 IsEmpty]: Start isEmpty. Operand 5514 states and 12848 transitions. [2018-12-03 06:31:28,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-03 06:31:28,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:28,617 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] [2018-12-03 06:31:28,617 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:28,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:28,617 INFO L82 PathProgramCache]: Analyzing trace with hash 288361846, now seen corresponding path program 1 times [2018-12-03 06:31:28,617 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:28,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:28,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:28,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:28,618 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:28,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:28,633 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 06:31:28,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:28,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:31:28,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:28,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:31:28,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:31:28,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:31:28,634 INFO L87 Difference]: Start difference. First operand 5514 states and 12848 transitions. Second operand 3 states. [2018-12-03 06:31:28,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:28,661 INFO L93 Difference]: Finished difference Result 7126 states and 16417 transitions. [2018-12-03 06:31:28,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:31:28,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-03 06:31:28,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:28,666 INFO L225 Difference]: With dead ends: 7126 [2018-12-03 06:31:28,666 INFO L226 Difference]: Without dead ends: 7126 [2018-12-03 06:31:28,666 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 06:31:28,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7126 states. [2018-12-03 06:31:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7126 to 5453. [2018-12-03 06:31:28,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5453 states. [2018-12-03 06:31:28,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5453 states to 5453 states and 12388 transitions. [2018-12-03 06:31:28,709 INFO L78 Accepts]: Start accepts. Automaton has 5453 states and 12388 transitions. Word has length 67 [2018-12-03 06:31:28,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:28,709 INFO L480 AbstractCegarLoop]: Abstraction has 5453 states and 12388 transitions. [2018-12-03 06:31:28,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:31:28,709 INFO L276 IsEmpty]: Start isEmpty. Operand 5453 states and 12388 transitions. [2018-12-03 06:31:28,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 06:31:28,712 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:28,712 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 06:31:28,712 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:28,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:28,713 INFO L82 PathProgramCache]: Analyzing trace with hash -211461463, now seen corresponding path program 1 times [2018-12-03 06:31:28,713 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:28,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:28,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:28,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:28,714 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:28,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:28,754 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 06:31:28,755 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:28,755 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:31:28,755 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:28,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:31:28,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:31:28,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:31:28,755 INFO L87 Difference]: Start difference. First operand 5453 states and 12388 transitions. Second operand 5 states. [2018-12-03 06:31:28,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:28,855 INFO L93 Difference]: Finished difference Result 6617 states and 15012 transitions. [2018-12-03 06:31:28,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 06:31:28,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-03 06:31:28,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:28,860 INFO L225 Difference]: With dead ends: 6617 [2018-12-03 06:31:28,860 INFO L226 Difference]: Without dead ends: 6617 [2018-12-03 06:31:28,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:31:28,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6617 states. [2018-12-03 06:31:28,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6617 to 5897. [2018-12-03 06:31:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5897 states. [2018-12-03 06:31:28,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5897 states to 5897 states and 13392 transitions. [2018-12-03 06:31:28,903 INFO L78 Accepts]: Start accepts. Automaton has 5897 states and 13392 transitions. Word has length 73 [2018-12-03 06:31:28,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:28,903 INFO L480 AbstractCegarLoop]: Abstraction has 5897 states and 13392 transitions. [2018-12-03 06:31:28,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:31:28,903 INFO L276 IsEmpty]: Start isEmpty. Operand 5897 states and 13392 transitions. [2018-12-03 06:31:28,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-03 06:31:28,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:28,907 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 06:31:28,907 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:28,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:28,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1531348872, now seen corresponding path program 1 times [2018-12-03 06:31:28,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:28,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:28,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:28,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:28,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:28,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:28,976 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 06:31:28,977 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:28,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:31:28,977 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:28,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:31:28,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:31:28,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:31:28,977 INFO L87 Difference]: Start difference. First operand 5897 states and 13392 transitions. Second operand 7 states. [2018-12-03 06:31:29,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:29,224 INFO L93 Difference]: Finished difference Result 7099 states and 15961 transitions. [2018-12-03 06:31:29,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 06:31:29,224 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-03 06:31:29,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:29,229 INFO L225 Difference]: With dead ends: 7099 [2018-12-03 06:31:29,229 INFO L226 Difference]: Without dead ends: 6980 [2018-12-03 06:31:29,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-03 06:31:29,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6980 states. [2018-12-03 06:31:29,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6980 to 5994. [2018-12-03 06:31:29,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5994 states. [2018-12-03 06:31:29,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5994 states to 5994 states and 13485 transitions. [2018-12-03 06:31:29,279 INFO L78 Accepts]: Start accepts. Automaton has 5994 states and 13485 transitions. Word has length 73 [2018-12-03 06:31:29,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:29,279 INFO L480 AbstractCegarLoop]: Abstraction has 5994 states and 13485 transitions. [2018-12-03 06:31:29,279 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:31:29,279 INFO L276 IsEmpty]: Start isEmpty. Operand 5994 states and 13485 transitions. [2018-12-03 06:31:29,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:31:29,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:29,283 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 06:31:29,283 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:29,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:29,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1678014975, now seen corresponding path program 1 times [2018-12-03 06:31:29,283 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:29,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:29,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:29,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:29,284 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:29,320 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 06:31:29,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:29,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:31:29,321 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:29,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:31:29,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:31:29,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:31:29,321 INFO L87 Difference]: Start difference. First operand 5994 states and 13485 transitions. Second operand 5 states. [2018-12-03 06:31:29,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:29,520 INFO L93 Difference]: Finished difference Result 5550 states and 12354 transitions. [2018-12-03 06:31:29,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:31:29,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-03 06:31:29,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:29,524 INFO L225 Difference]: With dead ends: 5550 [2018-12-03 06:31:29,524 INFO L226 Difference]: Without dead ends: 5550 [2018-12-03 06:31:29,525 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:31:29,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5550 states. [2018-12-03 06:31:29,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5550 to 5153. [2018-12-03 06:31:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5153 states. [2018-12-03 06:31:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5153 states to 5153 states and 11452 transitions. [2018-12-03 06:31:29,560 INFO L78 Accepts]: Start accepts. Automaton has 5153 states and 11452 transitions. Word has length 94 [2018-12-03 06:31:29,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:29,560 INFO L480 AbstractCegarLoop]: Abstraction has 5153 states and 11452 transitions. [2018-12-03 06:31:29,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:31:29,560 INFO L276 IsEmpty]: Start isEmpty. Operand 5153 states and 11452 transitions. [2018-12-03 06:31:29,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-03 06:31:29,563 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:29,564 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:31:29,564 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:29,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:29,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1051349606, now seen corresponding path program 1 times [2018-12-03 06:31:29,564 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:29,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:29,565 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:29,565 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:29,565 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:29,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:29,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 06:31:29,598 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:29,598 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:31:29,598 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:29,598 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:31:29,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:31:29,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:31:29,599 INFO L87 Difference]: Start difference. First operand 5153 states and 11452 transitions. Second operand 4 states. [2018-12-03 06:31:29,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:29,760 INFO L93 Difference]: Finished difference Result 6337 states and 14007 transitions. [2018-12-03 06:31:29,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:31:29,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2018-12-03 06:31:29,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:29,766 INFO L225 Difference]: With dead ends: 6337 [2018-12-03 06:31:29,767 INFO L226 Difference]: Without dead ends: 6337 [2018-12-03 06:31:29,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 06:31:29,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6337 states. [2018-12-03 06:31:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6337 to 5568. [2018-12-03 06:31:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5568 states. [2018-12-03 06:31:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5568 states to 5568 states and 12373 transitions. [2018-12-03 06:31:29,830 INFO L78 Accepts]: Start accepts. Automaton has 5568 states and 12373 transitions. Word has length 94 [2018-12-03 06:31:29,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:29,830 INFO L480 AbstractCegarLoop]: Abstraction has 5568 states and 12373 transitions. [2018-12-03 06:31:29,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:31:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 5568 states and 12373 transitions. [2018-12-03 06:31:29,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:31:29,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:29,836 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 06:31:29,836 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:29,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:29,837 INFO L82 PathProgramCache]: Analyzing trace with hash 823121319, now seen corresponding path program 1 times [2018-12-03 06:31:29,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:29,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:29,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:29,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:29,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:29,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:31:29,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:29,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:31:29,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:29,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:31:29,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:31:29,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:31:29,893 INFO L87 Difference]: Start difference. First operand 5568 states and 12373 transitions. Second operand 7 states. [2018-12-03 06:31:30,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:30,501 INFO L93 Difference]: Finished difference Result 9573 states and 21333 transitions. [2018-12-03 06:31:30,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 06:31:30,501 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-03 06:31:30,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:30,507 INFO L225 Difference]: With dead ends: 9573 [2018-12-03 06:31:30,508 INFO L226 Difference]: Without dead ends: 9486 [2018-12-03 06:31:30,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2018-12-03 06:31:30,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9486 states. [2018-12-03 06:31:30,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9486 to 7509. [2018-12-03 06:31:30,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7509 states. [2018-12-03 06:31:30,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7509 states to 7509 states and 16816 transitions. [2018-12-03 06:31:30,567 INFO L78 Accepts]: Start accepts. Automaton has 7509 states and 16816 transitions. Word has length 96 [2018-12-03 06:31:30,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:30,567 INFO L480 AbstractCegarLoop]: Abstraction has 7509 states and 16816 transitions. [2018-12-03 06:31:30,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:31:30,567 INFO L276 IsEmpty]: Start isEmpty. Operand 7509 states and 16816 transitions. [2018-12-03 06:31:30,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:31:30,572 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:30,572 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 06:31:30,572 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:30,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:30,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1254088024, now seen corresponding path program 1 times [2018-12-03 06:31:30,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:30,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:30,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:30,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:30,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:30,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:31:30,631 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:30,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:31:30,631 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:30,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:31:30,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:31:30,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:31:30,631 INFO L87 Difference]: Start difference. First operand 7509 states and 16816 transitions. Second operand 6 states. [2018-12-03 06:31:30,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:30,765 INFO L93 Difference]: Finished difference Result 6652 states and 14633 transitions. [2018-12-03 06:31:30,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:31:30,765 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-03 06:31:30,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:30,769 INFO L225 Difference]: With dead ends: 6652 [2018-12-03 06:31:30,769 INFO L226 Difference]: Without dead ends: 6632 [2018-12-03 06:31:30,769 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 06:31:30,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6632 states. [2018-12-03 06:31:30,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6632 to 5635. [2018-12-03 06:31:30,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5635 states. [2018-12-03 06:31:30,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5635 states to 5635 states and 12500 transitions. [2018-12-03 06:31:30,808 INFO L78 Accepts]: Start accepts. Automaton has 5635 states and 12500 transitions. Word has length 96 [2018-12-03 06:31:30,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:30,808 INFO L480 AbstractCegarLoop]: Abstraction has 5635 states and 12500 transitions. [2018-12-03 06:31:30,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:31:30,808 INFO L276 IsEmpty]: Start isEmpty. Operand 5635 states and 12500 transitions. [2018-12-03 06:31:30,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:31:30,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:30,811 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 06:31:30,811 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:30,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:30,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1437621095, now seen corresponding path program 1 times [2018-12-03 06:31:30,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:30,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:30,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:30,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:30,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:30,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:30,852 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 06:31:30,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:30,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:31:30,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:30,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:31:30,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:31:30,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:31:30,853 INFO L87 Difference]: Start difference. First operand 5635 states and 12500 transitions. Second operand 5 states. [2018-12-03 06:31:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:31,026 INFO L93 Difference]: Finished difference Result 6826 states and 15038 transitions. [2018-12-03 06:31:31,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:31:31,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-03 06:31:31,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:31,030 INFO L225 Difference]: With dead ends: 6826 [2018-12-03 06:31:31,030 INFO L226 Difference]: Without dead ends: 6761 [2018-12-03 06:31:31,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:31:31,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6761 states. [2018-12-03 06:31:31,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6761 to 6287. [2018-12-03 06:31:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6287 states. [2018-12-03 06:31:31,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6287 states to 6287 states and 13887 transitions. [2018-12-03 06:31:31,074 INFO L78 Accepts]: Start accepts. Automaton has 6287 states and 13887 transitions. Word has length 96 [2018-12-03 06:31:31,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:31,074 INFO L480 AbstractCegarLoop]: Abstraction has 6287 states and 13887 transitions. [2018-12-03 06:31:31,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:31:31,074 INFO L276 IsEmpty]: Start isEmpty. Operand 6287 states and 13887 transitions. [2018-12-03 06:31:31,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:31:31,078 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:31,078 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 06:31:31,078 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:31,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:31,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1895732184, now seen corresponding path program 1 times [2018-12-03 06:31:31,078 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:31,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:31,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:31,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:31,079 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:31:31,120 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:31,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:31:31,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:31,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:31:31,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:31:31,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:31:31,121 INFO L87 Difference]: Start difference. First operand 6287 states and 13887 transitions. Second operand 5 states. [2018-12-03 06:31:31,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:31,254 INFO L93 Difference]: Finished difference Result 7428 states and 16365 transitions. [2018-12-03 06:31:31,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:31:31,255 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-03 06:31:31,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:31,259 INFO L225 Difference]: With dead ends: 7428 [2018-12-03 06:31:31,259 INFO L226 Difference]: Without dead ends: 7320 [2018-12-03 06:31:31,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 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 06:31:31,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7320 states. [2018-12-03 06:31:31,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7320 to 5841. [2018-12-03 06:31:31,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5841 states. [2018-12-03 06:31:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5841 states to 5841 states and 12979 transitions. [2018-12-03 06:31:31,304 INFO L78 Accepts]: Start accepts. Automaton has 5841 states and 12979 transitions. Word has length 96 [2018-12-03 06:31:31,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:31,304 INFO L480 AbstractCegarLoop]: Abstraction has 5841 states and 12979 transitions. [2018-12-03 06:31:31,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:31:31,304 INFO L276 IsEmpty]: Start isEmpty. Operand 5841 states and 12979 transitions. [2018-12-03 06:31:31,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:31:31,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:31,308 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 06:31:31,308 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:31,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:31,309 INFO L82 PathProgramCache]: Analyzing trace with hash -17003224, now seen corresponding path program 2 times [2018-12-03 06:31:31,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:31,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:31,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:31,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:31,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:31,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:31,377 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 06:31:31,378 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:31,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:31:31,378 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:31,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:31:31,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:31:31,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:31:31,379 INFO L87 Difference]: Start difference. First operand 5841 states and 12979 transitions. Second operand 7 states. [2018-12-03 06:31:31,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:31,613 INFO L93 Difference]: Finished difference Result 7146 states and 15871 transitions. [2018-12-03 06:31:31,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 06:31:31,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-03 06:31:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:31,618 INFO L225 Difference]: With dead ends: 7146 [2018-12-03 06:31:31,618 INFO L226 Difference]: Without dead ends: 7146 [2018-12-03 06:31:31,619 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-03 06:31:31,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7146 states. [2018-12-03 06:31:31,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7146 to 5957. [2018-12-03 06:31:31,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5957 states. [2018-12-03 06:31:31,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5957 states to 5957 states and 13242 transitions. [2018-12-03 06:31:31,665 INFO L78 Accepts]: Start accepts. Automaton has 5957 states and 13242 transitions. Word has length 96 [2018-12-03 06:31:31,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:31,665 INFO L480 AbstractCegarLoop]: Abstraction has 5957 states and 13242 transitions. [2018-12-03 06:31:31,665 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:31:31,665 INFO L276 IsEmpty]: Start isEmpty. Operand 5957 states and 13242 transitions. [2018-12-03 06:31:31,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:31:31,669 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:31,670 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 06:31:31,670 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:31,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:31,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1970478536, now seen corresponding path program 1 times [2018-12-03 06:31:31,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:31,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:31,671 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:31:31,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:31,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:31,773 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 06:31:31,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:31,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 06:31:31,774 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:31,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 06:31:31,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 06:31:31,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:31:31,774 INFO L87 Difference]: Start difference. First operand 5957 states and 13242 transitions. Second operand 9 states. [2018-12-03 06:31:32,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:32,124 INFO L93 Difference]: Finished difference Result 6448 states and 14298 transitions. [2018-12-03 06:31:32,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 06:31:32,124 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-03 06:31:32,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:32,128 INFO L225 Difference]: With dead ends: 6448 [2018-12-03 06:31:32,128 INFO L226 Difference]: Without dead ends: 6441 [2018-12-03 06:31:32,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-12-03 06:31:32,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6441 states. [2018-12-03 06:31:32,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6441 to 5996. [2018-12-03 06:31:32,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5996 states. [2018-12-03 06:31:32,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5996 states to 5996 states and 13325 transitions. [2018-12-03 06:31:32,170 INFO L78 Accepts]: Start accepts. Automaton has 5996 states and 13325 transitions. Word has length 96 [2018-12-03 06:31:32,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:32,170 INFO L480 AbstractCegarLoop]: Abstraction has 5996 states and 13325 transitions. [2018-12-03 06:31:32,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 06:31:32,170 INFO L276 IsEmpty]: Start isEmpty. Operand 5996 states and 13325 transitions. [2018-12-03 06:31:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:31:32,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:32,174 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 06:31:32,174 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:32,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:32,174 INFO L82 PathProgramCache]: Analyzing trace with hash -2113137847, now seen corresponding path program 1 times [2018-12-03 06:31:32,174 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:32,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:32,175 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:32,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:32,175 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:32,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:32,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:31:32,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:32,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 06:31:32,243 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:32,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 06:31:32,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 06:31:32,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-03 06:31:32,243 INFO L87 Difference]: Start difference. First operand 5996 states and 13325 transitions. Second operand 10 states. [2018-12-03 06:31:32,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:32,628 INFO L93 Difference]: Finished difference Result 7262 states and 16093 transitions. [2018-12-03 06:31:32,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 06:31:32,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2018-12-03 06:31:32,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:32,632 INFO L225 Difference]: With dead ends: 7262 [2018-12-03 06:31:32,632 INFO L226 Difference]: Without dead ends: 7262 [2018-12-03 06:31:32,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-12-03 06:31:32,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7262 states. [2018-12-03 06:31:32,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7262 to 6320. [2018-12-03 06:31:32,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6320 states. [2018-12-03 06:31:32,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6320 states to 6320 states and 14059 transitions. [2018-12-03 06:31:32,681 INFO L78 Accepts]: Start accepts. Automaton has 6320 states and 14059 transitions. Word has length 96 [2018-12-03 06:31:32,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:32,681 INFO L480 AbstractCegarLoop]: Abstraction has 6320 states and 14059 transitions. [2018-12-03 06:31:32,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 06:31:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 6320 states and 14059 transitions. [2018-12-03 06:31:32,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:31:32,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:32,685 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 06:31:32,685 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:32,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:32,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1225634166, now seen corresponding path program 1 times [2018-12-03 06:31:32,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:32,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:32,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:32,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:32,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:32,729 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 06:31:32,729 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:32,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:31:32,729 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:32,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:31:32,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:31:32,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:31:32,730 INFO L87 Difference]: Start difference. First operand 6320 states and 14059 transitions. Second operand 6 states. [2018-12-03 06:31:32,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:32,858 INFO L93 Difference]: Finished difference Result 6348 states and 14072 transitions. [2018-12-03 06:31:32,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:31:32,859 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-03 06:31:32,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:32,862 INFO L225 Difference]: With dead ends: 6348 [2018-12-03 06:31:32,862 INFO L226 Difference]: Without dead ends: 6348 [2018-12-03 06:31:32,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:31:32,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6348 states. [2018-12-03 06:31:32,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6348 to 6046. [2018-12-03 06:31:32,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6046 states. [2018-12-03 06:31:32,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6046 states to 6046 states and 13453 transitions. [2018-12-03 06:31:32,902 INFO L78 Accepts]: Start accepts. Automaton has 6046 states and 13453 transitions. Word has length 96 [2018-12-03 06:31:32,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:32,902 INFO L480 AbstractCegarLoop]: Abstraction has 6046 states and 13453 transitions. [2018-12-03 06:31:32,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:31:32,902 INFO L276 IsEmpty]: Start isEmpty. Operand 6046 states and 13453 transitions. [2018-12-03 06:31:32,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:31:32,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:32,906 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 06:31:32,906 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:32,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:32,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1123855095, now seen corresponding path program 1 times [2018-12-03 06:31:32,906 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:32,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:32,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:32,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:32,907 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:32,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:32,950 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 06:31:32,950 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:32,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:31:32,950 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:32,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:31:32,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:31:32,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:31:32,950 INFO L87 Difference]: Start difference. First operand 6046 states and 13453 transitions. Second operand 6 states. [2018-12-03 06:31:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:33,116 INFO L93 Difference]: Finished difference Result 7263 states and 16126 transitions. [2018-12-03 06:31:33,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 06:31:33,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-03 06:31:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:33,121 INFO L225 Difference]: With dead ends: 7263 [2018-12-03 06:31:33,121 INFO L226 Difference]: Without dead ends: 7263 [2018-12-03 06:31:33,121 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-03 06:31:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7263 states. [2018-12-03 06:31:33,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7263 to 6080. [2018-12-03 06:31:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6080 states. [2018-12-03 06:31:33,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6080 states to 6080 states and 13513 transitions. [2018-12-03 06:31:33,165 INFO L78 Accepts]: Start accepts. Automaton has 6080 states and 13513 transitions. Word has length 96 [2018-12-03 06:31:33,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:33,165 INFO L480 AbstractCegarLoop]: Abstraction has 6080 states and 13513 transitions. [2018-12-03 06:31:33,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:31:33,165 INFO L276 IsEmpty]: Start isEmpty. Operand 6080 states and 13513 transitions. [2018-12-03 06:31:33,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:31:33,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:33,169 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 06:31:33,169 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:33,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:33,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1105218985, now seen corresponding path program 1 times [2018-12-03 06:31:33,169 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:33,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:33,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:33,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:33,170 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:33,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:33,207 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 06:31:33,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:33,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:31:33,207 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:33,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:31:33,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:31:33,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:31:33,208 INFO L87 Difference]: Start difference. First operand 6080 states and 13513 transitions. Second operand 7 states. [2018-12-03 06:31:33,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:33,426 INFO L93 Difference]: Finished difference Result 7488 states and 16590 transitions. [2018-12-03 06:31:33,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 06:31:33,426 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-03 06:31:33,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:33,431 INFO L225 Difference]: With dead ends: 7488 [2018-12-03 06:31:33,431 INFO L226 Difference]: Without dead ends: 7488 [2018-12-03 06:31:33,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-03 06:31:33,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7488 states. [2018-12-03 06:31:33,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7488 to 6852. [2018-12-03 06:31:33,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6852 states. [2018-12-03 06:31:33,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6852 states to 6852 states and 15176 transitions. [2018-12-03 06:31:33,478 INFO L78 Accepts]: Start accepts. Automaton has 6852 states and 15176 transitions. Word has length 96 [2018-12-03 06:31:33,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:33,479 INFO L480 AbstractCegarLoop]: Abstraction has 6852 states and 15176 transitions. [2018-12-03 06:31:33,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:31:33,479 INFO L276 IsEmpty]: Start isEmpty. Operand 6852 states and 15176 transitions. [2018-12-03 06:31:33,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:31:33,483 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:33,483 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 06:31:33,483 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:33,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:33,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1202266551, now seen corresponding path program 1 times [2018-12-03 06:31:33,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:33,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:33,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:33,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:33,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:33,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:33,573 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 06:31:33,573 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:33,573 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 06:31:33,573 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:33,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 06:31:33,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 06:31:33,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-12-03 06:31:33,574 INFO L87 Difference]: Start difference. First operand 6852 states and 15176 transitions. Second operand 12 states. [2018-12-03 06:31:34,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:34,147 INFO L93 Difference]: Finished difference Result 8368 states and 18417 transitions. [2018-12-03 06:31:34,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-12-03 06:31:34,147 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 96 [2018-12-03 06:31:34,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:34,153 INFO L225 Difference]: With dead ends: 8368 [2018-12-03 06:31:34,153 INFO L226 Difference]: Without dead ends: 8368 [2018-12-03 06:31:34,153 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2018-12-03 06:31:34,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8368 states. [2018-12-03 06:31:34,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8368 to 7087. [2018-12-03 06:31:34,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7087 states. [2018-12-03 06:31:34,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7087 states to 7087 states and 15637 transitions. [2018-12-03 06:31:34,206 INFO L78 Accepts]: Start accepts. Automaton has 7087 states and 15637 transitions. Word has length 96 [2018-12-03 06:31:34,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:34,206 INFO L480 AbstractCegarLoop]: Abstraction has 7087 states and 15637 transitions. [2018-12-03 06:31:34,206 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 06:31:34,206 INFO L276 IsEmpty]: Start isEmpty. Operand 7087 states and 15637 transitions. [2018-12-03 06:31:34,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:31:34,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:34,211 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:31:34,211 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:34,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:34,211 INFO L82 PathProgramCache]: Analyzing trace with hash -103411957, now seen corresponding path program 1 times [2018-12-03 06:31:34,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:34,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:34,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:34,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:34,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:34,296 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 06:31:34,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:34,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 06:31:34,297 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:34,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 06:31:34,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 06:31:34,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 06:31:34,297 INFO L87 Difference]: Start difference. First operand 7087 states and 15637 transitions. Second operand 11 states. [2018-12-03 06:31:35,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:35,240 INFO L93 Difference]: Finished difference Result 13463 states and 30007 transitions. [2018-12-03 06:31:35,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-03 06:31:35,240 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-03 06:31:35,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:35,246 INFO L225 Difference]: With dead ends: 13463 [2018-12-03 06:31:35,246 INFO L226 Difference]: Without dead ends: 8779 [2018-12-03 06:31:35,246 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-03 06:31:35,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8779 states. [2018-12-03 06:31:35,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8779 to 6599. [2018-12-03 06:31:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6599 states. [2018-12-03 06:31:35,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6599 states to 6599 states and 14513 transitions. [2018-12-03 06:31:35,296 INFO L78 Accepts]: Start accepts. Automaton has 6599 states and 14513 transitions. Word has length 96 [2018-12-03 06:31:35,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:35,296 INFO L480 AbstractCegarLoop]: Abstraction has 6599 states and 14513 transitions. [2018-12-03 06:31:35,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 06:31:35,297 INFO L276 IsEmpty]: Start isEmpty. Operand 6599 states and 14513 transitions. [2018-12-03 06:31:35,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:31:35,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:35,301 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 06:31:35,301 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:35,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:35,301 INFO L82 PathProgramCache]: Analyzing trace with hash -775363790, now seen corresponding path program 1 times [2018-12-03 06:31:35,301 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:35,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:35,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:35,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:35,302 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:35,384 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 06:31:35,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:35,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:31:35,384 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:35,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:31:35,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:31:35,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:31:35,385 INFO L87 Difference]: Start difference. First operand 6599 states and 14513 transitions. Second operand 7 states. [2018-12-03 06:31:35,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:35,576 INFO L93 Difference]: Finished difference Result 8342 states and 18188 transitions. [2018-12-03 06:31:35,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 06:31:35,576 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-03 06:31:35,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:35,581 INFO L225 Difference]: With dead ends: 8342 [2018-12-03 06:31:35,581 INFO L226 Difference]: Without dead ends: 8290 [2018-12-03 06:31:35,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-03 06:31:35,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8290 states. [2018-12-03 06:31:35,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8290 to 6607. [2018-12-03 06:31:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6607 states. [2018-12-03 06:31:35,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6607 states to 6607 states and 14515 transitions. [2018-12-03 06:31:35,638 INFO L78 Accepts]: Start accepts. Automaton has 6607 states and 14515 transitions. Word has length 96 [2018-12-03 06:31:35,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:35,639 INFO L480 AbstractCegarLoop]: Abstraction has 6607 states and 14515 transitions. [2018-12-03 06:31:35,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:31:35,639 INFO L276 IsEmpty]: Start isEmpty. Operand 6607 states and 14515 transitions. [2018-12-03 06:31:35,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:31:35,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:35,644 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 06:31:35,645 INFO L423 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:35,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:35,645 INFO L82 PathProgramCache]: Analyzing trace with hash 186250227, now seen corresponding path program 1 times [2018-12-03 06:31:35,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:35,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:35,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:35,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:35,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:35,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:35,699 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 06:31:35,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:35,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:31:35,700 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:35,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:31:35,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:31:35,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:31:35,700 INFO L87 Difference]: Start difference. First operand 6607 states and 14515 transitions. Second operand 6 states. [2018-12-03 06:31:35,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:35,901 INFO L93 Difference]: Finished difference Result 7833 states and 17270 transitions. [2018-12-03 06:31:35,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:31:35,901 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-03 06:31:35,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:35,907 INFO L225 Difference]: With dead ends: 7833 [2018-12-03 06:31:35,907 INFO L226 Difference]: Without dead ends: 7833 [2018-12-03 06:31:35,907 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:31:35,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7833 states. [2018-12-03 06:31:35,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7833 to 6783. [2018-12-03 06:31:35,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6783 states. [2018-12-03 06:31:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6783 states to 6783 states and 14884 transitions. [2018-12-03 06:31:35,972 INFO L78 Accepts]: Start accepts. Automaton has 6783 states and 14884 transitions. Word has length 96 [2018-12-03 06:31:35,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:35,972 INFO L480 AbstractCegarLoop]: Abstraction has 6783 states and 14884 transitions. [2018-12-03 06:31:35,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:31:35,972 INFO L276 IsEmpty]: Start isEmpty. Operand 6783 states and 14884 transitions. [2018-12-03 06:31:35,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:31:35,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:35,977 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 06:31:35,978 INFO L423 AbstractCegarLoop]: === Iteration 39 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:35,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:35,978 INFO L82 PathProgramCache]: Analyzing trace with hash -164379470, now seen corresponding path program 1 times [2018-12-03 06:31:35,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:35,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:35,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:35,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:35,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:36,108 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 06:31:36,109 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:36,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 06:31:36,109 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:36,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 06:31:36,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 06:31:36,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-03 06:31:36,109 INFO L87 Difference]: Start difference. First operand 6783 states and 14884 transitions. Second operand 9 states. [2018-12-03 06:31:36,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:36,401 INFO L93 Difference]: Finished difference Result 8017 states and 17391 transitions. [2018-12-03 06:31:36,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 06:31:36,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-03 06:31:36,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:36,408 INFO L225 Difference]: With dead ends: 8017 [2018-12-03 06:31:36,408 INFO L226 Difference]: Without dead ends: 8017 [2018-12-03 06:31:36,409 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-12-03 06:31:36,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8017 states. [2018-12-03 06:31:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8017 to 7141. [2018-12-03 06:31:36,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7141 states. [2018-12-03 06:31:36,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7141 states to 7141 states and 15617 transitions. [2018-12-03 06:31:36,476 INFO L78 Accepts]: Start accepts. Automaton has 7141 states and 15617 transitions. Word has length 96 [2018-12-03 06:31:36,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:36,476 INFO L480 AbstractCegarLoop]: Abstraction has 7141 states and 15617 transitions. [2018-12-03 06:31:36,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 06:31:36,476 INFO L276 IsEmpty]: Start isEmpty. Operand 7141 states and 15617 transitions. [2018-12-03 06:31:36,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:31:36,482 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:36,482 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 06:31:36,483 INFO L423 AbstractCegarLoop]: === Iteration 40 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:36,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:36,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1003094195, now seen corresponding path program 2 times [2018-12-03 06:31:36,483 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:36,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:36,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:36,484 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:36,484 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:36,542 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 06:31:36,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:36,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:31:36,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:36,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:31:36,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:31:36,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:31:36,543 INFO L87 Difference]: Start difference. First operand 7141 states and 15617 transitions. Second operand 7 states. [2018-12-03 06:31:36,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:36,656 INFO L93 Difference]: Finished difference Result 9293 states and 20437 transitions. [2018-12-03 06:31:36,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:31:36,657 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-03 06:31:36,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:36,663 INFO L225 Difference]: With dead ends: 9293 [2018-12-03 06:31:36,663 INFO L226 Difference]: Without dead ends: 9293 [2018-12-03 06:31:36,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-03 06:31:36,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9293 states. [2018-12-03 06:31:36,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9293 to 6478. [2018-12-03 06:31:36,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6478 states. [2018-12-03 06:31:36,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6478 states to 6478 states and 14125 transitions. [2018-12-03 06:31:36,717 INFO L78 Accepts]: Start accepts. Automaton has 6478 states and 14125 transitions. Word has length 96 [2018-12-03 06:31:36,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:36,717 INFO L480 AbstractCegarLoop]: Abstraction has 6478 states and 14125 transitions. [2018-12-03 06:31:36,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:31:36,717 INFO L276 IsEmpty]: Start isEmpty. Operand 6478 states and 14125 transitions. [2018-12-03 06:31:36,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:31:36,721 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:36,721 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 06:31:36,722 INFO L423 AbstractCegarLoop]: === Iteration 41 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:36,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:36,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1696195892, now seen corresponding path program 1 times [2018-12-03 06:31:36,722 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:36,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:36,723 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:31:36,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:36,723 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:36,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:31:36,815 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 06:31:36,815 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:31:36,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 06:31:36,815 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:31:36,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 06:31:36,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 06:31:36,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-12-03 06:31:36,815 INFO L87 Difference]: Start difference. First operand 6478 states and 14125 transitions. Second operand 11 states. [2018-12-03 06:31:37,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:31:37,164 INFO L93 Difference]: Finished difference Result 8389 states and 18390 transitions. [2018-12-03 06:31:37,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 06:31:37,164 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-03 06:31:37,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:31:37,171 INFO L225 Difference]: With dead ends: 8389 [2018-12-03 06:31:37,171 INFO L226 Difference]: Without dead ends: 8389 [2018-12-03 06:31:37,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2018-12-03 06:31:37,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8389 states. [2018-12-03 06:31:37,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8389 to 6488. [2018-12-03 06:31:37,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6488 states. [2018-12-03 06:31:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6488 states to 6488 states and 14146 transitions. [2018-12-03 06:31:37,227 INFO L78 Accepts]: Start accepts. Automaton has 6488 states and 14146 transitions. Word has length 96 [2018-12-03 06:31:37,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:31:37,227 INFO L480 AbstractCegarLoop]: Abstraction has 6488 states and 14146 transitions. [2018-12-03 06:31:37,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 06:31:37,228 INFO L276 IsEmpty]: Start isEmpty. Operand 6488 states and 14146 transitions. [2018-12-03 06:31:37,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-03 06:31:37,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:31:37,231 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 06:31:37,232 INFO L423 AbstractCegarLoop]: === Iteration 42 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:31:37,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:31:37,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1711267723, now seen corresponding path program 2 times [2018-12-03 06:31:37,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:31:37,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:37,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:31:37,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:31:37,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:31:37,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 06:31:37,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 06:31:37,266 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 06:31:37,335 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 06:31:37,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:31:37 BasicIcfg [2018-12-03 06:31:37,336 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 06:31:37,336 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 06:31:37,336 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 06:31:37,336 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 06:31:37,337 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:31:07" (3/4) ... [2018-12-03 06:31:37,338 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 06:31:37,410 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a9fe84ae-b796-4918-a1b6-abd10651e572/bin-2019/utaipan/witness.graphml [2018-12-03 06:31:37,410 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 06:31:37,410 INFO L168 Benchmark]: Toolchain (without parser) took 30941.43 ms. Allocated memory was 1.0 GB in the beginning and 5.2 GB in the end (delta: 4.2 GB). Free memory was 952.4 MB in the beginning and 4.2 GB in the end (delta: -3.3 GB). Peak memory consumption was 908.0 MB. Max. memory is 11.5 GB. [2018-12-03 06:31:37,411 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 06:31:37,412 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -156.8 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. [2018-12-03 06:31:37,412 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-03 06:31:37,412 INFO L168 Benchmark]: Boogie Preprocessor took 21.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-12-03 06:31:37,412 INFO L168 Benchmark]: RCFGBuilder took 344.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. [2018-12-03 06:31:37,412 INFO L168 Benchmark]: TraceAbstraction took 30086.01 ms. Allocated memory was 1.2 GB in the beginning and 5.2 GB in the end (delta: 4.0 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.2 GB). Peak memory consumption was 813.1 MB. Max. memory is 11.5 GB. [2018-12-03 06:31:37,413 INFO L168 Benchmark]: Witness Printer took 73.76 ms. Allocated memory is still 5.2 GB. Free memory was 4.3 GB in the beginning and 4.2 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2018-12-03 06:31:37,414 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 378.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -156.8 MB). Peak memory consumption was 33.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 344.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30086.01 ms. Allocated memory was 1.2 GB in the beginning and 5.2 GB in the end (delta: 4.0 GB). Free memory was 1.1 GB in the beginning and 4.3 GB in the end (delta: -3.2 GB). Peak memory consumption was 813.1 MB. Max. memory is 11.5 GB. * Witness Printer took 73.76 ms. Allocated memory is still 5.2 GB. Free memory was 4.3 GB in the beginning and 4.2 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L677] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L678] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L679] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L681] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L684] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L685] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L686] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L687] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L688] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L689] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L690] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L691] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L692] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L693] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L694] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L695] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L696] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L697] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L775] -1 pthread_t t315; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] FCALL, FORK -1 pthread_create(&t315, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L703] 0 y$w_buff1 = y$w_buff0 [L704] 0 y$w_buff0 = 1 [L705] 0 y$w_buff1_used = y$w_buff0_used [L706] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] -1 pthread_t t316; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L708] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L709] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L710] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L711] 0 y$r_buff0_thd1 = (_Bool)1 [L714] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] FCALL, FORK -1 pthread_create(&t316, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L731] 1 x = 1 [L734] 1 __unbuffered_p1_EAX = x [L737] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L738] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L739] 1 y$flush_delayed = weak$$choice2 [L740] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L742] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L744] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L745] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L747] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L748] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L749] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L717] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L749] 1 y = y$flush_delayed ? y$mem_tmp : y [L750] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L753] EXPR 1 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L753] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 1 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L718] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L719] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L719] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L720] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L721] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L721] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L780] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L784] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L785] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L786] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L791] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 30.0s OverallTime, 42 OverallIterations, 1 TraceHistogramMax, 13.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 11669 SDtfs, 13515 SDslu, 29845 SDs, 0 SdLazy, 14070 SolverSat, 598 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 457 GetRequests, 110 SyntacticMatches, 46 SemanticMatches, 301 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 409 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 12.2s AutomataMinimizationTime, 41 MinimizatonAttempts, 192481 StatesRemovedByMinimization, 41 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3216 NumberOfCodeBlocks, 3216 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 3079 ConstructedInterpolants, 0 QuantifiedInterpolants, 775536 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 41 InterpolantComputations, 41 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...