./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_tso.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_83eecb76-5c7b-4bfa-bed7-82829ea43f33/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_83eecb76-5c7b-4bfa-bed7-82829ea43f33/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_83eecb76-5c7b-4bfa-bed7-82829ea43f33/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_83eecb76-5c7b-4bfa-bed7-82829ea43f33/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_83eecb76-5c7b-4bfa-bed7-82829ea43f33/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_83eecb76-5c7b-4bfa-bed7-82829ea43f33/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 42fa54ef19bc7b6faea6281eff260004759e02fd ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 00:11:49,105 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 00:11:49,106 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 00:11:49,112 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 00:11:49,113 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 00:11:49,113 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 00:11:49,114 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 00:11:49,115 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 00:11:49,116 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 00:11:49,116 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 00:11:49,116 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 00:11:49,117 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 00:11:49,117 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 00:11:49,118 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 00:11:49,118 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 00:11:49,119 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 00:11:49,119 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 00:11:49,120 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 00:11:49,121 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 00:11:49,122 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 00:11:49,122 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 00:11:49,123 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 00:11:49,124 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 00:11:49,124 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 00:11:49,124 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 00:11:49,125 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 00:11:49,125 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 00:11:49,125 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 00:11:49,126 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 00:11:49,126 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 00:11:49,127 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 00:11:49,127 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 00:11:49,127 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 00:11:49,127 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 00:11:49,128 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 00:11:49,128 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 00:11:49,128 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_83eecb76-5c7b-4bfa-bed7-82829ea43f33/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 00:11:49,136 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 00:11:49,136 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 00:11:49,136 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 00:11:49,136 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 00:11:49,136 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 00:11:49,136 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 00:11:49,137 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 00:11:49,137 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 00:11:49,137 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 00:11:49,137 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 00:11:49,137 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 00:11:49,137 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 00:11:49,137 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 00:11:49,137 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 00:11:49,138 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 00:11:49,138 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 00:11:49,138 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 00:11:49,138 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 00:11:49,138 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 00:11:49,138 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 00:11:49,138 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 00:11:49,138 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 00:11:49,138 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 00:11:49,138 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 00:11:49,139 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 00:11:49,139 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 00:11:49,139 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 00:11:49,139 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 00:11:49,139 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 00:11:49,139 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 00:11:49,139 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 00:11:49,139 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 00:11:49,139 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 00:11:49,139 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 00:11:49,140 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 00:11:49,140 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 00:11:49,140 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_83eecb76-5c7b-4bfa-bed7-82829ea43f33/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 -> 42fa54ef19bc7b6faea6281eff260004759e02fd [2018-12-02 00:11:49,158 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 00:11:49,167 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 00:11:49,169 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 00:11:49,171 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 00:11:49,171 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 00:11:49,171 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_83eecb76-5c7b-4bfa-bed7-82829ea43f33/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix038_tso.opt_false-unreach-call.i [2018-12-02 00:11:49,212 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_83eecb76-5c7b-4bfa-bed7-82829ea43f33/bin-2019/utaipan/data/7087df7e3/fa889bb34aa74fec8b89d158047bfd38/FLAGe564f3ba0 [2018-12-02 00:11:49,605 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 00:11:49,605 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_83eecb76-5c7b-4bfa-bed7-82829ea43f33/sv-benchmarks/c/pthread-wmm/mix038_tso.opt_false-unreach-call.i [2018-12-02 00:11:49,613 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_83eecb76-5c7b-4bfa-bed7-82829ea43f33/bin-2019/utaipan/data/7087df7e3/fa889bb34aa74fec8b89d158047bfd38/FLAGe564f3ba0 [2018-12-02 00:11:49,966 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_83eecb76-5c7b-4bfa-bed7-82829ea43f33/bin-2019/utaipan/data/7087df7e3/fa889bb34aa74fec8b89d158047bfd38 [2018-12-02 00:11:49,972 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 00:11:49,974 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 00:11:49,977 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 00:11:49,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 00:11:49,983 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 00:11:49,984 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:11:49" (1/1) ... [2018-12-02 00:11:49,987 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@190a4d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:49, skipping insertion in model container [2018-12-02 00:11:49,988 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 12:11:49" (1/1) ... [2018-12-02 00:11:49,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 00:11:50,020 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 00:11:50,226 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 00:11:50,237 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 00:11:50,323 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 00:11:50,361 INFO L195 MainTranslator]: Completed translation [2018-12-02 00:11:50,362 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:50 WrapperNode [2018-12-02 00:11:50,362 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 00:11:50,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 00:11:50,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 00:11:50,362 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 00:11:50,368 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:50" (1/1) ... [2018-12-02 00:11:50,378 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:50" (1/1) ... [2018-12-02 00:11:50,394 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 00:11:50,394 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 00:11:50,394 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 00:11:50,394 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 00:11:50,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:50" (1/1) ... [2018-12-02 00:11:50,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:50" (1/1) ... [2018-12-02 00:11:50,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:50" (1/1) ... [2018-12-02 00:11:50,403 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:50" (1/1) ... [2018-12-02 00:11:50,409 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:50" (1/1) ... [2018-12-02 00:11:50,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:50" (1/1) ... [2018-12-02 00:11:50,413 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:50" (1/1) ... [2018-12-02 00:11:50,415 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 00:11:50,415 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 00:11:50,415 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 00:11:50,415 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 00:11:50,416 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:50" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_83eecb76-5c7b-4bfa-bed7-82829ea43f33/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 00:11:50,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 00:11:50,452 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 00:11:50,452 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 00:11:50,452 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 00:11:50,452 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 00:11:50,452 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 00:11:50,452 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 00:11:50,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 00:11:50,453 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 00:11:50,453 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 00:11:50,453 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 00:11:50,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 00:11:50,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 00:11:50,454 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 00:11:50,774 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 00:11:50,774 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 00:11:50,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:11:50 BoogieIcfgContainer [2018-12-02 00:11:50,774 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 00:11:50,775 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 00:11:50,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 00:11:50,777 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 00:11:50,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 12:11:49" (1/3) ... [2018-12-02 00:11:50,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62521007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:11:50, skipping insertion in model container [2018-12-02 00:11:50,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 12:11:50" (2/3) ... [2018-12-02 00:11:50,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62521007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 12:11:50, skipping insertion in model container [2018-12-02 00:11:50,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:11:50" (3/3) ... [2018-12-02 00:11:50,779 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_tso.opt_false-unreach-call.i [2018-12-02 00:11:50,803 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,803 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,803 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,803 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,804 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,805 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,805 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,805 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,805 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,805 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,805 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,805 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,805 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,805 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,805 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,805 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,805 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,806 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,807 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,807 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,807 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,807 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,807 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,807 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,808 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,808 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,808 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,808 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,808 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,808 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,808 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,809 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,810 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,811 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,812 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,813 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,814 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,815 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,816 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,817 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,818 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,819 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,819 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,819 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,819 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,819 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,819 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,820 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,820 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,820 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,820 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,820 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,820 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,820 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,821 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,821 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,821 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,821 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,821 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,821 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,821 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,822 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,822 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,822 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,822 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,822 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,822 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,822 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,823 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,823 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,823 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,823 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,823 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,823 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,823 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,823 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,824 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 00:11:50,829 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 00:11:50,830 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 00:11:50,837 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 00:11:50,847 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 00:11:50,862 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 00:11:50,862 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 00:11:50,862 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 00:11:50,862 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 00:11:50,862 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 00:11:50,862 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 00:11:50,862 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 00:11:50,862 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 00:11:50,869 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146places, 177 transitions [2018-12-02 00:12:12,136 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149045 states. [2018-12-02 00:12:12,138 INFO L276 IsEmpty]: Start isEmpty. Operand 149045 states. [2018-12-02 00:12:12,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 00:12:12,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:12:12,147 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:12:12,148 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:12:12,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:12:12,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1389776375, now seen corresponding path program 1 times [2018-12-02 00:12:12,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:12:12,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:12:12,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:12:12,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:12:12,189 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:12:12,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:12:12,295 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 00:12:12,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:12:12,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 00:12:12,297 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:12:12,300 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 00:12:12,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:12:12,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:12:12,309 INFO L87 Difference]: Start difference. First operand 149045 states. Second operand 4 states. [2018-12-02 00:12:15,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:12:15,275 INFO L93 Difference]: Finished difference Result 257065 states and 1188604 transitions. [2018-12-02 00:12:15,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 00:12:15,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-02 00:12:15,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:12:15,932 INFO L225 Difference]: With dead ends: 257065 [2018-12-02 00:12:15,932 INFO L226 Difference]: Without dead ends: 174815 [2018-12-02 00:12:15,933 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 00:12:16,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174815 states. [2018-12-02 00:12:18,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174815 to 110555. [2018-12-02 00:12:18,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110555 states. [2018-12-02 00:12:19,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110555 states to 110555 states and 511486 transitions. [2018-12-02 00:12:19,139 INFO L78 Accepts]: Start accepts. Automaton has 110555 states and 511486 transitions. Word has length 46 [2018-12-02 00:12:19,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:12:19,140 INFO L480 AbstractCegarLoop]: Abstraction has 110555 states and 511486 transitions. [2018-12-02 00:12:19,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 00:12:19,140 INFO L276 IsEmpty]: Start isEmpty. Operand 110555 states and 511486 transitions. [2018-12-02 00:12:19,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 00:12:19,152 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:12:19,152 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:12:19,152 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:12:19,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:12:19,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1733656626, now seen corresponding path program 1 times [2018-12-02 00:12:19,153 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:12:19,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:12:19,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:12:19,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:12:19,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:12:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:12:19,213 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 00:12:19,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:12:19,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:12:19,213 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:12:19,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:12:19,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:12:19,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:12:19,215 INFO L87 Difference]: Start difference. First operand 110555 states and 511486 transitions. Second operand 5 states. [2018-12-02 00:12:20,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:12:20,542 INFO L93 Difference]: Finished difference Result 240605 states and 1068741 transitions. [2018-12-02 00:12:20,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 00:12:20,543 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-02 00:12:20,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:12:23,590 INFO L225 Difference]: With dead ends: 240605 [2018-12-02 00:12:23,590 INFO L226 Difference]: Without dead ends: 237055 [2018-12-02 00:12:23,591 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 00:12:24,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237055 states. [2018-12-02 00:12:26,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237055 to 160435. [2018-12-02 00:12:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160435 states. [2018-12-02 00:12:27,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160435 states to 160435 states and 716930 transitions. [2018-12-02 00:12:27,362 INFO L78 Accepts]: Start accepts. Automaton has 160435 states and 716930 transitions. Word has length 54 [2018-12-02 00:12:27,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:12:27,362 INFO L480 AbstractCegarLoop]: Abstraction has 160435 states and 716930 transitions. [2018-12-02 00:12:27,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:12:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand 160435 states and 716930 transitions. [2018-12-02 00:12:27,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 00:12:27,373 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:12:27,373 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] [2018-12-02 00:12:27,373 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:12:27,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:12:27,373 INFO L82 PathProgramCache]: Analyzing trace with hash 901134090, now seen corresponding path program 1 times [2018-12-02 00:12:27,373 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:12:27,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:12:27,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:12:27,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:12:27,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:12:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:12:27,426 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 00:12:27,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:12:27,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:12:27,426 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:12:27,426 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:12:27,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:12:27,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:12:27,427 INFO L87 Difference]: Start difference. First operand 160435 states and 716930 transitions. Second operand 5 states. [2018-12-02 00:12:29,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:12:29,079 INFO L93 Difference]: Finished difference Result 317175 states and 1405287 transitions. [2018-12-02 00:12:29,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 00:12:29,079 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-12-02 00:12:29,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:12:29,952 INFO L225 Difference]: With dead ends: 317175 [2018-12-02 00:12:29,953 INFO L226 Difference]: Without dead ends: 314275 [2018-12-02 00:12:29,953 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 00:12:31,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314275 states. [2018-12-02 00:12:34,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314275 to 178275. [2018-12-02 00:12:34,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178275 states. [2018-12-02 00:12:35,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178275 states to 178275 states and 791492 transitions. [2018-12-02 00:12:35,431 INFO L78 Accepts]: Start accepts. Automaton has 178275 states and 791492 transitions. Word has length 55 [2018-12-02 00:12:35,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:12:35,432 INFO L480 AbstractCegarLoop]: Abstraction has 178275 states and 791492 transitions. [2018-12-02 00:12:35,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:12:35,432 INFO L276 IsEmpty]: Start isEmpty. Operand 178275 states and 791492 transitions. [2018-12-02 00:12:35,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 00:12:35,448 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:12:35,448 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] [2018-12-02 00:12:35,449 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:12:35,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:12:35,449 INFO L82 PathProgramCache]: Analyzing trace with hash -710959504, now seen corresponding path program 1 times [2018-12-02 00:12:35,449 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:12:35,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:12:35,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:12:35,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:12:35,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:12:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:12:35,487 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 00:12:35,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:12:35,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 00:12:35,487 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:12:35,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 00:12:35,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 00:12:35,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 00:12:35,488 INFO L87 Difference]: Start difference. First operand 178275 states and 791492 transitions. Second operand 3 states. [2018-12-02 00:12:38,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:12:38,905 INFO L93 Difference]: Finished difference Result 231655 states and 1011276 transitions. [2018-12-02 00:12:38,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 00:12:38,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-12-02 00:12:38,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:12:39,495 INFO L225 Difference]: With dead ends: 231655 [2018-12-02 00:12:39,495 INFO L226 Difference]: Without dead ends: 231655 [2018-12-02 00:12:39,496 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 00:12:40,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231655 states. [2018-12-02 00:12:43,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231655 to 202940. [2018-12-02 00:12:43,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202940 states. [2018-12-02 00:12:44,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202940 states to 202940 states and 893564 transitions. [2018-12-02 00:12:44,023 INFO L78 Accepts]: Start accepts. Automaton has 202940 states and 893564 transitions. Word has length 57 [2018-12-02 00:12:44,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:12:44,023 INFO L480 AbstractCegarLoop]: Abstraction has 202940 states and 893564 transitions. [2018-12-02 00:12:44,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 00:12:44,023 INFO L276 IsEmpty]: Start isEmpty. Operand 202940 states and 893564 transitions. [2018-12-02 00:12:44,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 00:12:44,055 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:12:44,055 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:12:44,056 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:12:44,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:12:44,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1048459579, now seen corresponding path program 1 times [2018-12-02 00:12:44,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:12:44,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:12:44,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:12:44,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:12:44,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:12:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:12:44,118 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 00:12:44,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:12:44,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:12:44,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:12:44,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:12:44,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:12:44,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:12:44,119 INFO L87 Difference]: Start difference. First operand 202940 states and 893564 transitions. Second operand 6 states. [2018-12-02 00:12:46,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:12:46,393 INFO L93 Difference]: Finished difference Result 356175 states and 1552272 transitions. [2018-12-02 00:12:46,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 00:12:46,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-02 00:12:46,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:12:47,302 INFO L225 Difference]: With dead ends: 356175 [2018-12-02 00:12:47,302 INFO L226 Difference]: Without dead ends: 352825 [2018-12-02 00:12:47,303 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-02 00:12:51,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352825 states. [2018-12-02 00:12:54,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352825 to 205745. [2018-12-02 00:12:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205745 states. [2018-12-02 00:12:55,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205745 states to 205745 states and 906783 transitions. [2018-12-02 00:12:55,748 INFO L78 Accepts]: Start accepts. Automaton has 205745 states and 906783 transitions. Word has length 61 [2018-12-02 00:12:55,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:12:55,748 INFO L480 AbstractCegarLoop]: Abstraction has 205745 states and 906783 transitions. [2018-12-02 00:12:55,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:12:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 205745 states and 906783 transitions. [2018-12-02 00:12:55,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 00:12:55,781 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:12:55,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:12:55,781 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:12:55,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:12:55,781 INFO L82 PathProgramCache]: Analyzing trace with hash -639670917, now seen corresponding path program 1 times [2018-12-02 00:12:55,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:12:55,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:12:55,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:12:55,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:12:55,783 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:12:55,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:12:55,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:12:55,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:12:55,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 00:12:55,847 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:12:55,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 00:12:55,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 00:12:55,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:12:55,848 INFO L87 Difference]: Start difference. First operand 205745 states and 906783 transitions. Second operand 7 states. [2018-12-02 00:12:58,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:12:58,389 INFO L93 Difference]: Finished difference Result 363445 states and 1539808 transitions. [2018-12-02 00:12:58,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 00:12:58,390 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-12-02 00:12:58,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:12:59,351 INFO L225 Difference]: With dead ends: 363445 [2018-12-02 00:12:59,351 INFO L226 Difference]: Without dead ends: 363445 [2018-12-02 00:12:59,351 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 00:13:01,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363445 states. [2018-12-02 00:13:07,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363445 to 273285. [2018-12-02 00:13:07,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273285 states. [2018-12-02 00:13:08,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273285 states to 273285 states and 1180560 transitions. [2018-12-02 00:13:08,818 INFO L78 Accepts]: Start accepts. Automaton has 273285 states and 1180560 transitions. Word has length 61 [2018-12-02 00:13:08,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:13:08,818 INFO L480 AbstractCegarLoop]: Abstraction has 273285 states and 1180560 transitions. [2018-12-02 00:13:08,818 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 00:13:08,818 INFO L276 IsEmpty]: Start isEmpty. Operand 273285 states and 1180560 transitions. [2018-12-02 00:13:08,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 00:13:08,861 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:13:08,861 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:13:08,861 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:13:08,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:13:08,862 INFO L82 PathProgramCache]: Analyzing trace with hash 247832764, now seen corresponding path program 1 times [2018-12-02 00:13:08,862 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:13:08,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:08,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:13:08,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:08,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:13:08,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:13:08,917 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 00:13:08,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:13:08,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 00:13:08,917 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:13:08,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 00:13:08,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:13:08,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:13:08,917 INFO L87 Difference]: Start difference. First operand 273285 states and 1180560 transitions. Second operand 4 states. [2018-12-02 00:13:10,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:13:10,447 INFO L93 Difference]: Finished difference Result 238293 states and 1009124 transitions. [2018-12-02 00:13:10,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 00:13:10,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-02 00:13:10,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:13:11,041 INFO L225 Difference]: With dead ends: 238293 [2018-12-02 00:13:11,041 INFO L226 Difference]: Without dead ends: 230208 [2018-12-02 00:13:11,041 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 00:13:12,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230208 states. [2018-12-02 00:13:15,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230208 to 230208. [2018-12-02 00:13:15,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230208 states. [2018-12-02 00:13:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230208 states to 230208 states and 981402 transitions. [2018-12-02 00:13:16,031 INFO L78 Accepts]: Start accepts. Automaton has 230208 states and 981402 transitions. Word has length 61 [2018-12-02 00:13:16,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:13:16,031 INFO L480 AbstractCegarLoop]: Abstraction has 230208 states and 981402 transitions. [2018-12-02 00:13:16,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 00:13:16,031 INFO L276 IsEmpty]: Start isEmpty. Operand 230208 states and 981402 transitions. [2018-12-02 00:13:16,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 00:13:16,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:13:16,068 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] [2018-12-02 00:13:16,069 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:13:16,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:13:16,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1622064650, now seen corresponding path program 1 times [2018-12-02 00:13:16,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:13:16,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:16,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:13:16,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:16,071 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:13:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:13:16,121 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 00:13:16,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:13:16,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:13:16,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:13:16,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:13:16,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:13:16,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:13:16,122 INFO L87 Difference]: Start difference. First operand 230208 states and 981402 transitions. Second operand 5 states. [2018-12-02 00:13:16,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:13:16,350 INFO L93 Difference]: Finished difference Result 55500 states and 215291 transitions. [2018-12-02 00:13:16,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:13:16,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-12-02 00:13:16,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:13:16,442 INFO L225 Difference]: With dead ends: 55500 [2018-12-02 00:13:16,442 INFO L226 Difference]: Without dead ends: 48584 [2018-12-02 00:13:16,443 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 00:13:16,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48584 states. [2018-12-02 00:13:18,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48584 to 48344. [2018-12-02 00:13:18,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48344 states. [2018-12-02 00:13:19,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48344 states to 48344 states and 187078 transitions. [2018-12-02 00:13:19,056 INFO L78 Accepts]: Start accepts. Automaton has 48344 states and 187078 transitions. Word has length 62 [2018-12-02 00:13:19,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:13:19,056 INFO L480 AbstractCegarLoop]: Abstraction has 48344 states and 187078 transitions. [2018-12-02 00:13:19,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:13:19,056 INFO L276 IsEmpty]: Start isEmpty. Operand 48344 states and 187078 transitions. [2018-12-02 00:13:19,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 00:13:19,072 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:13:19,072 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:13:19,072 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:13:19,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:13:19,073 INFO L82 PathProgramCache]: Analyzing trace with hash -34559289, now seen corresponding path program 1 times [2018-12-02 00:13:19,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:13:19,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:19,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:13:19,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:19,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:13:19,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:13:19,118 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 00:13:19,118 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:13:19,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 00:13:19,118 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:13:19,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 00:13:19,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:13:19,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:13:19,119 INFO L87 Difference]: Start difference. First operand 48344 states and 187078 transitions. Second operand 4 states. [2018-12-02 00:13:19,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:13:19,383 INFO L93 Difference]: Finished difference Result 56631 states and 218625 transitions. [2018-12-02 00:13:19,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 00:13:19,383 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-02 00:13:19,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:13:19,493 INFO L225 Difference]: With dead ends: 56631 [2018-12-02 00:13:19,493 INFO L226 Difference]: Without dead ends: 56631 [2018-12-02 00:13:19,494 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 00:13:19,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56631 states. [2018-12-02 00:13:20,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56631 to 51431. [2018-12-02 00:13:20,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51431 states. [2018-12-02 00:13:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51431 states to 51431 states and 198665 transitions. [2018-12-02 00:13:20,300 INFO L78 Accepts]: Start accepts. Automaton has 51431 states and 198665 transitions. Word has length 72 [2018-12-02 00:13:20,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:13:20,300 INFO L480 AbstractCegarLoop]: Abstraction has 51431 states and 198665 transitions. [2018-12-02 00:13:20,300 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 00:13:20,300 INFO L276 IsEmpty]: Start isEmpty. Operand 51431 states and 198665 transitions. [2018-12-02 00:13:20,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 00:13:20,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:13:20,319 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:13:20,319 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:13:20,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:13:20,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1708251046, now seen corresponding path program 1 times [2018-12-02 00:13:20,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:13:20,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:20,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:13:20,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:20,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:13:20,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:13:20,504 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 00:13:20,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:13:20,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:13:20,504 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:13:20,504 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:13:20,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:13:20,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:13:20,505 INFO L87 Difference]: Start difference. First operand 51431 states and 198665 transitions. Second operand 6 states. [2018-12-02 00:13:20,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:13:20,612 INFO L93 Difference]: Finished difference Result 14279 states and 47593 transitions. [2018-12-02 00:13:20,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 00:13:20,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-12-02 00:13:20,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:13:20,627 INFO L225 Difference]: With dead ends: 14279 [2018-12-02 00:13:20,627 INFO L226 Difference]: Without dead ends: 12023 [2018-12-02 00:13:20,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:13:20,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12023 states. [2018-12-02 00:13:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12023 to 11433. [2018-12-02 00:13:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11433 states. [2018-12-02 00:13:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11433 states to 11433 states and 37545 transitions. [2018-12-02 00:13:20,767 INFO L78 Accepts]: Start accepts. Automaton has 11433 states and 37545 transitions. Word has length 72 [2018-12-02 00:13:20,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:13:20,767 INFO L480 AbstractCegarLoop]: Abstraction has 11433 states and 37545 transitions. [2018-12-02 00:13:20,767 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:13:20,768 INFO L276 IsEmpty]: Start isEmpty. Operand 11433 states and 37545 transitions. [2018-12-02 00:13:20,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 00:13:20,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:13:20,779 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] [2018-12-02 00:13:20,779 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:13:20,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:13:20,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1409942006, now seen corresponding path program 1 times [2018-12-02 00:13:20,779 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:13:20,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:20,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:13:20,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:20,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:13:20,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:13:20,820 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 00:13:20,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:13:20,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 00:13:20,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:13:20,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 00:13:20,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 00:13:20,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 00:13:20,821 INFO L87 Difference]: Start difference. First operand 11433 states and 37545 transitions. Second operand 4 states. [2018-12-02 00:13:20,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:13:20,970 INFO L93 Difference]: Finished difference Result 15878 states and 51191 transitions. [2018-12-02 00:13:20,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 00:13:20,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-02 00:13:20,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:13:20,992 INFO L225 Difference]: With dead ends: 15878 [2018-12-02 00:13:20,992 INFO L226 Difference]: Without dead ends: 15878 [2018-12-02 00:13:20,992 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 00:13:21,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15878 states. [2018-12-02 00:13:21,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15878 to 13895. [2018-12-02 00:13:21,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13895 states. [2018-12-02 00:13:21,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13895 states to 13895 states and 45044 transitions. [2018-12-02 00:13:21,149 INFO L78 Accepts]: Start accepts. Automaton has 13895 states and 45044 transitions. Word has length 91 [2018-12-02 00:13:21,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:13:21,149 INFO L480 AbstractCegarLoop]: Abstraction has 13895 states and 45044 transitions. [2018-12-02 00:13:21,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 00:13:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 13895 states and 45044 transitions. [2018-12-02 00:13:21,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 00:13:21,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:13:21,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:13:21,164 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:13:21,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:13:21,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1395330258, now seen corresponding path program 2 times [2018-12-02 00:13:21,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:13:21,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:21,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:13:21,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:21,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:13:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:13: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 00:13:21,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:13:21,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 00:13:21,256 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:13:21,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 00:13:21,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 00:13:21,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:13:21,257 INFO L87 Difference]: Start difference. First operand 13895 states and 45044 transitions. Second operand 7 states. [2018-12-02 00:13:21,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:13:21,582 INFO L93 Difference]: Finished difference Result 20218 states and 65663 transitions. [2018-12-02 00:13:21,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 00:13:21,583 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-02 00:13:21,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:13:21,607 INFO L225 Difference]: With dead ends: 20218 [2018-12-02 00:13:21,607 INFO L226 Difference]: Without dead ends: 20218 [2018-12-02 00:13:21,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 00:13:21,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20218 states. [2018-12-02 00:13:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20218 to 16200. [2018-12-02 00:13:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16200 states. [2018-12-02 00:13:21,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16200 states to 16200 states and 52813 transitions. [2018-12-02 00:13:21,811 INFO L78 Accepts]: Start accepts. Automaton has 16200 states and 52813 transitions. Word has length 91 [2018-12-02 00:13:21,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:13:21,811 INFO L480 AbstractCegarLoop]: Abstraction has 16200 states and 52813 transitions. [2018-12-02 00:13:21,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 00:13:21,811 INFO L276 IsEmpty]: Start isEmpty. Operand 16200 states and 52813 transitions. [2018-12-02 00:13:21,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 00:13:21,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:13:21,826 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] [2018-12-02 00:13:21,826 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:13:21,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:13:21,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1725096019, now seen corresponding path program 1 times [2018-12-02 00:13:21,827 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:13:21,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:21,828 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 00:13:21,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:21,828 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:13:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:13:21,866 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 00:13:21,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:13:21,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 00:13:21,866 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:13:21,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 00:13:21,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 00:13:21,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 00:13:21,867 INFO L87 Difference]: Start difference. First operand 16200 states and 52813 transitions. Second operand 5 states. [2018-12-02 00:13:22,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:13:22,038 INFO L93 Difference]: Finished difference Result 20007 states and 64473 transitions. [2018-12-02 00:13:22,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 00:13:22,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-02 00:13:22,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:13:22,066 INFO L225 Difference]: With dead ends: 20007 [2018-12-02 00:13:22,066 INFO L226 Difference]: Without dead ends: 20007 [2018-12-02 00:13:22,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 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 00:13:22,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20007 states. [2018-12-02 00:13:22,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20007 to 16725. [2018-12-02 00:13:22,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16725 states. [2018-12-02 00:13:22,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16725 states to 16725 states and 54333 transitions. [2018-12-02 00:13:22,258 INFO L78 Accepts]: Start accepts. Automaton has 16725 states and 54333 transitions. Word has length 91 [2018-12-02 00:13:22,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:13:22,258 INFO L480 AbstractCegarLoop]: Abstraction has 16725 states and 54333 transitions. [2018-12-02 00:13:22,259 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 00:13:22,259 INFO L276 IsEmpty]: Start isEmpty. Operand 16725 states and 54333 transitions. [2018-12-02 00:13:22,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 00:13:22,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:13:22,274 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] [2018-12-02 00:13:22,275 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:13:22,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:13:22,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1233112668, now seen corresponding path program 3 times [2018-12-02 00:13:22,275 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:13:22,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:22,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:13:22,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:22,276 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:13:22,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:13:22,353 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 00:13:22,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:13:22,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 00:13:22,353 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:13:22,353 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 00:13:22,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 00:13:22,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:13:22,353 INFO L87 Difference]: Start difference. First operand 16725 states and 54333 transitions. Second operand 7 states. [2018-12-02 00:13:22,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:13:22,676 INFO L93 Difference]: Finished difference Result 29923 states and 97248 transitions. [2018-12-02 00:13:22,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 00:13:22,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-02 00:13:22,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:13:22,714 INFO L225 Difference]: With dead ends: 29923 [2018-12-02 00:13:22,714 INFO L226 Difference]: Without dead ends: 29923 [2018-12-02 00:13:22,714 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-02 00:13:22,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29923 states. [2018-12-02 00:13:23,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29923 to 19396. [2018-12-02 00:13:23,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19396 states. [2018-12-02 00:13:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19396 states to 19396 states and 63470 transitions. [2018-12-02 00:13:23,070 INFO L78 Accepts]: Start accepts. Automaton has 19396 states and 63470 transitions. Word has length 91 [2018-12-02 00:13:23,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:13:23,071 INFO L480 AbstractCegarLoop]: Abstraction has 19396 states and 63470 transitions. [2018-12-02 00:13:23,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 00:13:23,071 INFO L276 IsEmpty]: Start isEmpty. Operand 19396 states and 63470 transitions. [2018-12-02 00:13:23,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 00:13:23,089 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:13:23,089 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:13:23,089 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:13:23,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:13:23,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2120616349, now seen corresponding path program 1 times [2018-12-02 00:13:23,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:13:23,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:23,090 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 00:13:23,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:23,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:13:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:13:23,144 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 00:13:23,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:13:23,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:13:23,144 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:13:23,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:13:23,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:13:23,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:13:23,145 INFO L87 Difference]: Start difference. First operand 19396 states and 63470 transitions. Second operand 6 states. [2018-12-02 00:13:23,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:13:23,393 INFO L93 Difference]: Finished difference Result 27711 states and 90060 transitions. [2018-12-02 00:13:23,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 00:13:23,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-02 00:13:23,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:13:23,429 INFO L225 Difference]: With dead ends: 27711 [2018-12-02 00:13:23,429 INFO L226 Difference]: Without dead ends: 27711 [2018-12-02 00:13:23,429 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:13:23,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27711 states. [2018-12-02 00:13:23,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27711 to 21646. [2018-12-02 00:13:23,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21646 states. [2018-12-02 00:13:23,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21646 states to 21646 states and 70790 transitions. [2018-12-02 00:13:23,707 INFO L78 Accepts]: Start accepts. Automaton has 21646 states and 70790 transitions. Word has length 91 [2018-12-02 00:13:23,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:13:23,708 INFO L480 AbstractCegarLoop]: Abstraction has 21646 states and 70790 transitions. [2018-12-02 00:13:23,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:13:23,708 INFO L276 IsEmpty]: Start isEmpty. Operand 21646 states and 70790 transitions. [2018-12-02 00:13:23,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 00:13:23,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:13:23,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 00:13:23,728 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:13:23,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:13:23,728 INFO L82 PathProgramCache]: Analyzing trace with hash -844096675, now seen corresponding path program 1 times [2018-12-02 00:13:23,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:13:23,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:23,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:13:23,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:23,730 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:13:23,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:13:23,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:13:23,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:13:23,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:13:23,802 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:13:23,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:13:23,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:13:23,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:13:23,803 INFO L87 Difference]: Start difference. First operand 21646 states and 70790 transitions. Second operand 6 states. [2018-12-02 00:13:23,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:13:23,918 INFO L93 Difference]: Finished difference Result 20814 states and 67126 transitions. [2018-12-02 00:13:23,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 00:13:23,919 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-02 00:13:23,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:13:23,943 INFO L225 Difference]: With dead ends: 20814 [2018-12-02 00:13:23,943 INFO L226 Difference]: Without dead ends: 20814 [2018-12-02 00:13:23,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 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 00:13:23,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20814 states. [2018-12-02 00:13:24,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20814 to 15341. [2018-12-02 00:13:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15341 states. [2018-12-02 00:13:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15341 states to 15341 states and 49938 transitions. [2018-12-02 00:13:24,148 INFO L78 Accepts]: Start accepts. Automaton has 15341 states and 49938 transitions. Word has length 91 [2018-12-02 00:13:24,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:13:24,148 INFO L480 AbstractCegarLoop]: Abstraction has 15341 states and 49938 transitions. [2018-12-02 00:13:24,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:13:24,148 INFO L276 IsEmpty]: Start isEmpty. Operand 15341 states and 49938 transitions. [2018-12-02 00:13:24,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 00:13:24,163 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:13:24,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, 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 00:13:24,163 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:13:24,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:13:24,164 INFO L82 PathProgramCache]: Analyzing trace with hash -869057539, now seen corresponding path program 1 times [2018-12-02 00:13:24,164 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:13:24,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:24,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:13:24,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:24,165 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:13:24,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:13:24,237 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 00:13:24,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:13:24,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:13:24,237 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:13:24,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:13:24,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:13:24,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:13:24,238 INFO L87 Difference]: Start difference. First operand 15341 states and 49938 transitions. Second operand 6 states. [2018-12-02 00:13:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:13:24,437 INFO L93 Difference]: Finished difference Result 19026 states and 59246 transitions. [2018-12-02 00:13:24,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 00:13:24,437 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 00:13:24,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:13:24,457 INFO L225 Difference]: With dead ends: 19026 [2018-12-02 00:13:24,457 INFO L226 Difference]: Without dead ends: 19026 [2018-12-02 00:13:24,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-02 00:13:24,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19026 states. [2018-12-02 00:13:24,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19026 to 15531. [2018-12-02 00:13:24,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15531 states. [2018-12-02 00:13:24,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15531 states to 15531 states and 48890 transitions. [2018-12-02 00:13:24,638 INFO L78 Accepts]: Start accepts. Automaton has 15531 states and 48890 transitions. Word has length 93 [2018-12-02 00:13:24,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:13:24,638 INFO L480 AbstractCegarLoop]: Abstraction has 15531 states and 48890 transitions. [2018-12-02 00:13:24,638 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:13:24,638 INFO L276 IsEmpty]: Start isEmpty. Operand 15531 states and 48890 transitions. [2018-12-02 00:13:24,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 00:13:24,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:13:24,652 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] [2018-12-02 00:13:24,652 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:13:24,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:13:24,652 INFO L82 PathProgramCache]: Analyzing trace with hash 92556478, now seen corresponding path program 1 times [2018-12-02 00:13:24,653 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:13:24,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:24,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:13:24,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:24,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:13:24,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:13:24,742 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 00:13:24,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:13:24,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 00:13:24,742 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:13:24,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 00:13:24,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 00:13:24,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 00:13:24,743 INFO L87 Difference]: Start difference. First operand 15531 states and 48890 transitions. Second operand 8 states. [2018-12-02 00:13:24,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:13:24,980 INFO L93 Difference]: Finished difference Result 18598 states and 58056 transitions. [2018-12-02 00:13:24,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 00:13:24,980 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-02 00:13:24,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:13:25,000 INFO L225 Difference]: With dead ends: 18598 [2018-12-02 00:13:25,000 INFO L226 Difference]: Without dead ends: 18598 [2018-12-02 00:13:25,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-02 00:13:25,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18598 states. [2018-12-02 00:13:25,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18598 to 17814. [2018-12-02 00:13:25,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17814 states. [2018-12-02 00:13:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17814 states to 17814 states and 55867 transitions. [2018-12-02 00:13:25,230 INFO L78 Accepts]: Start accepts. Automaton has 17814 states and 55867 transitions. Word has length 93 [2018-12-02 00:13:25,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:13:25,230 INFO L480 AbstractCegarLoop]: Abstraction has 17814 states and 55867 transitions. [2018-12-02 00:13:25,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 00:13:25,230 INFO L276 IsEmpty]: Start isEmpty. Operand 17814 states and 55867 transitions. [2018-12-02 00:13:25,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 00:13:25,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:13:25,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] [2018-12-02 00:13:25,245 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:13:25,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:13:25,245 INFO L82 PathProgramCache]: Analyzing trace with hash 980060159, now seen corresponding path program 1 times [2018-12-02 00:13:25,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:13:25,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:25,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:13:25,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:25,246 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:13:25,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:13:25,343 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 00:13:25,344 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:13:25,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 00:13:25,344 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:13:25,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 00:13:25,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 00:13:25,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 00:13:25,344 INFO L87 Difference]: Start difference. First operand 17814 states and 55867 transitions. Second operand 10 states. [2018-12-02 00:13:26,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:13:26,177 INFO L93 Difference]: Finished difference Result 33240 states and 104369 transitions. [2018-12-02 00:13:26,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 00:13:26,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-12-02 00:13:26,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:13:26,201 INFO L225 Difference]: With dead ends: 33240 [2018-12-02 00:13:26,201 INFO L226 Difference]: Without dead ends: 21729 [2018-12-02 00:13:26,201 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-02 00:13:26,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21729 states. [2018-12-02 00:13:26,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21729 to 18234. [2018-12-02 00:13:26,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18234 states. [2018-12-02 00:13:26,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18234 states to 18234 states and 56863 transitions. [2018-12-02 00:13:26,410 INFO L78 Accepts]: Start accepts. Automaton has 18234 states and 56863 transitions. Word has length 93 [2018-12-02 00:13:26,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:13:26,411 INFO L480 AbstractCegarLoop]: Abstraction has 18234 states and 56863 transitions. [2018-12-02 00:13:26,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 00:13:26,411 INFO L276 IsEmpty]: Start isEmpty. Operand 18234 states and 56863 transitions. [2018-12-02 00:13:26,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 00:13:26,428 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:13:26,428 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] [2018-12-02 00:13:26,428 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:13:26,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:13:26,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1687294982, now seen corresponding path program 1 times [2018-12-02 00:13:26,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:13:26,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:26,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:13:26,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:26,430 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:13:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:13:26,512 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 00:13:26,512 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:13:26,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 00:13:26,512 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:13:26,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 00:13:26,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 00:13:26,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 00:13:26,513 INFO L87 Difference]: Start difference. First operand 18234 states and 56863 transitions. Second operand 6 states. [2018-12-02 00:13:26,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:13:26,682 INFO L93 Difference]: Finished difference Result 21089 states and 64772 transitions. [2018-12-02 00:13:26,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 00:13:26,682 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2018-12-02 00:13:26,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:13:26,703 INFO L225 Difference]: With dead ends: 21089 [2018-12-02 00:13:26,703 INFO L226 Difference]: Without dead ends: 20579 [2018-12-02 00:13:26,704 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 00:13:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20579 states. [2018-12-02 00:13:26,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20579 to 18274. [2018-12-02 00:13:26,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18274 states. [2018-12-02 00:13:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18274 states to 18274 states and 56105 transitions. [2018-12-02 00:13:26,896 INFO L78 Accepts]: Start accepts. Automaton has 18274 states and 56105 transitions. Word has length 93 [2018-12-02 00:13:26,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:13:26,896 INFO L480 AbstractCegarLoop]: Abstraction has 18274 states and 56105 transitions. [2018-12-02 00:13:26,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 00:13:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 18274 states and 56105 transitions. [2018-12-02 00:13:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 00:13:26,912 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:13:26,912 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] [2018-12-02 00:13:26,912 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:13:26,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:13:26,912 INFO L82 PathProgramCache]: Analyzing trace with hash 530462971, now seen corresponding path program 2 times [2018-12-02 00:13:26,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:13:26,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:26,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:13:26,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:26,914 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:13:26,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:13:26,987 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 00:13:26,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:13:26,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 00:13:26,988 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:13:26,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 00:13:26,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 00:13:26,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 00:13:26,988 INFO L87 Difference]: Start difference. First operand 18274 states and 56105 transitions. Second operand 10 states. [2018-12-02 00:13:27,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:13:27,520 INFO L93 Difference]: Finished difference Result 34526 states and 105666 transitions. [2018-12-02 00:13:27,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 00:13:27,521 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-12-02 00:13:27,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:13:27,538 INFO L225 Difference]: With dead ends: 34526 [2018-12-02 00:13:27,538 INFO L226 Difference]: Without dead ends: 16334 [2018-12-02 00:13:27,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-02 00:13:27,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16334 states. [2018-12-02 00:13:27,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16334 to 16334. [2018-12-02 00:13:27,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16334 states. [2018-12-02 00:13:27,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16334 states to 16334 states and 49877 transitions. [2018-12-02 00:13:27,705 INFO L78 Accepts]: Start accepts. Automaton has 16334 states and 49877 transitions. Word has length 93 [2018-12-02 00:13:27,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:13:27,705 INFO L480 AbstractCegarLoop]: Abstraction has 16334 states and 49877 transitions. [2018-12-02 00:13:27,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 00:13:27,705 INFO L276 IsEmpty]: Start isEmpty. Operand 16334 states and 49877 transitions. [2018-12-02 00:13:27,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 00:13:27,718 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:13:27,718 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] [2018-12-02 00:13:27,718 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:13:27,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:13:27,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1667491465, now seen corresponding path program 3 times [2018-12-02 00:13:27,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:13:27,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:27,719 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 00:13:27,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:27,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:13:27,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:13:27,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 00:13:27,773 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:13:27,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 00:13:27,773 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:13:27,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 00:13:27,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 00:13:27,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 00:13:27,774 INFO L87 Difference]: Start difference. First operand 16334 states and 49877 transitions. Second operand 7 states. [2018-12-02 00:13:28,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:13:28,135 INFO L93 Difference]: Finished difference Result 28507 states and 87043 transitions. [2018-12-02 00:13:28,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 00:13:28,135 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-02 00:13:28,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:13:28,147 INFO L225 Difference]: With dead ends: 28507 [2018-12-02 00:13:28,147 INFO L226 Difference]: Without dead ends: 11140 [2018-12-02 00:13:28,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:13:28,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11140 states. [2018-12-02 00:13:28,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11140 to 11140. [2018-12-02 00:13:28,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11140 states. [2018-12-02 00:13:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11140 states to 11140 states and 33961 transitions. [2018-12-02 00:13:28,310 INFO L78 Accepts]: Start accepts. Automaton has 11140 states and 33961 transitions. Word has length 93 [2018-12-02 00:13:28,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:13:28,310 INFO L480 AbstractCegarLoop]: Abstraction has 11140 states and 33961 transitions. [2018-12-02 00:13:28,310 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 00:13:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 11140 states and 33961 transitions. [2018-12-02 00:13:28,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 00:13:28,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:13:28,319 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] [2018-12-02 00:13:28,320 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:13:28,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:13:28,320 INFO L82 PathProgramCache]: Analyzing trace with hash 764949559, now seen corresponding path program 4 times [2018-12-02 00:13:28,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:13:28,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:28,321 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 00:13:28,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:28,321 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:13:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 00:13:28,422 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 00:13:28,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 00:13:28,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 00:13:28,422 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 00:13:28,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 00:13:28,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 00:13:28,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 00:13:28,423 INFO L87 Difference]: Start difference. First operand 11140 states and 33961 transitions. Second operand 11 states. [2018-12-02 00:13:28,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 00:13:28,973 INFO L93 Difference]: Finished difference Result 19316 states and 59081 transitions. [2018-12-02 00:13:28,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 00:13:28,974 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2018-12-02 00:13:28,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 00:13:28,986 INFO L225 Difference]: With dead ends: 19316 [2018-12-02 00:13:28,986 INFO L226 Difference]: Without dead ends: 12362 [2018-12-02 00:13:28,987 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 00:13:29,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12362 states. [2018-12-02 00:13:29,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12362 to 11050. [2018-12-02 00:13:29,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11050 states. [2018-12-02 00:13:29,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11050 states to 11050 states and 33713 transitions. [2018-12-02 00:13:29,100 INFO L78 Accepts]: Start accepts. Automaton has 11050 states and 33713 transitions. Word has length 93 [2018-12-02 00:13:29,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 00:13:29,100 INFO L480 AbstractCegarLoop]: Abstraction has 11050 states and 33713 transitions. [2018-12-02 00:13:29,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 00:13:29,100 INFO L276 IsEmpty]: Start isEmpty. Operand 11050 states and 33713 transitions. [2018-12-02 00:13:29,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 00:13:29,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 00:13:29,110 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] [2018-12-02 00:13:29,110 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 00:13:29,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 00:13:29,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1054598123, now seen corresponding path program 5 times [2018-12-02 00:13:29,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 00:13:29,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:29,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 00:13:29,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 00:13:29,112 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 00:13:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:13:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 00:13:29,165 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 00:13:29,236 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 00:13:29,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 12:13:29 BasicIcfg [2018-12-02 00:13:29,237 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 00:13:29,237 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 00:13:29,237 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 00:13:29,237 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 00:13:29,238 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 12:11:50" (3/4) ... [2018-12-02 00:13:29,239 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 00:13:29,316 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_83eecb76-5c7b-4bfa-bed7-82829ea43f33/bin-2019/utaipan/witness.graphml [2018-12-02 00:13:29,317 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 00:13:29,317 INFO L168 Benchmark]: Toolchain (without parser) took 99344.95 ms. Allocated memory was 1.0 GB in the beginning and 7.8 GB in the end (delta: 6.7 GB). Free memory was 952.4 MB in the beginning and 5.5 GB in the end (delta: -4.6 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-12-02 00:13:29,318 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 00:13:29,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -159.9 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2018-12-02 00:13:29,318 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-02 00:13:29,318 INFO L168 Benchmark]: Boogie Preprocessor took 20.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 00:13:29,319 INFO L168 Benchmark]: RCFGBuilder took 359.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2018-12-02 00:13:29,319 INFO L168 Benchmark]: TraceAbstraction took 98462.08 ms. Allocated memory was 1.2 GB in the beginning and 7.8 GB in the end (delta: 6.6 GB). Free memory was 1.1 GB in the beginning and 5.6 GB in the end (delta: -4.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2018-12-02 00:13:29,319 INFO L168 Benchmark]: Witness Printer took 79.49 ms. Allocated memory is still 7.8 GB. Free memory was 5.6 GB in the beginning and 5.5 GB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. [2018-12-02 00:13:29,320 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 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 385.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -159.9 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.73 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.80 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 359.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 98462.08 ms. Allocated memory was 1.2 GB in the beginning and 7.8 GB in the end (delta: 6.6 GB). Free memory was 1.1 GB in the beginning and 5.6 GB in the end (delta: -4.5 GB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 79.49 ms. Allocated memory is still 7.8 GB. Free memory was 5.6 GB in the beginning and 5.5 GB in the end (delta: 29.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L676] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L678] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L680] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L692] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L693] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L694] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L695] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L696] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] -1 pthread_t t1024; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L797] FCALL, FORK -1 pthread_create(&t1024, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L798] -1 pthread_t t1025; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] FCALL, FORK -1 pthread_create(&t1025, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L800] -1 pthread_t t1026; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] FCALL, FORK -1 pthread_create(&t1026, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L753] 0 y$w_buff1 = y$w_buff0 [L754] 0 y$w_buff0 = 1 [L755] 0 y$w_buff1_used = y$w_buff0_used [L756] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L758] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L759] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L760] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L761] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L762] 0 y$r_buff0_thd3 = (_Bool)1 [L765] 0 z = 1 [L768] 0 __unbuffered_p2_EAX = z [L771] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 x = 1 [L718] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 2 x = 2 [L728] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L729] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L730] 2 y$flush_delayed = weak$$choice2 [L731] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L775] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L776] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L776] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L733] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L734] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L735] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L736] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L778] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L781] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L738] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 2 y = y$flush_delayed ? y$mem_tmp : y [L741] 2 y$flush_delayed = (_Bool)0 [L746] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L808] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L811] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L814] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 219 locations, 3 error locations. UNSAFE Result, 98.3s OverallTime, 24 OverallIterations, 1 TraceHistogramMax, 28.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6756 SDtfs, 8928 SDslu, 18793 SDs, 0 SdLazy, 6400 SolverSat, 340 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 249 GetRequests, 65 SyntacticMatches, 12 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=273285occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 46.0s AutomataMinimizationTime, 23 MinimizatonAttempts, 591604 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1891 NumberOfCodeBlocks, 1891 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1775 ConstructedInterpolants, 0 QuantifiedInterpolants, 380531 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...