./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix031_tso.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_03f9558a-82af-402b-af08-59fc2fd303aa/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_03f9558a-82af-402b-af08-59fc2fd303aa/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_03f9558a-82af-402b-af08-59fc2fd303aa/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_03f9558a-82af-402b-af08-59fc2fd303aa/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix031_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_03f9558a-82af-402b-af08-59fc2fd303aa/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_03f9558a-82af-402b-af08-59fc2fd303aa/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 bedc30426f84517809c1aba2f717b94ba4147624 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 05:46:09,537 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 05:46:09,538 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 05:46:09,545 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 05:46:09,545 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 05:46:09,546 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 05:46:09,547 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 05:46:09,548 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 05:46:09,549 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 05:46:09,549 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 05:46:09,550 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 05:46:09,550 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 05:46:09,550 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 05:46:09,551 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 05:46:09,551 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 05:46:09,552 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 05:46:09,552 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 05:46:09,553 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 05:46:09,554 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 05:46:09,554 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 05:46:09,555 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 05:46:09,555 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 05:46:09,556 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 05:46:09,557 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 05:46:09,557 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 05:46:09,557 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 05:46:09,557 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 05:46:09,558 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 05:46:09,558 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 05:46:09,559 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 05:46:09,559 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 05:46:09,559 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 05:46:09,559 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 05:46:09,559 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 05:46:09,560 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 05:46:09,560 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 05:46:09,560 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_03f9558a-82af-402b-af08-59fc2fd303aa/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 05:46:09,567 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 05:46:09,567 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 05:46:09,568 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 05:46:09,568 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 05:46:09,568 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 05:46:09,568 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 05:46:09,568 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 05:46:09,568 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 05:46:09,568 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 05:46:09,568 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 05:46:09,568 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 05:46:09,568 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 05:46:09,569 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 05:46:09,569 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 05:46:09,569 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 05:46:09,569 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 05:46:09,569 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 05:46:09,569 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 05:46:09,569 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 05:46:09,569 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 05:46:09,570 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 05:46:09,570 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 05:46:09,570 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 05:46:09,570 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 05:46:09,570 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 05:46:09,570 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 05:46:09,570 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 05:46:09,570 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 05:46:09,570 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:46:09,570 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 05:46:09,571 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 05:46:09,571 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 05:46:09,571 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 05:46:09,571 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 05:46:09,571 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 05:46:09,571 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 05:46:09,571 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_03f9558a-82af-402b-af08-59fc2fd303aa/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 -> bedc30426f84517809c1aba2f717b94ba4147624 [2018-12-02 05:46:09,589 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 05:46:09,598 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 05:46:09,600 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 05:46:09,601 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 05:46:09,602 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 05:46:09,602 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_03f9558a-82af-402b-af08-59fc2fd303aa/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix031_tso.oepc_false-unreach-call.i [2018-12-02 05:46:09,647 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_03f9558a-82af-402b-af08-59fc2fd303aa/bin-2019/utaipan/data/509ddeacf/556183cee40e4356bb59812d772d7311/FLAGe9a3f4a6b [2018-12-02 05:46:10,091 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 05:46:10,091 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_03f9558a-82af-402b-af08-59fc2fd303aa/sv-benchmarks/c/pthread-wmm/mix031_tso.oepc_false-unreach-call.i [2018-12-02 05:46:10,098 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_03f9558a-82af-402b-af08-59fc2fd303aa/bin-2019/utaipan/data/509ddeacf/556183cee40e4356bb59812d772d7311/FLAGe9a3f4a6b [2018-12-02 05:46:10,106 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_03f9558a-82af-402b-af08-59fc2fd303aa/bin-2019/utaipan/data/509ddeacf/556183cee40e4356bb59812d772d7311 [2018-12-02 05:46:10,108 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 05:46:10,109 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 05:46:10,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 05:46:10,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 05:46:10,111 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 05:46:10,112 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:46:10" (1/1) ... [2018-12-02 05:46:10,113 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628262cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:46:10, skipping insertion in model container [2018-12-02 05:46:10,113 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:46:10" (1/1) ... [2018-12-02 05:46:10,118 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 05:46:10,138 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 05:46:10,315 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:46:10,323 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 05:46:10,404 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 05:46:10,448 INFO L195 MainTranslator]: Completed translation [2018-12-02 05:46:10,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:46:10 WrapperNode [2018-12-02 05:46:10,448 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 05:46:10,449 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 05:46:10,449 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 05:46:10,449 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 05:46:10,456 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:46:10" (1/1) ... [2018-12-02 05:46:10,469 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:46:10" (1/1) ... [2018-12-02 05:46:10,487 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 05:46:10,488 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 05:46:10,488 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 05:46:10,488 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 05:46:10,495 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:46:10" (1/1) ... [2018-12-02 05:46:10,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:46:10" (1/1) ... [2018-12-02 05:46:10,497 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:46:10" (1/1) ... [2018-12-02 05:46:10,498 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:46:10" (1/1) ... [2018-12-02 05:46:10,503 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:46:10" (1/1) ... [2018-12-02 05:46:10,506 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:46:10" (1/1) ... [2018-12-02 05:46:10,507 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:46:10" (1/1) ... [2018-12-02 05:46:10,510 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 05:46:10,510 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 05:46:10,510 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 05:46:10,511 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 05:46:10,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:46:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_03f9558a-82af-402b-af08-59fc2fd303aa/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 05:46:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 05:46:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 05:46:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 05:46:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 05:46:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 05:46:10,550 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 05:46:10,550 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 05:46:10,551 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 05:46:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 05:46:10,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 05:46:10,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 05:46:10,552 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 05:46:10,857 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 05:46:10,857 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 05:46:10,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:46:10 BoogieIcfgContainer [2018-12-02 05:46:10,858 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 05:46:10,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 05:46:10,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 05:46:10,860 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 05:46:10,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:46:10" (1/3) ... [2018-12-02 05:46:10,860 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ae7668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:46:10, skipping insertion in model container [2018-12-02 05:46:10,860 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:46:10" (2/3) ... [2018-12-02 05:46:10,861 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77ae7668 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:46:10, skipping insertion in model container [2018-12-02 05:46:10,861 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:46:10" (3/3) ... [2018-12-02 05:46:10,862 INFO L112 eAbstractionObserver]: Analyzing ICFG mix031_tso.oepc_false-unreach-call.i [2018-12-02 05:46:10,884 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,884 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,884 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,884 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,884 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,884 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,885 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,885 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,885 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,886 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,887 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,888 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,888 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,888 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,888 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,888 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,888 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,889 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,889 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,889 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,890 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,890 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,890 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,890 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,890 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,890 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,890 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,890 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,890 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,891 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,892 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,893 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,894 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,895 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,896 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,897 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,898 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,898 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,898 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,898 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,898 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,898 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,898 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,898 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,898 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,898 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,898 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,899 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,899 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,899 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,899 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,899 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,899 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,899 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,899 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,899 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,899 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,899 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,899 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,900 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 05:46:10,907 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 05:46:10,908 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 05:46:10,914 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 05:46:10,927 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 05:46:10,943 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 05:46:10,943 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 05:46:10,943 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 05:46:10,943 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 05:46:10,943 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 05:46:10,944 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 05:46:10,944 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 05:46:10,944 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 05:46:10,953 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146places, 184 transitions [2018-12-02 05:46:12,292 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34810 states. [2018-12-02 05:46:12,293 INFO L276 IsEmpty]: Start isEmpty. Operand 34810 states. [2018-12-02 05:46:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 05:46:12,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:12,298 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:46:12,299 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:12,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:12,303 INFO L82 PathProgramCache]: Analyzing trace with hash 148401709, now seen corresponding path program 1 times [2018-12-02 05:46:12,304 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:12,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:12,339 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:12,339 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:12,339 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:12,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:12,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:12,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:46:12,472 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:12,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:46:12,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:46:12,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:46:12,485 INFO L87 Difference]: Start difference. First operand 34810 states. Second operand 4 states. [2018-12-02 05:46:12,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:12,984 INFO L93 Difference]: Finished difference Result 60794 states and 234497 transitions. [2018-12-02 05:46:12,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:46:12,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-02 05:46:12,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:13,160 INFO L225 Difference]: With dead ends: 60794 [2018-12-02 05:46:13,160 INFO L226 Difference]: Without dead ends: 44274 [2018-12-02 05:46:13,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:46:13,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44274 states. [2018-12-02 05:46:13,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44274 to 27342. [2018-12-02 05:46:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27342 states. [2018-12-02 05:46:13,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27342 states to 27342 states and 105503 transitions. [2018-12-02 05:46:13,917 INFO L78 Accepts]: Start accepts. Automaton has 27342 states and 105503 transitions. Word has length 37 [2018-12-02 05:46:13,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:13,917 INFO L480 AbstractCegarLoop]: Abstraction has 27342 states and 105503 transitions. [2018-12-02 05:46:13,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:46:13,917 INFO L276 IsEmpty]: Start isEmpty. Operand 27342 states and 105503 transitions. [2018-12-02 05:46:13,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 05:46:13,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:13,922 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:46:13,922 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:13,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:13,922 INFO L82 PathProgramCache]: Analyzing trace with hash -54930118, now seen corresponding path program 1 times [2018-12-02 05:46:13,922 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:13,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:13,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:13,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:13,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:13,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:13,972 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:13,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:46:13,972 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:13,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:46:13,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:46:13,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:46:13,974 INFO L87 Difference]: Start difference. First operand 27342 states and 105503 transitions. Second operand 4 states. [2018-12-02 05:46:14,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:14,036 INFO L93 Difference]: Finished difference Result 8532 states and 28348 transitions. [2018-12-02 05:46:14,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:46:14,037 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-02 05:46:14,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:14,048 INFO L225 Difference]: With dead ends: 8532 [2018-12-02 05:46:14,049 INFO L226 Difference]: Without dead ends: 7470 [2018-12-02 05:46:14,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:46:14,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7470 states. [2018-12-02 05:46:14,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7470 to 7470. [2018-12-02 05:46:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7470 states. [2018-12-02 05:46:14,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7470 states to 7470 states and 24640 transitions. [2018-12-02 05:46:14,135 INFO L78 Accepts]: Start accepts. Automaton has 7470 states and 24640 transitions. Word has length 49 [2018-12-02 05:46:14,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:14,135 INFO L480 AbstractCegarLoop]: Abstraction has 7470 states and 24640 transitions. [2018-12-02 05:46:14,135 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:46:14,135 INFO L276 IsEmpty]: Start isEmpty. Operand 7470 states and 24640 transitions. [2018-12-02 05:46:14,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-02 05:46:14,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:14,136 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] [2018-12-02 05:46:14,137 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:14,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:14,137 INFO L82 PathProgramCache]: Analyzing trace with hash -790300171, now seen corresponding path program 1 times [2018-12-02 05:46:14,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:14,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:14,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:14,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:14,139 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:14,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:14,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:14,192 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:14,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:46:14,192 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:14,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:46:14,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:46:14,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:46:14,192 INFO L87 Difference]: Start difference. First operand 7470 states and 24640 transitions. Second operand 5 states. [2018-12-02 05:46:14,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:14,413 INFO L93 Difference]: Finished difference Result 14002 states and 45809 transitions. [2018-12-02 05:46:14,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:46:14,414 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-02 05:46:14,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:14,444 INFO L225 Difference]: With dead ends: 14002 [2018-12-02 05:46:14,444 INFO L226 Difference]: Without dead ends: 13934 [2018-12-02 05:46:14,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:46:14,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13934 states. [2018-12-02 05:46:14,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13934 to 9445. [2018-12-02 05:46:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9445 states. [2018-12-02 05:46:14,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9445 states to 9445 states and 30546 transitions. [2018-12-02 05:46:14,685 INFO L78 Accepts]: Start accepts. Automaton has 9445 states and 30546 transitions. Word has length 50 [2018-12-02 05:46:14,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:14,687 INFO L480 AbstractCegarLoop]: Abstraction has 9445 states and 30546 transitions. [2018-12-02 05:46:14,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:46:14,687 INFO L276 IsEmpty]: Start isEmpty. Operand 9445 states and 30546 transitions. [2018-12-02 05:46:14,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-02 05:46:14,688 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:14,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:46:14,689 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:14,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:14,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1702931131, now seen corresponding path program 1 times [2018-12-02 05:46:14,689 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:14,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:14,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:14,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:14,691 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:14,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:14,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:14,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:14,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:46:14,720 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:14,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:46:14,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:46:14,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:46:14,721 INFO L87 Difference]: Start difference. First operand 9445 states and 30546 transitions. Second operand 3 states. [2018-12-02 05:46:14,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:14,782 INFO L93 Difference]: Finished difference Result 13283 states and 42645 transitions. [2018-12-02 05:46:14,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:46:14,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-02 05:46:14,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:14,801 INFO L225 Difference]: With dead ends: 13283 [2018-12-02 05:46:14,801 INFO L226 Difference]: Without dead ends: 13283 [2018-12-02 05:46:14,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:46:14,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13283 states. [2018-12-02 05:46:14,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13283 to 9849. [2018-12-02 05:46:14,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9849 states. [2018-12-02 05:46:14,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9849 states to 9849 states and 31512 transitions. [2018-12-02 05:46:14,927 INFO L78 Accepts]: Start accepts. Automaton has 9849 states and 31512 transitions. Word has length 52 [2018-12-02 05:46:14,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:14,927 INFO L480 AbstractCegarLoop]: Abstraction has 9849 states and 31512 transitions. [2018-12-02 05:46:14,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:46:14,927 INFO L276 IsEmpty]: Start isEmpty. Operand 9849 states and 31512 transitions. [2018-12-02 05:46:14,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-02 05:46:14,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:14,929 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] [2018-12-02 05:46:14,929 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:14,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:14,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1252831162, now seen corresponding path program 1 times [2018-12-02 05:46:14,929 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:14,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:14,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:14,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:14,930 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:14,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:14,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:14,980 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:14,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:46:14,980 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:14,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:46:14,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:46:14,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:46:14,981 INFO L87 Difference]: Start difference. First operand 9849 states and 31512 transitions. Second operand 6 states. [2018-12-02 05:46:15,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:15,231 INFO L93 Difference]: Finished difference Result 14207 states and 45068 transitions. [2018-12-02 05:46:15,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:46:15,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2018-12-02 05:46:15,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:15,249 INFO L225 Difference]: With dead ends: 14207 [2018-12-02 05:46:15,250 INFO L226 Difference]: Without dead ends: 14135 [2018-12-02 05:46:15,250 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-02 05:46:15,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14135 states. [2018-12-02 05:46:15,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14135 to 10853. [2018-12-02 05:46:15,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10853 states. [2018-12-02 05:46:15,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10853 states to 10853 states and 34567 transitions. [2018-12-02 05:46:15,382 INFO L78 Accepts]: Start accepts. Automaton has 10853 states and 34567 transitions. Word has length 56 [2018-12-02 05:46:15,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:15,383 INFO L480 AbstractCegarLoop]: Abstraction has 10853 states and 34567 transitions. [2018-12-02 05:46:15,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:46:15,383 INFO L276 IsEmpty]: Start isEmpty. Operand 10853 states and 34567 transitions. [2018-12-02 05:46:15,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 05:46:15,386 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:15,386 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] [2018-12-02 05:46:15,387 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:15,387 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:15,387 INFO L82 PathProgramCache]: Analyzing trace with hash -575191646, now seen corresponding path program 1 times [2018-12-02 05:46:15,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:15,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:15,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:15,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:15,389 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:15,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:15,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:15,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:46:15,436 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:15,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:46:15,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:46:15,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:46:15,437 INFO L87 Difference]: Start difference. First operand 10853 states and 34567 transitions. Second operand 4 states. [2018-12-02 05:46:15,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:15,522 INFO L93 Difference]: Finished difference Result 12400 states and 39576 transitions. [2018-12-02 05:46:15,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:46:15,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-02 05:46:15,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:15,536 INFO L225 Difference]: With dead ends: 12400 [2018-12-02 05:46:15,536 INFO L226 Difference]: Without dead ends: 12400 [2018-12-02 05:46:15,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:46:15,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12400 states. [2018-12-02 05:46:15,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12400 to 11373. [2018-12-02 05:46:15,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11373 states. [2018-12-02 05:46:15,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11373 states to 11373 states and 36240 transitions. [2018-12-02 05:46:15,695 INFO L78 Accepts]: Start accepts. Automaton has 11373 states and 36240 transitions. Word has length 64 [2018-12-02 05:46:15,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:15,695 INFO L480 AbstractCegarLoop]: Abstraction has 11373 states and 36240 transitions. [2018-12-02 05:46:15,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:46:15,696 INFO L276 IsEmpty]: Start isEmpty. Operand 11373 states and 36240 transitions. [2018-12-02 05:46:15,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-02 05:46:15,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:15,699 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] [2018-12-02 05:46:15,699 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:15,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:15,699 INFO L82 PathProgramCache]: Analyzing trace with hash 1167618689, now seen corresponding path program 1 times [2018-12-02 05:46:15,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:15,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:15,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:15,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:15,702 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:15,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-02 05:46:15,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:15,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:46:15,754 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:15,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:46:15,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:46:15,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:46:15,755 INFO L87 Difference]: Start difference. First operand 11373 states and 36240 transitions. Second operand 6 states. [2018-12-02 05:46:16,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:16,040 INFO L93 Difference]: Finished difference Result 20973 states and 66490 transitions. [2018-12-02 05:46:16,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:46:16,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-02 05:46:16,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:16,065 INFO L225 Difference]: With dead ends: 20973 [2018-12-02 05:46:16,065 INFO L226 Difference]: Without dead ends: 20902 [2018-12-02 05:46:16,065 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-02 05:46:16,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20902 states. [2018-12-02 05:46:16,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20902 to 13759. [2018-12-02 05:46:16,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13759 states. [2018-12-02 05:46:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13759 states to 13759 states and 43284 transitions. [2018-12-02 05:46:16,250 INFO L78 Accepts]: Start accepts. Automaton has 13759 states and 43284 transitions. Word has length 64 [2018-12-02 05:46:16,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:16,251 INFO L480 AbstractCegarLoop]: Abstraction has 13759 states and 43284 transitions. [2018-12-02 05:46:16,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:46:16,251 INFO L276 IsEmpty]: Start isEmpty. Operand 13759 states and 43284 transitions. [2018-12-02 05:46:16,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 05:46:16,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:16,255 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] [2018-12-02 05:46:16,255 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:16,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:16,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1129581006, now seen corresponding path program 1 times [2018-12-02 05:46:16,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:16,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:16,257 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:16,257 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:16,257 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:16,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:16,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:16,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:16,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:46:16,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:16,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:46:16,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:46:16,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:46:16,290 INFO L87 Difference]: Start difference. First operand 13759 states and 43284 transitions. Second operand 4 states. [2018-12-02 05:46:16,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:16,465 INFO L93 Difference]: Finished difference Result 17639 states and 54589 transitions. [2018-12-02 05:46:16,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:46:16,466 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-02 05:46:16,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:16,485 INFO L225 Difference]: With dead ends: 17639 [2018-12-02 05:46:16,485 INFO L226 Difference]: Without dead ends: 17639 [2018-12-02 05:46:16,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:46:16,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17639 states. [2018-12-02 05:46:16,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17639 to 15797. [2018-12-02 05:46:16,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15797 states. [2018-12-02 05:46:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15797 states to 15797 states and 49135 transitions. [2018-12-02 05:46:16,661 INFO L78 Accepts]: Start accepts. Automaton has 15797 states and 49135 transitions. Word has length 68 [2018-12-02 05:46:16,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:16,661 INFO L480 AbstractCegarLoop]: Abstraction has 15797 states and 49135 transitions. [2018-12-02 05:46:16,661 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:46:16,662 INFO L276 IsEmpty]: Start isEmpty. Operand 15797 states and 49135 transitions. [2018-12-02 05:46:16,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-02 05:46:16,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:16,667 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] [2018-12-02 05:46:16,667 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:16,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:16,667 INFO L82 PathProgramCache]: Analyzing trace with hash -947628337, now seen corresponding path program 1 times [2018-12-02 05:46:16,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:16,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:16,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:16,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:16,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:16,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:16,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:16,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:46:16,707 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:16,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:46:16,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:46:16,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:46:16,708 INFO L87 Difference]: Start difference. First operand 15797 states and 49135 transitions. Second operand 3 states. [2018-12-02 05:46:16,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:16,871 INFO L93 Difference]: Finished difference Result 16389 states and 50742 transitions. [2018-12-02 05:46:16,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:46:16,872 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-02 05:46:16,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:16,890 INFO L225 Difference]: With dead ends: 16389 [2018-12-02 05:46:16,890 INFO L226 Difference]: Without dead ends: 16389 [2018-12-02 05:46:16,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:46:16,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16389 states. [2018-12-02 05:46:17,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16389 to 16113. [2018-12-02 05:46:17,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16113 states. [2018-12-02 05:46:17,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16113 states to 16113 states and 49985 transitions. [2018-12-02 05:46:17,105 INFO L78 Accepts]: Start accepts. Automaton has 16113 states and 49985 transitions. Word has length 68 [2018-12-02 05:46:17,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:17,105 INFO L480 AbstractCegarLoop]: Abstraction has 16113 states and 49985 transitions. [2018-12-02 05:46:17,105 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:46:17,105 INFO L276 IsEmpty]: Start isEmpty. Operand 16113 states and 49985 transitions. [2018-12-02 05:46:17,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 05:46:17,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:17,163 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] [2018-12-02 05:46:17,163 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:17,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:17,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1412859306, now seen corresponding path program 1 times [2018-12-02 05:46:17,163 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:17,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:17,164 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:17,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:17,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:17,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:17,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:17,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:46:17,226 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:17,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:46:17,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:46:17,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:46:17,226 INFO L87 Difference]: Start difference. First operand 16113 states and 49985 transitions. Second operand 6 states. [2018-12-02 05:46:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:17,787 INFO L93 Difference]: Finished difference Result 19825 states and 60441 transitions. [2018-12-02 05:46:17,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:46:17,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2018-12-02 05:46:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:17,808 INFO L225 Difference]: With dead ends: 19825 [2018-12-02 05:46:17,808 INFO L226 Difference]: Without dead ends: 19825 [2018-12-02 05:46:17,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:46:17,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19825 states. [2018-12-02 05:46:17,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19825 to 18621. [2018-12-02 05:46:17,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18621 states. [2018-12-02 05:46:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18621 states to 18621 states and 57221 transitions. [2018-12-02 05:46:18,007 INFO L78 Accepts]: Start accepts. Automaton has 18621 states and 57221 transitions. Word has length 70 [2018-12-02 05:46:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:18,007 INFO L480 AbstractCegarLoop]: Abstraction has 18621 states and 57221 transitions. [2018-12-02 05:46:18,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:46:18,007 INFO L276 IsEmpty]: Start isEmpty. Operand 18621 states and 57221 transitions. [2018-12-02 05:46:18,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 05:46:18,014 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:18,014 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] [2018-12-02 05:46:18,015 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:18,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:18,015 INFO L82 PathProgramCache]: Analyzing trace with hash 804898647, now seen corresponding path program 1 times [2018-12-02 05:46:18,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:18,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:18,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:18,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:18,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:18,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:18,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:46:18,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:18,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:46:18,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:46:18,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:46:18,062 INFO L87 Difference]: Start difference. First operand 18621 states and 57221 transitions. Second operand 5 states. [2018-12-02 05:46:18,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:18,295 INFO L93 Difference]: Finished difference Result 24184 states and 73726 transitions. [2018-12-02 05:46:18,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:46:18,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-02 05:46:18,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:18,321 INFO L225 Difference]: With dead ends: 24184 [2018-12-02 05:46:18,322 INFO L226 Difference]: Without dead ends: 24184 [2018-12-02 05:46:18,322 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-02 05:46:18,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24184 states. [2018-12-02 05:46:18,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24184 to 22021. [2018-12-02 05:46:18,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22021 states. [2018-12-02 05:46:18,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22021 states to 22021 states and 67146 transitions. [2018-12-02 05:46:18,562 INFO L78 Accepts]: Start accepts. Automaton has 22021 states and 67146 transitions. Word has length 70 [2018-12-02 05:46:18,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:18,562 INFO L480 AbstractCegarLoop]: Abstraction has 22021 states and 67146 transitions. [2018-12-02 05:46:18,562 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:46:18,562 INFO L276 IsEmpty]: Start isEmpty. Operand 22021 states and 67146 transitions. [2018-12-02 05:46:18,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 05:46:18,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:18,570 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] [2018-12-02 05:46:18,570 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:18,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:18,570 INFO L82 PathProgramCache]: Analyzing trace with hash 294364470, now seen corresponding path program 1 times [2018-12-02 05:46:18,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:18,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:18,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:18,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:18,572 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:18,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:18,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:18,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:46:18,613 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:18,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:46:18,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:46:18,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:46:18,613 INFO L87 Difference]: Start difference. First operand 22021 states and 67146 transitions. Second operand 5 states. [2018-12-02 05:46:18,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:18,953 INFO L93 Difference]: Finished difference Result 30767 states and 92772 transitions. [2018-12-02 05:46:18,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:46:18,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-02 05:46:18,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:18,987 INFO L225 Difference]: With dead ends: 30767 [2018-12-02 05:46:18,987 INFO L226 Difference]: Without dead ends: 30767 [2018-12-02 05:46:18,987 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-02 05:46:19,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30767 states. [2018-12-02 05:46:19,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30767 to 27531. [2018-12-02 05:46:19,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27531 states. [2018-12-02 05:46:19,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27531 states to 27531 states and 83463 transitions. [2018-12-02 05:46:19,305 INFO L78 Accepts]: Start accepts. Automaton has 27531 states and 83463 transitions. Word has length 70 [2018-12-02 05:46:19,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:19,305 INFO L480 AbstractCegarLoop]: Abstraction has 27531 states and 83463 transitions. [2018-12-02 05:46:19,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:46:19,305 INFO L276 IsEmpty]: Start isEmpty. Operand 27531 states and 83463 transitions. [2018-12-02 05:46:19,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 05:46:19,314 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:19,314 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] [2018-12-02 05:46:19,314 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:19,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:19,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1513089993, now seen corresponding path program 1 times [2018-12-02 05:46:19,315 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:19,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:19,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:19,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:19,316 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:19,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:19,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:19,350 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:19,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:46:19,350 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:19,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:46:19,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:46:19,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:46:19,351 INFO L87 Difference]: Start difference. First operand 27531 states and 83463 transitions. Second operand 4 states. [2018-12-02 05:46:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:19,725 INFO L93 Difference]: Finished difference Result 37927 states and 115324 transitions. [2018-12-02 05:46:19,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:46:19,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2018-12-02 05:46:19,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:19,768 INFO L225 Difference]: With dead ends: 37927 [2018-12-02 05:46:19,768 INFO L226 Difference]: Without dead ends: 37711 [2018-12-02 05:46:19,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:46:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37711 states. [2018-12-02 05:46:20,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37711 to 34931. [2018-12-02 05:46:20,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34931 states. [2018-12-02 05:46:20,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34931 states to 34931 states and 106353 transitions. [2018-12-02 05:46:20,153 INFO L78 Accepts]: Start accepts. Automaton has 34931 states and 106353 transitions. Word has length 70 [2018-12-02 05:46:20,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:20,154 INFO L480 AbstractCegarLoop]: Abstraction has 34931 states and 106353 transitions. [2018-12-02 05:46:20,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:46:20,154 INFO L276 IsEmpty]: Start isEmpty. Operand 34931 states and 106353 transitions. [2018-12-02 05:46:20,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 05:46:20,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:20,163 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] [2018-12-02 05:46:20,163 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:20,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:20,163 INFO L82 PathProgramCache]: Analyzing trace with hash 984925944, now seen corresponding path program 1 times [2018-12-02 05:46:20,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:20,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:20,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:20,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:20,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:20,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:20,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:20,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:20,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:46:20,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:20,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:46:20,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:46:20,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:46:20,248 INFO L87 Difference]: Start difference. First operand 34931 states and 106353 transitions. Second operand 7 states. [2018-12-02 05:46:20,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:20,594 INFO L93 Difference]: Finished difference Result 30943 states and 89976 transitions. [2018-12-02 05:46:20,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:46:20,595 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2018-12-02 05:46:20,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:20,635 INFO L225 Difference]: With dead ends: 30943 [2018-12-02 05:46:20,635 INFO L226 Difference]: Without dead ends: 30943 [2018-12-02 05:46:20,635 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-12-02 05:46:20,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30943 states. [2018-12-02 05:46:20,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30943 to 25023. [2018-12-02 05:46:20,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25023 states. [2018-12-02 05:46:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25023 states to 25023 states and 72808 transitions. [2018-12-02 05:46:20,992 INFO L78 Accepts]: Start accepts. Automaton has 25023 states and 72808 transitions. Word has length 70 [2018-12-02 05:46:20,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:20,993 INFO L480 AbstractCegarLoop]: Abstraction has 25023 states and 72808 transitions. [2018-12-02 05:46:20,993 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:46:20,993 INFO L276 IsEmpty]: Start isEmpty. Operand 25023 states and 72808 transitions. [2018-12-02 05:46:21,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 05:46:21,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:21,001 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] [2018-12-02 05:46:21,001 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:21,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:21,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1872429625, now seen corresponding path program 1 times [2018-12-02 05:46:21,002 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:21,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:21,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:21,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:21,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:21,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:21,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:21,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:21,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:46:21,029 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:21,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:46:21,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:46:21,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:46:21,030 INFO L87 Difference]: Start difference. First operand 25023 states and 72808 transitions. Second operand 5 states. [2018-12-02 05:46:21,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:21,061 INFO L93 Difference]: Finished difference Result 7111 states and 17702 transitions. [2018-12-02 05:46:21,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 05:46:21,061 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2018-12-02 05:46:21,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:21,065 INFO L225 Difference]: With dead ends: 7111 [2018-12-02 05:46:21,065 INFO L226 Difference]: Without dead ends: 5778 [2018-12-02 05:46:21,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:46:21,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5778 states. [2018-12-02 05:46:21,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5778 to 5211. [2018-12-02 05:46:21,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5211 states. [2018-12-02 05:46:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5211 states to 5211 states and 12576 transitions. [2018-12-02 05:46:21,104 INFO L78 Accepts]: Start accepts. Automaton has 5211 states and 12576 transitions. Word has length 70 [2018-12-02 05:46:21,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:21,104 INFO L480 AbstractCegarLoop]: Abstraction has 5211 states and 12576 transitions. [2018-12-02 05:46:21,104 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:46:21,104 INFO L276 IsEmpty]: Start isEmpty. Operand 5211 states and 12576 transitions. [2018-12-02 05:46:21,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-02 05:46:21,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:21,108 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] [2018-12-02 05:46:21,108 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:21,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:21,109 INFO L82 PathProgramCache]: Analyzing trace with hash -173742318, now seen corresponding path program 1 times [2018-12-02 05:46:21,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:21,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:21,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:21,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:21,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:21,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:21,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:21,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:21,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 05:46:21,136 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:21,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 05:46:21,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 05:46:21,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:46:21,137 INFO L87 Difference]: Start difference. First operand 5211 states and 12576 transitions. Second operand 3 states. [2018-12-02 05:46:21,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:21,165 INFO L93 Difference]: Finished difference Result 6743 states and 16083 transitions. [2018-12-02 05:46:21,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 05:46:21,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-02 05:46:21,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:21,171 INFO L225 Difference]: With dead ends: 6743 [2018-12-02 05:46:21,171 INFO L226 Difference]: Without dead ends: 6743 [2018-12-02 05:46:21,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 05:46:21,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6743 states. [2018-12-02 05:46:21,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6743 to 5112. [2018-12-02 05:46:21,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5112 states. [2018-12-02 05:46:21,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5112 states to 5112 states and 12061 transitions. [2018-12-02 05:46:21,209 INFO L78 Accepts]: Start accepts. Automaton has 5112 states and 12061 transitions. Word has length 70 [2018-12-02 05:46:21,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:21,209 INFO L480 AbstractCegarLoop]: Abstraction has 5112 states and 12061 transitions. [2018-12-02 05:46:21,209 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 05:46:21,209 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 12061 transitions. [2018-12-02 05:46:21,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 05:46:21,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:21,213 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] [2018-12-02 05:46:21,213 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:21,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:21,213 INFO L82 PathProgramCache]: Analyzing trace with hash 536084869, now seen corresponding path program 1 times [2018-12-02 05:46:21,213 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:21,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:21,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:21,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:21,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:21,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:21,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:21,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:46:21,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:21,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:46:21,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:46:21,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:46:21,257 INFO L87 Difference]: Start difference. First operand 5112 states and 12061 transitions. Second operand 5 states. [2018-12-02 05:46:21,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:21,356 INFO L93 Difference]: Finished difference Result 6146 states and 14511 transitions. [2018-12-02 05:46:21,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:46:21,356 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2018-12-02 05:46:21,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:21,360 INFO L225 Difference]: With dead ends: 6146 [2018-12-02 05:46:21,360 INFO L226 Difference]: Without dead ends: 6146 [2018-12-02 05:46:21,360 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-02 05:46:21,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6146 states. [2018-12-02 05:46:21,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6146 to 5590. [2018-12-02 05:46:21,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5590 states. [2018-12-02 05:46:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5590 states to 5590 states and 13219 transitions. [2018-12-02 05:46:21,398 INFO L78 Accepts]: Start accepts. Automaton has 5590 states and 13219 transitions. Word has length 76 [2018-12-02 05:46:21,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:21,399 INFO L480 AbstractCegarLoop]: Abstraction has 5590 states and 13219 transitions. [2018-12-02 05:46:21,399 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:46:21,399 INFO L276 IsEmpty]: Start isEmpty. Operand 5590 states and 13219 transitions. [2018-12-02 05:46:21,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 05:46:21,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:21,402 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] [2018-12-02 05:46:21,402 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:21,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:21,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2016072092, now seen corresponding path program 1 times [2018-12-02 05:46:21,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:21,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:21,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:21,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:21,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:21,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:21,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:21,445 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:21,445 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:46:21,445 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:21,445 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:46:21,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:46:21,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:46:21,446 INFO L87 Difference]: Start difference. First operand 5590 states and 13219 transitions. Second operand 7 states. [2018-12-02 05:46:21,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:21,649 INFO L93 Difference]: Finished difference Result 6317 states and 14770 transitions. [2018-12-02 05:46:21,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:46:21,649 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-02 05:46:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:21,653 INFO L225 Difference]: With dead ends: 6317 [2018-12-02 05:46:21,653 INFO L226 Difference]: Without dead ends: 6215 [2018-12-02 05:46:21,653 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-02 05:46:21,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6215 states. [2018-12-02 05:46:21,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6215 to 5600. [2018-12-02 05:46:21,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5600 states. [2018-12-02 05:46:21,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5600 states to 5600 states and 13149 transitions. [2018-12-02 05:46:21,691 INFO L78 Accepts]: Start accepts. Automaton has 5600 states and 13149 transitions. Word has length 76 [2018-12-02 05:46:21,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:21,691 INFO L480 AbstractCegarLoop]: Abstraction has 5600 states and 13149 transitions. [2018-12-02 05:46:21,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:46:21,692 INFO L276 IsEmpty]: Start isEmpty. Operand 5600 states and 13149 transitions. [2018-12-02 05:46:21,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 05:46:21,695 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:21,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:46:21,695 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:21,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:21,695 INFO L82 PathProgramCache]: Analyzing trace with hash -321575746, now seen corresponding path program 1 times [2018-12-02 05:46:21,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:21,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:21,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:21,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:21,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:21,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:21,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:21,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:21,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:46:21,759 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:21,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:46:21,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:46:21,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:46:21,759 INFO L87 Difference]: Start difference. First operand 5600 states and 13149 transitions. Second operand 7 states. [2018-12-02 05:46:22,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:22,075 INFO L93 Difference]: Finished difference Result 6817 states and 16126 transitions. [2018-12-02 05:46:22,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:46:22,075 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 97 [2018-12-02 05:46:22,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:22,080 INFO L225 Difference]: With dead ends: 6817 [2018-12-02 05:46:22,080 INFO L226 Difference]: Without dead ends: 6817 [2018-12-02 05:46:22,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:46:22,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6817 states. [2018-12-02 05:46:22,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6817 to 5783. [2018-12-02 05:46:22,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5783 states. [2018-12-02 05:46:22,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5783 states to 5783 states and 13733 transitions. [2018-12-02 05:46:22,123 INFO L78 Accepts]: Start accepts. Automaton has 5783 states and 13733 transitions. Word has length 97 [2018-12-02 05:46:22,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:22,123 INFO L480 AbstractCegarLoop]: Abstraction has 5783 states and 13733 transitions. [2018-12-02 05:46:22,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:46:22,124 INFO L276 IsEmpty]: Start isEmpty. Operand 5783 states and 13733 transitions. [2018-12-02 05:46:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-12-02 05:46:22,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:22,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:46:22,128 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:22,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:22,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1424496976, now seen corresponding path program 1 times [2018-12-02 05:46:22,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:22,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:22,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:22,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:22,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:22,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:22,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:22,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:46:22,167 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:22,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:46:22,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:46:22,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:46:22,167 INFO L87 Difference]: Start difference. First operand 5783 states and 13733 transitions. Second operand 4 states. [2018-12-02 05:46:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:22,225 INFO L93 Difference]: Finished difference Result 6884 states and 16093 transitions. [2018-12-02 05:46:22,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 05:46:22,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2018-12-02 05:46:22,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:22,229 INFO L225 Difference]: With dead ends: 6884 [2018-12-02 05:46:22,229 INFO L226 Difference]: Without dead ends: 6884 [2018-12-02 05:46:22,229 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-02 05:46:22,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6884 states. [2018-12-02 05:46:22,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6884 to 6235. [2018-12-02 05:46:22,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6235 states. [2018-12-02 05:46:22,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6235 states to 6235 states and 14671 transitions. [2018-12-02 05:46:22,274 INFO L78 Accepts]: Start accepts. Automaton has 6235 states and 14671 transitions. Word has length 97 [2018-12-02 05:46:22,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:22,275 INFO L480 AbstractCegarLoop]: Abstraction has 6235 states and 14671 transitions. [2018-12-02 05:46:22,275 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:46:22,275 INFO L276 IsEmpty]: Start isEmpty. Operand 6235 states and 14671 transitions. [2018-12-02 05:46:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 05:46:22,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:22,279 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:46:22,279 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:22,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:22,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1324645014, now seen corresponding path program 1 times [2018-12-02 05:46:22,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:22,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:22,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:22,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:22,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:22,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:22,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:22,315 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:22,315 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:46:22,315 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:22,315 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:46:22,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:46:22,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:46:22,315 INFO L87 Difference]: Start difference. First operand 6235 states and 14671 transitions. Second operand 5 states. [2018-12-02 05:46:22,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:22,375 INFO L93 Difference]: Finished difference Result 6821 states and 15986 transitions. [2018-12-02 05:46:22,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:46:22,376 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-02 05:46:22,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:22,380 INFO L225 Difference]: With dead ends: 6821 [2018-12-02 05:46:22,380 INFO L226 Difference]: Without dead ends: 6821 [2018-12-02 05:46:22,380 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:46:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2018-12-02 05:46:22,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 5265. [2018-12-02 05:46:22,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5265 states. [2018-12-02 05:46:22,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5265 states to 5265 states and 12335 transitions. [2018-12-02 05:46:22,422 INFO L78 Accepts]: Start accepts. Automaton has 5265 states and 12335 transitions. Word has length 99 [2018-12-02 05:46:22,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:22,422 INFO L480 AbstractCegarLoop]: Abstraction has 5265 states and 12335 transitions. [2018-12-02 05:46:22,422 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:46:22,422 INFO L276 IsEmpty]: Start isEmpty. Operand 5265 states and 12335 transitions. [2018-12-02 05:46:22,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 05:46:22,426 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:22,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:46:22,426 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:22,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:22,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1335961141, now seen corresponding path program 1 times [2018-12-02 05:46:22,426 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:22,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:22,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:22,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:22,427 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:22,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:22,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:22,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:22,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 05:46:22,455 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:22,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 05:46:22,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 05:46:22,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 05:46:22,456 INFO L87 Difference]: Start difference. First operand 5265 states and 12335 transitions. Second operand 4 states. [2018-12-02 05:46:22,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:22,582 INFO L93 Difference]: Finished difference Result 6800 states and 15876 transitions. [2018-12-02 05:46:22,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:46:22,583 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-12-02 05:46:22,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:22,587 INFO L225 Difference]: With dead ends: 6800 [2018-12-02 05:46:22,587 INFO L226 Difference]: Without dead ends: 6739 [2018-12-02 05:46:22,587 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:46:22,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6739 states. [2018-12-02 05:46:22,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6739 to 6337. [2018-12-02 05:46:22,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6337 states. [2018-12-02 05:46:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6337 states to 6337 states and 14856 transitions. [2018-12-02 05:46:22,630 INFO L78 Accepts]: Start accepts. Automaton has 6337 states and 14856 transitions. Word has length 99 [2018-12-02 05:46:22,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:22,631 INFO L480 AbstractCegarLoop]: Abstraction has 6337 states and 14856 transitions. [2018-12-02 05:46:22,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 05:46:22,631 INFO L276 IsEmpty]: Start isEmpty. Operand 6337 states and 14856 transitions. [2018-12-02 05:46:22,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 05:46:22,635 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:22,635 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:46:22,635 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:22,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:22,636 INFO L82 PathProgramCache]: Analyzing trace with hash -741248202, now seen corresponding path program 1 times [2018-12-02 05:46:22,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:22,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:22,636 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:22,636 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:22,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:22,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:22,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 05:46:22,707 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:22,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 05:46:22,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 05:46:22,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:46:22,707 INFO L87 Difference]: Start difference. First operand 6337 states and 14856 transitions. Second operand 7 states. [2018-12-02 05:46:22,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:22,817 INFO L93 Difference]: Finished difference Result 8083 states and 18867 transitions. [2018-12-02 05:46:22,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:46:22,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2018-12-02 05:46:22,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:22,822 INFO L225 Difference]: With dead ends: 8083 [2018-12-02 05:46:22,822 INFO L226 Difference]: Without dead ends: 8083 [2018-12-02 05:46:22,822 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-02 05:46:22,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8083 states. [2018-12-02 05:46:22,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8083 to 6105. [2018-12-02 05:46:22,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6105 states. [2018-12-02 05:46:22,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6105 states to 6105 states and 14166 transitions. [2018-12-02 05:46:22,873 INFO L78 Accepts]: Start accepts. Automaton has 6105 states and 14166 transitions. Word has length 99 [2018-12-02 05:46:22,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:22,873 INFO L480 AbstractCegarLoop]: Abstraction has 6105 states and 14166 transitions. [2018-12-02 05:46:22,873 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 05:46:22,873 INFO L276 IsEmpty]: Start isEmpty. Operand 6105 states and 14166 transitions. [2018-12-02 05:46:22,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 05:46:22,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:22,878 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:46:22,878 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:22,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:22,879 INFO L82 PathProgramCache]: Analyzing trace with hash -529897289, now seen corresponding path program 1 times [2018-12-02 05:46:22,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:22,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:22,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:22,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:22,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:22,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:22,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:22,932 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:22,932 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:46:22,932 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:22,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:46:22,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:46:22,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:46:22,933 INFO L87 Difference]: Start difference. First operand 6105 states and 14166 transitions. Second operand 5 states. [2018-12-02 05:46:22,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:22,960 INFO L93 Difference]: Finished difference Result 6105 states and 14150 transitions. [2018-12-02 05:46:22,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 05:46:22,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-02 05:46:22,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:22,972 INFO L225 Difference]: With dead ends: 6105 [2018-12-02 05:46:22,972 INFO L226 Difference]: Without dead ends: 6105 [2018-12-02 05:46:22,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:46:22,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6105 states. [2018-12-02 05:46:23,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6105 to 5757. [2018-12-02 05:46:23,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2018-12-02 05:46:23,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 13316 transitions. [2018-12-02 05:46:23,008 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 13316 transitions. Word has length 99 [2018-12-02 05:46:23,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:23,008 INFO L480 AbstractCegarLoop]: Abstraction has 5757 states and 13316 transitions. [2018-12-02 05:46:23,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:46:23,009 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 13316 transitions. [2018-12-02 05:46:23,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 05:46:23,013 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:23,013 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:46:23,013 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:23,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:23,013 INFO L82 PathProgramCache]: Analyzing trace with hash 357606392, now seen corresponding path program 1 times [2018-12-02 05:46:23,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:23,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:23,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:23,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:23,015 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:23,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:23,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:23,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 05:46:23,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:23,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 05:46:23,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 05:46:23,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:46:23,127 INFO L87 Difference]: Start difference. First operand 5757 states and 13316 transitions. Second operand 10 states. [2018-12-02 05:46:23,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:23,705 INFO L93 Difference]: Finished difference Result 8664 states and 19989 transitions. [2018-12-02 05:46:23,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 05:46:23,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2018-12-02 05:46:23,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:23,711 INFO L225 Difference]: With dead ends: 8664 [2018-12-02 05:46:23,711 INFO L226 Difference]: Without dead ends: 6420 [2018-12-02 05:46:23,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2018-12-02 05:46:23,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6420 states. [2018-12-02 05:46:23,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6420 to 5890. [2018-12-02 05:46:23,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5890 states. [2018-12-02 05:46:23,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5890 states to 5890 states and 13589 transitions. [2018-12-02 05:46:23,769 INFO L78 Accepts]: Start accepts. Automaton has 5890 states and 13589 transitions. Word has length 99 [2018-12-02 05:46:23,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:23,769 INFO L480 AbstractCegarLoop]: Abstraction has 5890 states and 13589 transitions. [2018-12-02 05:46:23,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 05:46:23,769 INFO L276 IsEmpty]: Start isEmpty. Operand 5890 states and 13589 transitions. [2018-12-02 05:46:23,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 05:46:23,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:23,773 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:46:23,773 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:23,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:23,773 INFO L82 PathProgramCache]: Analyzing trace with hash 571332279, now seen corresponding path program 1 times [2018-12-02 05:46:23,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:23,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:23,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:23,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:23,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:23,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:23,840 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:23,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:46:23,840 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:23,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:46:23,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:46:23,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:46:23,840 INFO L87 Difference]: Start difference. First operand 5890 states and 13589 transitions. Second operand 6 states. [2018-12-02 05:46:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:23,941 INFO L93 Difference]: Finished difference Result 7234 states and 16172 transitions. [2018-12-02 05:46:23,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 05:46:23,941 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-02 05:46:23,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:23,945 INFO L225 Difference]: With dead ends: 7234 [2018-12-02 05:46:23,946 INFO L226 Difference]: Without dead ends: 7203 [2018-12-02 05:46:23,946 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-02 05:46:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7203 states. [2018-12-02 05:46:23,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7203 to 5897. [2018-12-02 05:46:23,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5897 states. [2018-12-02 05:46:23,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5897 states to 5897 states and 13285 transitions. [2018-12-02 05:46:23,993 INFO L78 Accepts]: Start accepts. Automaton has 5897 states and 13285 transitions. Word has length 99 [2018-12-02 05:46:23,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:23,994 INFO L480 AbstractCegarLoop]: Abstraction has 5897 states and 13285 transitions. [2018-12-02 05:46:23,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:46:23,994 INFO L276 IsEmpty]: Start isEmpty. Operand 5897 states and 13285 transitions. [2018-12-02 05:46:23,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 05:46:23,998 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:23,998 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:46:23,998 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:23,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:23,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1679511564, now seen corresponding path program 1 times [2018-12-02 05:46:23,998 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:23,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:23,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:23,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:23,999 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:24,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:24,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:24,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 05:46:24,028 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:24,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 05:46:24,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 05:46:24,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 05:46:24,029 INFO L87 Difference]: Start difference. First operand 5897 states and 13285 transitions. Second operand 5 states. [2018-12-02 05:46:24,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:24,176 INFO L93 Difference]: Finished difference Result 6847 states and 15318 transitions. [2018-12-02 05:46:24,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:46:24,177 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-02 05:46:24,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:24,183 INFO L225 Difference]: With dead ends: 6847 [2018-12-02 05:46:24,183 INFO L226 Difference]: Without dead ends: 6781 [2018-12-02 05:46:24,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 05:46:24,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6781 states. [2018-12-02 05:46:24,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6781 to 5524. [2018-12-02 05:46:24,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5524 states. [2018-12-02 05:46:24,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5524 states to 5524 states and 12519 transitions. [2018-12-02 05:46:24,241 INFO L78 Accepts]: Start accepts. Automaton has 5524 states and 12519 transitions. Word has length 99 [2018-12-02 05:46:24,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:24,241 INFO L480 AbstractCegarLoop]: Abstraction has 5524 states and 12519 transitions. [2018-12-02 05:46:24,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 05:46:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand 5524 states and 12519 transitions. [2018-12-02 05:46:24,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 05:46:24,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:24,245 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:46:24,245 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:24,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:24,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1922354035, now seen corresponding path program 2 times [2018-12-02 05:46:24,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:24,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:24,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:24,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:24,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:24,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:24,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 05:46:24,290 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:24,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 05:46:24,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 05:46:24,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 05:46:24,291 INFO L87 Difference]: Start difference. First operand 5524 states and 12519 transitions. Second operand 6 states. [2018-12-02 05:46:24,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:24,396 INFO L93 Difference]: Finished difference Result 5976 states and 13438 transitions. [2018-12-02 05:46:24,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 05:46:24,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-02 05:46:24,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:24,401 INFO L225 Difference]: With dead ends: 5976 [2018-12-02 05:46:24,401 INFO L226 Difference]: Without dead ends: 5976 [2018-12-02 05:46:24,401 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-02 05:46:24,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2018-12-02 05:46:24,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 5689. [2018-12-02 05:46:24,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5689 states. [2018-12-02 05:46:24,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5689 states to 5689 states and 12814 transitions. [2018-12-02 05:46:24,444 INFO L78 Accepts]: Start accepts. Automaton has 5689 states and 12814 transitions. Word has length 99 [2018-12-02 05:46:24,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:24,445 INFO L480 AbstractCegarLoop]: Abstraction has 5689 states and 12814 transitions. [2018-12-02 05:46:24,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 05:46:24,445 INFO L276 IsEmpty]: Start isEmpty. Operand 5689 states and 12814 transitions. [2018-12-02 05:46:24,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 05:46:24,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:24,449 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:46:24,449 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:24,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:24,449 INFO L82 PathProgramCache]: Analyzing trace with hash 122635640, now seen corresponding path program 2 times [2018-12-02 05:46:24,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:24,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:24,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:46:24,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:24,450 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:24,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:24,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:24,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:24,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 05:46:24,528 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:24,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 05:46:24,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 05:46:24,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 05:46:24,529 INFO L87 Difference]: Start difference. First operand 5689 states and 12814 transitions. Second operand 10 states. [2018-12-02 05:46:24,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:24,756 INFO L93 Difference]: Finished difference Result 16652 states and 37554 transitions. [2018-12-02 05:46:24,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 05:46:24,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 99 [2018-12-02 05:46:24,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:24,763 INFO L225 Difference]: With dead ends: 16652 [2018-12-02 05:46:24,763 INFO L226 Difference]: Without dead ends: 11449 [2018-12-02 05:46:24,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=445, Unknown=0, NotChecked=0, Total=552 [2018-12-02 05:46:24,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11449 states. [2018-12-02 05:46:24,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11449 to 5850. [2018-12-02 05:46:24,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2018-12-02 05:46:24,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 13073 transitions. [2018-12-02 05:46:24,823 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 13073 transitions. Word has length 99 [2018-12-02 05:46:24,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:24,823 INFO L480 AbstractCegarLoop]: Abstraction has 5850 states and 13073 transitions. [2018-12-02 05:46:24,823 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 05:46:24,823 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 13073 transitions. [2018-12-02 05:46:24,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 05:46:24,827 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:24,827 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:46:24,827 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:24,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:24,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1172143536, now seen corresponding path program 3 times [2018-12-02 05:46:24,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:24,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:24,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:46:24,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:24,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:24,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:24,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:24,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:24,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 05:46:24,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:24,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 05:46:24,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 05:46:24,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 05:46:24,883 INFO L87 Difference]: Start difference. First operand 5850 states and 13073 transitions. Second operand 9 states. [2018-12-02 05:46:24,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:24,999 INFO L93 Difference]: Finished difference Result 8942 states and 20023 transitions. [2018-12-02 05:46:24,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 05:46:24,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2018-12-02 05:46:24,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:25,002 INFO L225 Difference]: With dead ends: 8942 [2018-12-02 05:46:25,002 INFO L226 Difference]: Without dead ends: 3303 [2018-12-02 05:46:25,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2018-12-02 05:46:25,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3303 states. [2018-12-02 05:46:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3303 to 3303. [2018-12-02 05:46:25,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3303 states. [2018-12-02 05:46:25,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3303 states to 3303 states and 7371 transitions. [2018-12-02 05:46:25,024 INFO L78 Accepts]: Start accepts. Automaton has 3303 states and 7371 transitions. Word has length 99 [2018-12-02 05:46:25,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:25,024 INFO L480 AbstractCegarLoop]: Abstraction has 3303 states and 7371 transitions. [2018-12-02 05:46:25,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 05:46:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3303 states and 7371 transitions. [2018-12-02 05:46:25,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 05:46:25,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:25,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:46:25,027 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:25,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:25,027 INFO L82 PathProgramCache]: Analyzing trace with hash 2125986836, now seen corresponding path program 4 times [2018-12-02 05:46:25,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:25,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:25,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 05:46:25,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:25,028 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:25,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 05:46:25,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 05:46:25,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 05:46:25,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 05:46:25,126 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 05:46:25,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 05:46:25,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 05:46:25,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 05:46:25,126 INFO L87 Difference]: Start difference. First operand 3303 states and 7371 transitions. Second operand 11 states. [2018-12-02 05:46:25,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 05:46:25,643 INFO L93 Difference]: Finished difference Result 6829 states and 15330 transitions. [2018-12-02 05:46:25,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 05:46:25,643 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 99 [2018-12-02 05:46:25,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 05:46:25,646 INFO L225 Difference]: With dead ends: 6829 [2018-12-02 05:46:25,646 INFO L226 Difference]: Without dead ends: 4448 [2018-12-02 05:46:25,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-02 05:46:25,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4448 states. [2018-12-02 05:46:25,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4448 to 3297. [2018-12-02 05:46:25,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3297 states. [2018-12-02 05:46:25,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3297 states to 3297 states and 7353 transitions. [2018-12-02 05:46:25,669 INFO L78 Accepts]: Start accepts. Automaton has 3297 states and 7353 transitions. Word has length 99 [2018-12-02 05:46:25,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 05:46:25,669 INFO L480 AbstractCegarLoop]: Abstraction has 3297 states and 7353 transitions. [2018-12-02 05:46:25,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 05:46:25,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3297 states and 7353 transitions. [2018-12-02 05:46:25,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-02 05:46:25,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 05:46:25,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 05:46:25,671 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 05:46:25,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 05:46:25,671 INFO L82 PathProgramCache]: Analyzing trace with hash 303731124, now seen corresponding path program 5 times [2018-12-02 05:46:25,671 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 05:46:25,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:25,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 05:46:25,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 05:46:25,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 05:46:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:46:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 05:46:25,723 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 05:46:25,814 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 05:46:25,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:46:25 BasicIcfg [2018-12-02 05:46:25,815 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 05:46:25,815 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 05:46:25,816 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 05:46:25,816 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 05:46:25,816 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:46:10" (3/4) ... [2018-12-02 05:46:25,818 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 05:46:25,890 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_03f9558a-82af-402b-af08-59fc2fd303aa/bin-2019/utaipan/witness.graphml [2018-12-02 05:46:25,890 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 05:46:25,891 INFO L168 Benchmark]: Toolchain (without parser) took 15782.92 ms. Allocated memory was 1.0 GB in the beginning and 2.6 GB in the end (delta: 1.5 GB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -154.1 MB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2018-12-02 05:46:25,892 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:46:25,892 INFO L168 Benchmark]: CACSL2BoogieTranslator took 339.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -131.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-12-02 05:46:25,892 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 05:46:25,892 INFO L168 Benchmark]: Boogie Preprocessor took 22.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 05:46:25,893 INFO L168 Benchmark]: RCFGBuilder took 347.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. [2018-12-02 05:46:25,893 INFO L168 Benchmark]: TraceAbstraction took 14957.27 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -106.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-02 05:46:25,893 INFO L168 Benchmark]: Witness Printer took 75.08 ms. Allocated memory is still 2.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. [2018-12-02 05:46:25,894 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 339.10 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -131.1 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.16 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 347.50 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.3 MB). Peak memory consumption was 49.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14957.27 ms. Allocated memory was 1.1 GB in the beginning and 2.6 GB in the end (delta: 1.4 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -106.9 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. * Witness Printer took 75.08 ms. Allocated memory is still 2.6 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 31.9 MB). Peak memory consumption was 31.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [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_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0] [L682] -1 _Bool a$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0] [L683] -1 int a$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0] [L684] -1 _Bool a$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0] [L685] -1 _Bool a$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0] [L686] -1 _Bool a$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0] [L687] -1 _Bool a$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0] [L688] -1 _Bool a$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0] [L689] -1 _Bool a$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0] [L690] -1 _Bool a$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0] [L691] -1 int *a$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}] [L692] -1 int a$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0] [L693] -1 _Bool a$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0] [L694] -1 int a$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0] [L695] -1 _Bool a$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0] [L696] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0] [L697] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0] [L699] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L701] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L704] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0] [L705] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L790] -1 pthread_t t847; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t847, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L709] 0 a$w_buff1 = a$w_buff0 [L710] 0 a$w_buff0 = 1 [L711] 0 a$w_buff1_used = a$w_buff0_used [L712] 0 a$w_buff0_used = (_Bool)1 [L792] -1 pthread_t t848; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L793] FCALL, FORK -1 pthread_create(&t848, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L714] 0 a$r_buff1_thd0 = a$r_buff0_thd0 [L715] 0 a$r_buff1_thd1 = a$r_buff0_thd1 [L716] 0 a$r_buff1_thd2 = a$r_buff0_thd2 [L717] 0 a$r_buff0_thd1 = (_Bool)1 [L720] 0 x = 1 [L723] 0 __unbuffered_p0_EAX = x [L726] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L729] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L743] 1 y = 1 [L746] 1 z = 1 [L749] 1 __unbuffered_p1_EAX = z [L752] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L753] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L754] 1 a$flush_delayed = weak$$choice2 [L755] 1 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L756] EXPR 1 !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L729] 0 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L730] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used VAL [!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=1, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L730] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L756] 1 a = !a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff1) [L731] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L731] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L757] EXPR 1 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L732] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0))=1, x=1, y=1, z=1] [L757] 1 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : a$w_buff0)) [L758] EXPR 1 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1))=0, x=1, y=1, z=1] [L758] 1 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff1 : a$w_buff1)) [L759] EXPR 1 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L732] 0 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L733] EXPR 0 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L733] 0 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L736] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used))=0, x=1, y=1, z=1] [L759] 1 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used)) [L760] EXPR 1 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L760] 1 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L761] EXPR 1 weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2))=0, x=1, y=1, z=1] [L761] 1 a$r_buff0_thd2 = weak$$choice2 ? a$r_buff0_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff0_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2)) [L762] EXPR 1 weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L762] 1 a$r_buff1_thd2 = weak$$choice2 ? a$r_buff1_thd2 : (!a$w_buff0_used || !a$r_buff0_thd2 && !a$w_buff1_used || !a$r_buff0_thd2 && !a$r_buff1_thd2 ? a$r_buff1_thd2 : (a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L763] 1 __unbuffered_p1_EBX = a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L764] EXPR 1 a$flush_delayed ? a$mem_tmp : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=1, a$flush_delayed ? a$mem_tmp : a=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L764] 1 a = a$flush_delayed ? a$mem_tmp : a [L765] 1 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L768] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a)=0, a$w_buff1=0, a$w_buff1_used=0, a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L768] 1 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L769] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L769] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L770] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L770] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L771] 1 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L772] EXPR 1 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L772] 1 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L775] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L795] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L799] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L799] -1 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L800] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L800] -1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L801] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L801] -1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L802] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L802] -1 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L803] EXPR -1 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L803] -1 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L806] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 226 locations, 3 error locations. UNSAFE Result, 14.8s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 7.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8610 SDtfs, 8999 SDslu, 21526 SDs, 0 SdLazy, 6955 SolverSat, 312 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 310 GetRequests, 74 SyntacticMatches, 29 SemanticMatches, 207 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 230 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34931occurred in iteration=13, 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: 4.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 73194 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2532 NumberOfCodeBlocks, 2532 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2402 ConstructedInterpolants, 0 QuantifiedInterpolants, 559443 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...