./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_pso.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_452a0ca8-cae5-4dda-94e6-5e6875262b63/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_452a0ca8-cae5-4dda-94e6-5e6875262b63/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_452a0ca8-cae5-4dda-94e6-5e6875262b63/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_452a0ca8-cae5-4dda-94e6-5e6875262b63/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_452a0ca8-cae5-4dda-94e6-5e6875262b63/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_452a0ca8-cae5-4dda-94e6-5e6875262b63/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 e84bbdadc7e5b9506e2c67e25e33e2b364f2ccbd ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-09 04:49:43,585 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 04:49:43,586 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 04:49:43,592 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 04:49:43,593 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 04:49:43,593 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 04:49:43,594 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 04:49:43,595 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 04:49:43,595 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 04:49:43,596 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 04:49:43,596 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 04:49:43,597 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 04:49:43,597 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 04:49:43,598 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 04:49:43,598 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 04:49:43,598 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 04:49:43,599 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 04:49:43,600 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 04:49:43,601 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 04:49:43,601 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 04:49:43,602 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 04:49:43,603 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 04:49:43,604 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 04:49:43,604 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 04:49:43,604 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 04:49:43,604 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 04:49:43,605 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 04:49:43,605 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 04:49:43,606 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 04:49:43,606 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 04:49:43,607 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 04:49:43,607 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 04:49:43,607 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 04:49:43,607 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 04:49:43,608 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 04:49:43,608 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 04:49:43,608 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_452a0ca8-cae5-4dda-94e6-5e6875262b63/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 04:49:43,616 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 04:49:43,616 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 04:49:43,616 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 04:49:43,616 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 04:49:43,617 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 04:49:43,617 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 04:49:43,617 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 04:49:43,617 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 04:49:43,617 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 04:49:43,617 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 04:49:43,617 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 04:49:43,617 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 04:49:43,618 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 04:49:43,618 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 04:49:43,618 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 04:49:43,618 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 04:49:43,618 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 04:49:43,618 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 04:49:43,619 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 04:49:43,619 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 04:49:43,619 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 04:49:43,619 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 04:49:43,619 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 04:49:43,619 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 04:49:43,619 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 04:49:43,620 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 04:49:43,620 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 04:49:43,620 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 04:49:43,620 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 04:49:43,620 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 04:49:43,620 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 04:49:43,620 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 04:49:43,620 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 04:49:43,621 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 04:49:43,621 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 04:49:43,621 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 04:49:43,621 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_452a0ca8-cae5-4dda-94e6-5e6875262b63/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 -> e84bbdadc7e5b9506e2c67e25e33e2b364f2ccbd [2018-12-09 04:49:43,638 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 04:49:43,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 04:49:43,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 04:49:43,648 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 04:49:43,648 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 04:49:43,648 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_452a0ca8-cae5-4dda-94e6-5e6875262b63/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi003_pso.opt_false-unreach-call.i [2018-12-09 04:49:43,685 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_452a0ca8-cae5-4dda-94e6-5e6875262b63/bin-2019/utaipan/data/94d026943/ec3f5d0e939345c8bd41ec09decaa5ec/FLAGf34ed92a9 [2018-12-09 04:49:44,179 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 04:49:44,179 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_452a0ca8-cae5-4dda-94e6-5e6875262b63/sv-benchmarks/c/pthread-wmm/rfi003_pso.opt_false-unreach-call.i [2018-12-09 04:49:44,186 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_452a0ca8-cae5-4dda-94e6-5e6875262b63/bin-2019/utaipan/data/94d026943/ec3f5d0e939345c8bd41ec09decaa5ec/FLAGf34ed92a9 [2018-12-09 04:49:44,194 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_452a0ca8-cae5-4dda-94e6-5e6875262b63/bin-2019/utaipan/data/94d026943/ec3f5d0e939345c8bd41ec09decaa5ec [2018-12-09 04:49:44,196 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 04:49:44,197 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 04:49:44,197 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 04:49:44,197 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 04:49:44,199 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 04:49:44,200 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:49:44" (1/1) ... [2018-12-09 04:49:44,201 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ca176b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:44, skipping insertion in model container [2018-12-09 04:49:44,201 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:49:44" (1/1) ... [2018-12-09 04:49:44,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 04:49:44,225 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 04:49:44,401 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:49:44,409 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 04:49:44,499 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:49:44,535 INFO L195 MainTranslator]: Completed translation [2018-12-09 04:49:44,536 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:44 WrapperNode [2018-12-09 04:49:44,536 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 04:49:44,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 04:49:44,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 04:49:44,536 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 04:49:44,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:44" (1/1) ... [2018-12-09 04:49:44,555 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:44" (1/1) ... [2018-12-09 04:49:44,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 04:49:44,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 04:49:44,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 04:49:44,575 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 04:49:44,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:44" (1/1) ... [2018-12-09 04:49:44,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:44" (1/1) ... [2018-12-09 04:49:44,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:44" (1/1) ... [2018-12-09 04:49:44,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:44" (1/1) ... [2018-12-09 04:49:44,592 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:44" (1/1) ... [2018-12-09 04:49:44,595 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:44" (1/1) ... [2018-12-09 04:49:44,597 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:44" (1/1) ... [2018-12-09 04:49:44,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 04:49:44,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 04:49:44,601 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 04:49:44,601 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 04:49:44,602 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:44" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_452a0ca8-cae5-4dda-94e6-5e6875262b63/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-09 04:49:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 04:49:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 04:49:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 04:49:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 04:49:44,635 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 04:49:44,635 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 04:49:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 04:49:44,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 04:49:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 04:49:44,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 04:49:44,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 04:49:44,637 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 04:49:44,943 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 04:49:44,943 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 04:49:44,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:49:44 BoogieIcfgContainer [2018-12-09 04:49:44,943 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 04:49:44,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 04:49:44,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 04:49:44,946 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 04:49:44,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 04:49:44" (1/3) ... [2018-12-09 04:49:44,946 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473d043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:49:44, skipping insertion in model container [2018-12-09 04:49:44,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:49:44" (2/3) ... [2018-12-09 04:49:44,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@473d043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 04:49:44, skipping insertion in model container [2018-12-09 04:49:44,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:49:44" (3/3) ... [2018-12-09 04:49:44,948 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi003_pso.opt_false-unreach-call.i [2018-12-09 04:49:44,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,971 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,971 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,971 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,972 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,973 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,974 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,975 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,976 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,977 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,978 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,979 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,980 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,980 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,980 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,980 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,980 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,980 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,981 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,981 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,982 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,983 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 04:49:44,990 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 04:49:44,990 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 04:49:44,995 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 04:49:45,005 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 04:49:45,021 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 04:49:45,021 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 04:49:45,021 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 04:49:45,021 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 04:49:45,021 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 04:49:45,021 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 04:49:45,021 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 04:49:45,021 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 04:49:45,028 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131places, 163 transitions [2018-12-09 04:49:46,073 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27855 states. [2018-12-09 04:49:46,074 INFO L276 IsEmpty]: Start isEmpty. Operand 27855 states. [2018-12-09 04:49:46,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 04:49:46,080 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:49:46,080 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:49:46,082 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:49:46,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:49:46,086 INFO L82 PathProgramCache]: Analyzing trace with hash 71244223, now seen corresponding path program 1 times [2018-12-09 04:49:46,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:49:46,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:46,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:49:46,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:46,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:49:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:49:46,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:49:46,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:49:46,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:49:46,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:49:46,248 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:49:46,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:49:46,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:49:46,257 INFO L87 Difference]: Start difference. First operand 27855 states. Second operand 4 states. [2018-12-09 04:49:46,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:49:46,581 INFO L93 Difference]: Finished difference Result 47767 states and 183118 transitions. [2018-12-09 04:49:46,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:49:46,582 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2018-12-09 04:49:46,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:49:46,716 INFO L225 Difference]: With dead ends: 47767 [2018-12-09 04:49:46,716 INFO L226 Difference]: Without dead ends: 34607 [2018-12-09 04:49:46,717 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-09 04:49:46,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34607 states. [2018-12-09 04:49:47,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34607 to 21755. [2018-12-09 04:49:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21755 states. [2018-12-09 04:49:47,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21755 states to 21755 states and 83440 transitions. [2018-12-09 04:49:47,386 INFO L78 Accepts]: Start accepts. Automaton has 21755 states and 83440 transitions. Word has length 38 [2018-12-09 04:49:47,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:49:47,387 INFO L480 AbstractCegarLoop]: Abstraction has 21755 states and 83440 transitions. [2018-12-09 04:49:47,387 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:49:47,387 INFO L276 IsEmpty]: Start isEmpty. Operand 21755 states and 83440 transitions. [2018-12-09 04:49:47,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 04:49:47,392 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:49:47,392 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-09 04:49:47,392 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:49:47,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:49:47,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1724990409, now seen corresponding path program 1 times [2018-12-09 04:49:47,392 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:49:47,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:47,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:49:47,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:47,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:49:47,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:49:47,457 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-09 04:49:47,458 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:49:47,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:49:47,458 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:49:47,459 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:49:47,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:49:47,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:49:47,460 INFO L87 Difference]: Start difference. First operand 21755 states and 83440 transitions. Second operand 5 states. [2018-12-09 04:49:47,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:49:47,985 INFO L93 Difference]: Finished difference Result 47633 states and 173801 transitions. [2018-12-09 04:49:47,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:49:47,986 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 04:49:47,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:49:48,078 INFO L225 Difference]: With dead ends: 47633 [2018-12-09 04:49:48,079 INFO L226 Difference]: Without dead ends: 47065 [2018-12-09 04:49:48,079 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-09 04:49:48,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47065 states. [2018-12-09 04:49:48,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47065 to 31795. [2018-12-09 04:49:48,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31795 states. [2018-12-09 04:49:48,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31795 states to 31795 states and 116818 transitions. [2018-12-09 04:49:48,700 INFO L78 Accepts]: Start accepts. Automaton has 31795 states and 116818 transitions. Word has length 46 [2018-12-09 04:49:48,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:49:48,701 INFO L480 AbstractCegarLoop]: Abstraction has 31795 states and 116818 transitions. [2018-12-09 04:49:48,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:49:48,701 INFO L276 IsEmpty]: Start isEmpty. Operand 31795 states and 116818 transitions. [2018-12-09 04:49:48,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 04:49:48,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:49:48,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:49:48,704 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:49:48,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:49:48,704 INFO L82 PathProgramCache]: Analyzing trace with hash -2058408648, now seen corresponding path program 1 times [2018-12-09 04:49:48,704 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:49:48,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:48,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:49:48,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:48,707 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:49:48,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:49:48,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:49:48,753 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:49:48,753 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:49:48,753 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:49:48,753 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:49:48,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:49:48,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:49:48,754 INFO L87 Difference]: Start difference. First operand 31795 states and 116818 transitions. Second operand 5 states. [2018-12-09 04:49:49,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:49:49,098 INFO L93 Difference]: Finished difference Result 63027 states and 229113 transitions. [2018-12-09 04:49:49,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:49:49,098 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 04:49:49,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:49:49,224 INFO L225 Difference]: With dead ends: 63027 [2018-12-09 04:49:49,225 INFO L226 Difference]: Without dead ends: 62563 [2018-12-09 04:49:49,225 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-09 04:49:49,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62563 states. [2018-12-09 04:49:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62563 to 35363. [2018-12-09 04:49:49,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35363 states. [2018-12-09 04:49:50,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35363 states to 35363 states and 128876 transitions. [2018-12-09 04:49:50,029 INFO L78 Accepts]: Start accepts. Automaton has 35363 states and 128876 transitions. Word has length 47 [2018-12-09 04:49:50,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:49:50,029 INFO L480 AbstractCegarLoop]: Abstraction has 35363 states and 128876 transitions. [2018-12-09 04:49:50,029 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:49:50,029 INFO L276 IsEmpty]: Start isEmpty. Operand 35363 states and 128876 transitions. [2018-12-09 04:49:50,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 04:49:50,033 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:49:50,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:49:50,033 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:49:50,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:49:50,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1703022802, now seen corresponding path program 1 times [2018-12-09 04:49:50,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:49:50,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:50,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:49:50,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:50,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:49:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:49:50,068 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-09 04:49:50,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:49:50,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:49:50,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:49:50,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:49:50,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:49:50,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:49:50,069 INFO L87 Difference]: Start difference. First operand 35363 states and 128876 transitions. Second operand 3 states. [2018-12-09 04:49:50,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:49:50,218 INFO L93 Difference]: Finished difference Result 45909 states and 163944 transitions. [2018-12-09 04:49:50,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:49:50,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-09 04:49:50,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:49:50,301 INFO L225 Difference]: With dead ends: 45909 [2018-12-09 04:49:50,301 INFO L226 Difference]: Without dead ends: 45909 [2018-12-09 04:49:50,301 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-09 04:49:50,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45909 states. [2018-12-09 04:49:50,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45909 to 40246. [2018-12-09 04:49:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40246 states. [2018-12-09 04:49:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40246 states to 40246 states and 145214 transitions. [2018-12-09 04:49:50,998 INFO L78 Accepts]: Start accepts. Automaton has 40246 states and 145214 transitions. Word has length 49 [2018-12-09 04:49:50,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:49:50,998 INFO L480 AbstractCegarLoop]: Abstraction has 40246 states and 145214 transitions. [2018-12-09 04:49:50,998 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:49:50,999 INFO L276 IsEmpty]: Start isEmpty. Operand 40246 states and 145214 transitions. [2018-12-09 04:49:51,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 04:49:51,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:49:51,005 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:49:51,005 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:49:51,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:49:51,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1764675695, now seen corresponding path program 1 times [2018-12-09 04:49:51,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:49:51,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:51,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:49:51,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:51,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:49:51,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:49:51,061 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-09 04:49:51,061 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:49:51,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:49:51,061 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:49:51,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:49:51,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:49:51,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:49:51,062 INFO L87 Difference]: Start difference. First operand 40246 states and 145214 transitions. Second operand 6 states. [2018-12-09 04:49:51,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:49:51,499 INFO L93 Difference]: Finished difference Result 70849 states and 252354 transitions. [2018-12-09 04:49:51,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 04:49:51,499 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 04:49:51,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:49:51,615 INFO L225 Difference]: With dead ends: 70849 [2018-12-09 04:49:51,615 INFO L226 Difference]: Without dead ends: 70313 [2018-12-09 04:49:51,615 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-09 04:49:51,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70313 states. [2018-12-09 04:49:52,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70313 to 40897. [2018-12-09 04:49:52,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40897 states. [2018-12-09 04:49:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40897 states to 40897 states and 147667 transitions. [2018-12-09 04:49:52,346 INFO L78 Accepts]: Start accepts. Automaton has 40897 states and 147667 transitions. Word has length 53 [2018-12-09 04:49:52,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:49:52,346 INFO L480 AbstractCegarLoop]: Abstraction has 40897 states and 147667 transitions. [2018-12-09 04:49:52,346 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:49:52,346 INFO L276 IsEmpty]: Start isEmpty. Operand 40897 states and 147667 transitions. [2018-12-09 04:49:52,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 04:49:52,353 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:49:52,353 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:49:52,353 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:49:52,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:49:52,353 INFO L82 PathProgramCache]: Analyzing trace with hash -2096426106, now seen corresponding path program 1 times [2018-12-09 04:49:52,353 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:49:52,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:52,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:49:52,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:52,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:49:52,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:49:52,421 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-09 04:49:52,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:49:52,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:49:52,422 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:49:52,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:49:52,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:49:52,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:49:52,422 INFO L87 Difference]: Start difference. First operand 40897 states and 147667 transitions. Second operand 6 states. [2018-12-09 04:49:52,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:49:52,963 INFO L93 Difference]: Finished difference Result 56598 states and 201647 transitions. [2018-12-09 04:49:52,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:49:52,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 04:49:52,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:49:53,054 INFO L225 Difference]: With dead ends: 56598 [2018-12-09 04:49:53,054 INFO L226 Difference]: Without dead ends: 55459 [2018-12-09 04:49:53,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:49:53,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55459 states. [2018-12-09 04:49:53,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55459 to 51954. [2018-12-09 04:49:53,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51954 states. [2018-12-09 04:49:53,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51954 states to 51954 states and 186006 transitions. [2018-12-09 04:49:53,813 INFO L78 Accepts]: Start accepts. Automaton has 51954 states and 186006 transitions. Word has length 53 [2018-12-09 04:49:53,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:49:53,814 INFO L480 AbstractCegarLoop]: Abstraction has 51954 states and 186006 transitions. [2018-12-09 04:49:53,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:49:53,814 INFO L276 IsEmpty]: Start isEmpty. Operand 51954 states and 186006 transitions. [2018-12-09 04:49:53,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 04:49:53,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:49:53,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:49:53,823 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:49:53,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:49:53,823 INFO L82 PathProgramCache]: Analyzing trace with hash 401589831, now seen corresponding path program 1 times [2018-12-09 04:49:53,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:49:53,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:53,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:49:53,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:53,825 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:49:53,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:49:53,890 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-09 04:49:53,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:49:53,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:49:53,891 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:49:53,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:49:53,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:49:53,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:49:53,892 INFO L87 Difference]: Start difference. First operand 51954 states and 186006 transitions. Second operand 7 states. [2018-12-09 04:49:54,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:49:54,521 INFO L93 Difference]: Finished difference Result 75637 states and 260103 transitions. [2018-12-09 04:49:54,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 04:49:54,522 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-09 04:49:54,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:49:54,752 INFO L225 Difference]: With dead ends: 75637 [2018-12-09 04:49:54,753 INFO L226 Difference]: Without dead ends: 75637 [2018-12-09 04:49:54,753 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 04:49:54,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75637 states. [2018-12-09 04:49:55,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75637 to 61472. [2018-12-09 04:49:55,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61472 states. [2018-12-09 04:49:55,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61472 states to 61472 states and 215183 transitions. [2018-12-09 04:49:55,609 INFO L78 Accepts]: Start accepts. Automaton has 61472 states and 215183 transitions. Word has length 53 [2018-12-09 04:49:55,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:49:55,610 INFO L480 AbstractCegarLoop]: Abstraction has 61472 states and 215183 transitions. [2018-12-09 04:49:55,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:49:55,610 INFO L276 IsEmpty]: Start isEmpty. Operand 61472 states and 215183 transitions. [2018-12-09 04:49:55,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 04:49:55,618 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:49:55,619 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:49:55,619 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:49:55,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:49:55,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1289093512, now seen corresponding path program 1 times [2018-12-09 04:49:55,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:49:55,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:55,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:49:55,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:55,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:49:55,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:49:55,654 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-09 04:49:55,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:49:55,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:49:55,654 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:49:55,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:49:55,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:49:55,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:49:55,655 INFO L87 Difference]: Start difference. First operand 61472 states and 215183 transitions. Second operand 4 states. [2018-12-09 04:49:55,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:49:55,702 INFO L93 Difference]: Finished difference Result 13777 states and 43273 transitions. [2018-12-09 04:49:55,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:49:55,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-09 04:49:55,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:49:55,715 INFO L225 Difference]: With dead ends: 13777 [2018-12-09 04:49:55,715 INFO L226 Difference]: Without dead ends: 12160 [2018-12-09 04:49:55,716 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-09 04:49:55,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12160 states. [2018-12-09 04:49:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12160 to 12112. [2018-12-09 04:49:55,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12112 states. [2018-12-09 04:49:55,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12112 states to 12112 states and 37957 transitions. [2018-12-09 04:49:55,829 INFO L78 Accepts]: Start accepts. Automaton has 12112 states and 37957 transitions. Word has length 53 [2018-12-09 04:49:55,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:49:55,830 INFO L480 AbstractCegarLoop]: Abstraction has 12112 states and 37957 transitions. [2018-12-09 04:49:55,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:49:55,830 INFO L276 IsEmpty]: Start isEmpty. Operand 12112 states and 37957 transitions. [2018-12-09 04:49:55,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 04:49:55,833 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:49:55,833 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] [2018-12-09 04:49:55,833 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:49:55,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:49:55,833 INFO L82 PathProgramCache]: Analyzing trace with hash 942323206, now seen corresponding path program 1 times [2018-12-09 04:49:55,833 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:49:55,834 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:55,835 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:49:55,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:55,835 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:49:55,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:49:55,880 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-09 04:49:55,881 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:49:55,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:49:55,881 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:49:55,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:49:55,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:49:55,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:49:55,881 INFO L87 Difference]: Start difference. First operand 12112 states and 37957 transitions. Second operand 4 states. [2018-12-09 04:49:55,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:49:55,983 INFO L93 Difference]: Finished difference Result 14275 states and 44580 transitions. [2018-12-09 04:49:55,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:49:55,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-09 04:49:55,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:49:55,999 INFO L225 Difference]: With dead ends: 14275 [2018-12-09 04:49:55,999 INFO L226 Difference]: Without dead ends: 14275 [2018-12-09 04:49:55,999 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-09 04:49:56,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14275 states. [2018-12-09 04:49:56,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14275 to 12843. [2018-12-09 04:49:56,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12843 states. [2018-12-09 04:49:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12843 states to 12843 states and 40182 transitions. [2018-12-09 04:49:56,132 INFO L78 Accepts]: Start accepts. Automaton has 12843 states and 40182 transitions. Word has length 63 [2018-12-09 04:49:56,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:49:56,132 INFO L480 AbstractCegarLoop]: Abstraction has 12843 states and 40182 transitions. [2018-12-09 04:49:56,132 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:49:56,133 INFO L276 IsEmpty]: Start isEmpty. Operand 12843 states and 40182 transitions. [2018-12-09 04:49:56,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 04:49:56,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:49:56,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:49:56,137 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:49:56,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:49:56,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1609833755, now seen corresponding path program 1 times [2018-12-09 04:49:56,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:49:56,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:56,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:49:56,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:56,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:49:56,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:49:56,171 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-09 04:49:56,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:49:56,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:49:56,172 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:49:56,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:49:56,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:49:56,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:49:56,172 INFO L87 Difference]: Start difference. First operand 12843 states and 40182 transitions. Second operand 6 states. [2018-12-09 04:49:56,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:49:56,472 INFO L93 Difference]: Finished difference Result 23410 states and 72791 transitions. [2018-12-09 04:49:56,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 04:49:56,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-09 04:49:56,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:49:56,496 INFO L225 Difference]: With dead ends: 23410 [2018-12-09 04:49:56,496 INFO L226 Difference]: Without dead ends: 23346 [2018-12-09 04:49:56,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 04:49:56,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23346 states. [2018-12-09 04:49:56,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23346 to 13812. [2018-12-09 04:49:56,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13812 states. [2018-12-09 04:49:56,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13812 states to 13812 states and 42966 transitions. [2018-12-09 04:49:56,722 INFO L78 Accepts]: Start accepts. Automaton has 13812 states and 42966 transitions. Word has length 63 [2018-12-09 04:49:56,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:49:56,723 INFO L480 AbstractCegarLoop]: Abstraction has 13812 states and 42966 transitions. [2018-12-09 04:49:56,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:49:56,723 INFO L276 IsEmpty]: Start isEmpty. Operand 13812 states and 42966 transitions. [2018-12-09 04:49:56,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 04:49:56,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:49:56,729 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] [2018-12-09 04:49:56,730 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:49:56,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:49:56,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1160555304, now seen corresponding path program 1 times [2018-12-09 04:49:56,730 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:49:56,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:56,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:49:56,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:56,731 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:49:56,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:49:56,761 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-09 04:49:56,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:49:56,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:49:56,761 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:49:56,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:49:56,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:49:56,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:49:56,762 INFO L87 Difference]: Start difference. First operand 13812 states and 42966 transitions. Second operand 4 states. [2018-12-09 04:49:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:49:56,912 INFO L93 Difference]: Finished difference Result 17359 states and 53255 transitions. [2018-12-09 04:49:56,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 04:49:56,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 04:49:56,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:49:56,929 INFO L225 Difference]: With dead ends: 17359 [2018-12-09 04:49:56,930 INFO L226 Difference]: Without dead ends: 17359 [2018-12-09 04:49:56,930 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-09 04:49:56,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17359 states. [2018-12-09 04:49:57,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17359 to 15783. [2018-12-09 04:49:57,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15783 states. [2018-12-09 04:49:57,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15783 states to 15783 states and 48578 transitions. [2018-12-09 04:49:57,100 INFO L78 Accepts]: Start accepts. Automaton has 15783 states and 48578 transitions. Word has length 65 [2018-12-09 04:49:57,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:49:57,100 INFO L480 AbstractCegarLoop]: Abstraction has 15783 states and 48578 transitions. [2018-12-09 04:49:57,100 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:49:57,100 INFO L276 IsEmpty]: Start isEmpty. Operand 15783 states and 48578 transitions. [2018-12-09 04:49:57,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 04:49:57,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:49:57,106 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] [2018-12-09 04:49:57,107 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:49:57,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:49:57,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1057202649, now seen corresponding path program 1 times [2018-12-09 04:49:57,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:49:57,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:57,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:49:57,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:57,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:49:57,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:49:57,124 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-09 04:49:57,125 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:49:57,125 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 04:49:57,125 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:49:57,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 04:49:57,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 04:49:57,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 04:49:57,125 INFO L87 Difference]: Start difference. First operand 15783 states and 48578 transitions. Second operand 3 states. [2018-12-09 04:49:57,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:49:57,250 INFO L93 Difference]: Finished difference Result 16413 states and 50318 transitions. [2018-12-09 04:49:57,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 04:49:57,250 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-09 04:49:57,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:49:57,267 INFO L225 Difference]: With dead ends: 16413 [2018-12-09 04:49:57,268 INFO L226 Difference]: Without dead ends: 16413 [2018-12-09 04:49:57,268 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-09 04:49:57,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16413 states. [2018-12-09 04:49:57,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16413 to 16125. [2018-12-09 04:49:57,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16125 states. [2018-12-09 04:49:57,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 49516 transitions. [2018-12-09 04:49:57,427 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 49516 transitions. Word has length 65 [2018-12-09 04:49:57,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:49:57,427 INFO L480 AbstractCegarLoop]: Abstraction has 16125 states and 49516 transitions. [2018-12-09 04:49:57,427 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 04:49:57,427 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 49516 transitions. [2018-12-09 04:49:57,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 04:49:57,435 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:49:57,435 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:49:57,435 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:49:57,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:49:57,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1484400773, now seen corresponding path program 1 times [2018-12-09 04:49:57,436 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:49:57,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:57,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:49:57,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:57,437 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:49:57,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:49:57,475 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-09 04:49:57,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:49:57,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:49:57,475 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:49:57,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:49:57,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:49:57,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:49:57,475 INFO L87 Difference]: Start difference. First operand 16125 states and 49516 transitions. Second operand 6 states. [2018-12-09 04:49:57,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:49:57,853 INFO L93 Difference]: Finished difference Result 19568 states and 59304 transitions. [2018-12-09 04:49:57,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:49:57,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 04:49:57,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:49:57,872 INFO L225 Difference]: With dead ends: 19568 [2018-12-09 04:49:57,873 INFO L226 Difference]: Without dead ends: 19568 [2018-12-09 04:49:57,873 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-09 04:49:57,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19568 states. [2018-12-09 04:49:58,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19568 to 18524. [2018-12-09 04:49:58,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18524 states. [2018-12-09 04:49:58,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18524 states to 18524 states and 56466 transitions. [2018-12-09 04:49:58,056 INFO L78 Accepts]: Start accepts. Automaton has 18524 states and 56466 transitions. Word has length 67 [2018-12-09 04:49:58,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:49:58,056 INFO L480 AbstractCegarLoop]: Abstraction has 18524 states and 56466 transitions. [2018-12-09 04:49:58,056 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:49:58,057 INFO L276 IsEmpty]: Start isEmpty. Operand 18524 states and 56466 transitions. [2018-12-09 04:49:58,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 04:49:58,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:49:58,066 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:49:58,066 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:49:58,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:49:58,066 INFO L82 PathProgramCache]: Analyzing trace with hash -592808570, now seen corresponding path program 1 times [2018-12-09 04:49:58,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:49:58,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:58,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:49:58,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:58,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:49:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:49:58,151 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-09 04:49:58,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:49:58,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:49:58,152 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:49:58,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:49:58,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:49:58,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:49:58,152 INFO L87 Difference]: Start difference. First operand 18524 states and 56466 transitions. Second operand 6 states. [2018-12-09 04:49:58,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:49:58,367 INFO L93 Difference]: Finished difference Result 21666 states and 64013 transitions. [2018-12-09 04:49:58,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 04:49:58,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 04:49:58,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:49:58,389 INFO L225 Difference]: With dead ends: 21666 [2018-12-09 04:49:58,389 INFO L226 Difference]: Without dead ends: 21666 [2018-12-09 04:49:58,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:49:58,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21666 states. [2018-12-09 04:49:58,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21666 to 18841. [2018-12-09 04:49:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18841 states. [2018-12-09 04:49:58,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18841 states to 18841 states and 56340 transitions. [2018-12-09 04:49:58,573 INFO L78 Accepts]: Start accepts. Automaton has 18841 states and 56340 transitions. Word has length 67 [2018-12-09 04:49:58,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:49:58,573 INFO L480 AbstractCegarLoop]: Abstraction has 18841 states and 56340 transitions. [2018-12-09 04:49:58,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:49:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 18841 states and 56340 transitions. [2018-12-09 04:49:58,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 04:49:58,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:49:58,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:49:58,581 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:49:58,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:49:58,581 INFO L82 PathProgramCache]: Analyzing trace with hash -381457657, now seen corresponding path program 1 times [2018-12-09 04:49:58,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:49:58,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:58,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:49:58,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:58,582 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:49:58,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:49:58,620 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-09 04:49:58,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:49:58,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:49:58,620 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:49:58,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:49:58,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:49:58,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:49:58,621 INFO L87 Difference]: Start difference. First operand 18841 states and 56340 transitions. Second operand 5 states. [2018-12-09 04:49:58,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:49:58,828 INFO L93 Difference]: Finished difference Result 23854 states and 70897 transitions. [2018-12-09 04:49:58,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:49:58,828 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 04:49:58,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:49:58,853 INFO L225 Difference]: With dead ends: 23854 [2018-12-09 04:49:58,854 INFO L226 Difference]: Without dead ends: 23854 [2018-12-09 04:49:58,854 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:49:58,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23854 states. [2018-12-09 04:49:59,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23854 to 20164. [2018-12-09 04:49:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20164 states. [2018-12-09 04:49:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20164 states to 20164 states and 59821 transitions. [2018-12-09 04:49:59,059 INFO L78 Accepts]: Start accepts. Automaton has 20164 states and 59821 transitions. Word has length 67 [2018-12-09 04:49:59,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:49:59,059 INFO L480 AbstractCegarLoop]: Abstraction has 20164 states and 59821 transitions. [2018-12-09 04:49:59,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:49:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 20164 states and 59821 transitions. [2018-12-09 04:49:59,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 04:49:59,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:49:59,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, 1, 1, 1, 1, 1] [2018-12-09 04:49:59,068 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:49:59,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:49:59,068 INFO L82 PathProgramCache]: Analyzing trace with hash -891991834, now seen corresponding path program 1 times [2018-12-09 04:49:59,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:49:59,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:59,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:49:59,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:59,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:49:59,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:49:59,109 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-09 04:49:59,110 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:49:59,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:49:59,110 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:49:59,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:49:59,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:49:59,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:49:59,110 INFO L87 Difference]: Start difference. First operand 20164 states and 59821 transitions. Second operand 5 states. [2018-12-09 04:49:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:49:59,357 INFO L93 Difference]: Finished difference Result 27231 states and 80368 transitions. [2018-12-09 04:49:59,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:49:59,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 04:49:59,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:49:59,385 INFO L225 Difference]: With dead ends: 27231 [2018-12-09 04:49:59,385 INFO L226 Difference]: Without dead ends: 27231 [2018-12-09 04:49:59,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:49:59,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27231 states. [2018-12-09 04:49:59,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27231 to 21349. [2018-12-09 04:49:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21349 states. [2018-12-09 04:49:59,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21349 states to 21349 states and 63327 transitions. [2018-12-09 04:49:59,673 INFO L78 Accepts]: Start accepts. Automaton has 21349 states and 63327 transitions. Word has length 67 [2018-12-09 04:49:59,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:49:59,673 INFO L480 AbstractCegarLoop]: Abstraction has 21349 states and 63327 transitions. [2018-12-09 04:49:59,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:49:59,674 INFO L276 IsEmpty]: Start isEmpty. Operand 21349 states and 63327 transitions. [2018-12-09 04:49:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 04:49:59,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:49:59,681 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:49:59,681 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:49:59,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:49:59,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1595520999, now seen corresponding path program 1 times [2018-12-09 04:49:59,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:49:59,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:59,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:49:59,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:49:59,683 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:49:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:49:59,716 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-09 04:49:59,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:49:59,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 04:49:59,716 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:49:59,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 04:49:59,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 04:49:59,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 04:49:59,717 INFO L87 Difference]: Start difference. First operand 21349 states and 63327 transitions. Second operand 4 states. [2018-12-09 04:50:00,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:50:00,011 INFO L93 Difference]: Finished difference Result 28445 states and 84501 transitions. [2018-12-09 04:50:00,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 04:50:00,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-09 04:50:00,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:50:00,040 INFO L225 Difference]: With dead ends: 28445 [2018-12-09 04:50:00,040 INFO L226 Difference]: Without dead ends: 28025 [2018-12-09 04:50:00,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:50:00,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28025 states. [2018-12-09 04:50:00,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28025 to 25833. [2018-12-09 04:50:00,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25833 states. [2018-12-09 04:50:00,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25833 states to 25833 states and 76849 transitions. [2018-12-09 04:50:00,322 INFO L78 Accepts]: Start accepts. Automaton has 25833 states and 76849 transitions. Word has length 67 [2018-12-09 04:50:00,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:50:00,322 INFO L480 AbstractCegarLoop]: Abstraction has 25833 states and 76849 transitions. [2018-12-09 04:50:00,322 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 04:50:00,322 INFO L276 IsEmpty]: Start isEmpty. Operand 25833 states and 76849 transitions. [2018-12-09 04:50:00,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 04:50:00,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:50:00,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:50:00,334 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:50:00,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:50:00,334 INFO L82 PathProgramCache]: Analyzing trace with hash -201430360, now seen corresponding path program 1 times [2018-12-09 04:50:00,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:50:00,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:00,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:50:00,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:00,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:50:00,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:50:00,367 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-09 04:50:00,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:50:00,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:50:00,368 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:50:00,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:50:00,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:50:00,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:50:00,368 INFO L87 Difference]: Start difference. First operand 25833 states and 76849 transitions. Second operand 5 states. [2018-12-09 04:50:00,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:50:00,395 INFO L93 Difference]: Finished difference Result 7049 states and 16989 transitions. [2018-12-09 04:50:00,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:50:00,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 04:50:00,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:50:00,399 INFO L225 Difference]: With dead ends: 7049 [2018-12-09 04:50:00,399 INFO L226 Difference]: Without dead ends: 5562 [2018-12-09 04:50:00,399 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-09 04:50:00,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5562 states. [2018-12-09 04:50:00,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5562 to 4888. [2018-12-09 04:50:00,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2018-12-09 04:50:00,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 11541 transitions. [2018-12-09 04:50:00,432 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 11541 transitions. Word has length 67 [2018-12-09 04:50:00,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:50:00,432 INFO L480 AbstractCegarLoop]: Abstraction has 4888 states and 11541 transitions. [2018-12-09 04:50:00,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:50:00,432 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 11541 transitions. [2018-12-09 04:50:00,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 04:50:00,436 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:50:00,436 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:50:00,436 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:50:00,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:50:00,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1632761670, now seen corresponding path program 1 times [2018-12-09 04:50:00,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:50:00,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:00,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:50:00,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:00,438 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:50:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:50:00,490 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-09 04:50:00,490 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:50:00,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 04:50:00,490 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:50:00,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 04:50:00,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 04:50:00,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 04:50:00,491 INFO L87 Difference]: Start difference. First operand 4888 states and 11541 transitions. Second operand 5 states. [2018-12-09 04:50:00,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:50:00,625 INFO L93 Difference]: Finished difference Result 5732 states and 13375 transitions. [2018-12-09 04:50:00,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:50:00,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2018-12-09 04:50:00,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:50:00,628 INFO L225 Difference]: With dead ends: 5732 [2018-12-09 04:50:00,629 INFO L226 Difference]: Without dead ends: 5698 [2018-12-09 04:50:00,629 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:50:00,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5698 states. [2018-12-09 04:50:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5698 to 5046. [2018-12-09 04:50:00,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5046 states. [2018-12-09 04:50:00,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5046 states to 5046 states and 11853 transitions. [2018-12-09 04:50:00,663 INFO L78 Accepts]: Start accepts. Automaton has 5046 states and 11853 transitions. Word has length 82 [2018-12-09 04:50:00,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:50:00,664 INFO L480 AbstractCegarLoop]: Abstraction has 5046 states and 11853 transitions. [2018-12-09 04:50:00,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 04:50:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 5046 states and 11853 transitions. [2018-12-09 04:50:00,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 04:50:00,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:50:00,667 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:50:00,667 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:50:00,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:50:00,667 INFO L82 PathProgramCache]: Analyzing trace with hash -35293979, now seen corresponding path program 1 times [2018-12-09 04:50:00,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:50:00,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:00,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:50:00,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:00,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:50:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:50:00,719 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-09 04:50:00,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:50:00,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:50:00,720 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:50:00,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:50:00,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:50:00,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:50:00,720 INFO L87 Difference]: Start difference. First operand 5046 states and 11853 transitions. Second operand 6 states. [2018-12-09 04:50:00,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:50:00,879 INFO L93 Difference]: Finished difference Result 6708 states and 15748 transitions. [2018-12-09 04:50:00,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:50:00,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-09 04:50:00,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:50:00,883 INFO L225 Difference]: With dead ends: 6708 [2018-12-09 04:50:00,883 INFO L226 Difference]: Without dead ends: 6676 [2018-12-09 04:50:00,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:50:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6676 states. [2018-12-09 04:50:00,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6676 to 5404. [2018-12-09 04:50:00,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5404 states. [2018-12-09 04:50:00,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5404 states to 5404 states and 12732 transitions. [2018-12-09 04:50:00,924 INFO L78 Accepts]: Start accepts. Automaton has 5404 states and 12732 transitions. Word has length 82 [2018-12-09 04:50:00,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:50:00,925 INFO L480 AbstractCegarLoop]: Abstraction has 5404 states and 12732 transitions. [2018-12-09 04:50:00,925 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:50:00,925 INFO L276 IsEmpty]: Start isEmpty. Operand 5404 states and 12732 transitions. [2018-12-09 04:50:00,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 04:50:00,928 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:50:00,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:50:00,928 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:50:00,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:50:00,928 INFO L82 PathProgramCache]: Analyzing trace with hash -1832245338, now seen corresponding path program 1 times [2018-12-09 04:50:00,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:50:00,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:00,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:50:00,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:00,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:50:00,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:50:00,975 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-09 04:50:00,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:50:00,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:50:00,976 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:50:00,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:50:00,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:50:00,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:50:00,976 INFO L87 Difference]: Start difference. First operand 5404 states and 12732 transitions. Second operand 7 states. [2018-12-09 04:50:01,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:50:01,202 INFO L93 Difference]: Finished difference Result 8734 states and 21012 transitions. [2018-12-09 04:50:01,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 04:50:01,202 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-09 04:50:01,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:50:01,208 INFO L225 Difference]: With dead ends: 8734 [2018-12-09 04:50:01,208 INFO L226 Difference]: Without dead ends: 8734 [2018-12-09 04:50:01,208 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-09 04:50:01,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8734 states. [2018-12-09 04:50:01,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8734 to 6145. [2018-12-09 04:50:01,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6145 states. [2018-12-09 04:50:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6145 states to 6145 states and 14616 transitions. [2018-12-09 04:50:01,262 INFO L78 Accepts]: Start accepts. Automaton has 6145 states and 14616 transitions. Word has length 82 [2018-12-09 04:50:01,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:50:01,262 INFO L480 AbstractCegarLoop]: Abstraction has 6145 states and 14616 transitions. [2018-12-09 04:50:01,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:50:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 6145 states and 14616 transitions. [2018-12-09 04:50:01,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 04:50:01,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:50:01,266 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:50:01,266 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:50:01,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:50:01,266 INFO L82 PathProgramCache]: Analyzing trace with hash -944741657, now seen corresponding path program 1 times [2018-12-09 04:50:01,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:50:01,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:01,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:50:01,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:01,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:50:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:50:01,322 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-09 04:50:01,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:50:01,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:50:01,323 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:50:01,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:50:01,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:50:01,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:50:01,323 INFO L87 Difference]: Start difference. First operand 6145 states and 14616 transitions. Second operand 6 states. [2018-12-09 04:50:01,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:50:01,360 INFO L93 Difference]: Finished difference Result 7313 states and 17387 transitions. [2018-12-09 04:50:01,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:50:01,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-09 04:50:01,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:50:01,366 INFO L225 Difference]: With dead ends: 7313 [2018-12-09 04:50:01,366 INFO L226 Difference]: Without dead ends: 7313 [2018-12-09 04:50:01,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:50:01,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7313 states. [2018-12-09 04:50:01,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7313 to 5480. [2018-12-09 04:50:01,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5480 states. [2018-12-09 04:50:01,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5480 states to 5480 states and 12892 transitions. [2018-12-09 04:50:01,410 INFO L78 Accepts]: Start accepts. Automaton has 5480 states and 12892 transitions. Word has length 82 [2018-12-09 04:50:01,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:50:01,410 INFO L480 AbstractCegarLoop]: Abstraction has 5480 states and 12892 transitions. [2018-12-09 04:50:01,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:50:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 5480 states and 12892 transitions. [2018-12-09 04:50:01,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 04:50:01,414 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:50:01,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:50:01,414 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:50:01,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:50:01,414 INFO L82 PathProgramCache]: Analyzing trace with hash 385512615, now seen corresponding path program 1 times [2018-12-09 04:50:01,414 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:50:01,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:01,416 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:50:01,416 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:01,416 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:50:01,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:50:01,456 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-09 04:50:01,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:50:01,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:50:01,456 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:50:01,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 04:50:01,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:50:01,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:50:01,457 INFO L87 Difference]: Start difference. First operand 5480 states and 12892 transitions. Second operand 6 states. [2018-12-09 04:50:01,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:50:01,526 INFO L93 Difference]: Finished difference Result 5096 states and 11724 transitions. [2018-12-09 04:50:01,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:50:01,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-09 04:50:01,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:50:01,529 INFO L225 Difference]: With dead ends: 5096 [2018-12-09 04:50:01,529 INFO L226 Difference]: Without dead ends: 5096 [2018-12-09 04:50:01,530 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-09 04:50:01,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5096 states. [2018-12-09 04:50:01,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5096 to 3190. [2018-12-09 04:50:01,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3190 states. [2018-12-09 04:50:01,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3190 states to 3190 states and 7391 transitions. [2018-12-09 04:50:01,557 INFO L78 Accepts]: Start accepts. Automaton has 3190 states and 7391 transitions. Word has length 82 [2018-12-09 04:50:01,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:50:01,557 INFO L480 AbstractCegarLoop]: Abstraction has 3190 states and 7391 transitions. [2018-12-09 04:50:01,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 04:50:01,557 INFO L276 IsEmpty]: Start isEmpty. Operand 3190 states and 7391 transitions. [2018-12-09 04:50:01,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 04:50:01,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:50:01,559 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] [2018-12-09 04:50:01,559 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:50:01,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:50:01,559 INFO L82 PathProgramCache]: Analyzing trace with hash 947808699, now seen corresponding path program 1 times [2018-12-09 04:50:01,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:50:01,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:01,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:50:01,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:01,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:50:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:50:01,632 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-09 04:50:01,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:50:01,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:50:01,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:50:01,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:50:01,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:50:01,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:50:01,633 INFO L87 Difference]: Start difference. First operand 3190 states and 7391 transitions. Second operand 7 states. [2018-12-09 04:50:01,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:50:01,756 INFO L93 Difference]: Finished difference Result 3738 states and 8627 transitions. [2018-12-09 04:50:01,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 04:50:01,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-12-09 04:50:01,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:50:01,759 INFO L225 Difference]: With dead ends: 3738 [2018-12-09 04:50:01,759 INFO L226 Difference]: Without dead ends: 3738 [2018-12-09 04:50:01,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-09 04:50:01,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2018-12-09 04:50:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 3641. [2018-12-09 04:50:01,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3641 states. [2018-12-09 04:50:01,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3641 states to 3641 states and 8435 transitions. [2018-12-09 04:50:01,786 INFO L78 Accepts]: Start accepts. Automaton has 3641 states and 8435 transitions. Word has length 84 [2018-12-09 04:50:01,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:50:01,787 INFO L480 AbstractCegarLoop]: Abstraction has 3641 states and 8435 transitions. [2018-12-09 04:50:01,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:50:01,787 INFO L276 IsEmpty]: Start isEmpty. Operand 3641 states and 8435 transitions. [2018-12-09 04:50:01,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 04:50:01,789 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:50:01,789 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] [2018-12-09 04:50:01,789 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:50:01,789 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:50:01,789 INFO L82 PathProgramCache]: Analyzing trace with hash 1835312380, now seen corresponding path program 1 times [2018-12-09 04:50:01,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:50:01,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:01,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:50:01,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:01,790 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:50:01,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:50:01,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:50:01,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:50:01,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 04:50:01,882 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:50:01,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 04:50:01,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 04:50:01,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-09 04:50:01,882 INFO L87 Difference]: Start difference. First operand 3641 states and 8435 transitions. Second operand 10 states. [2018-12-09 04:50:02,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:50:02,586 INFO L93 Difference]: Finished difference Result 6341 states and 14692 transitions. [2018-12-09 04:50:02,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 04:50:02,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2018-12-09 04:50:02,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:50:02,589 INFO L225 Difference]: With dead ends: 6341 [2018-12-09 04:50:02,589 INFO L226 Difference]: Without dead ends: 4297 [2018-12-09 04:50:02,589 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-09 04:50:02,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4297 states. [2018-12-09 04:50:02,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4297 to 3676. [2018-12-09 04:50:02,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3676 states. [2018-12-09 04:50:02,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3676 states to 3676 states and 8434 transitions. [2018-12-09 04:50:02,618 INFO L78 Accepts]: Start accepts. Automaton has 3676 states and 8434 transitions. Word has length 84 [2018-12-09 04:50:02,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:50:02,618 INFO L480 AbstractCegarLoop]: Abstraction has 3676 states and 8434 transitions. [2018-12-09 04:50:02,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 04:50:02,618 INFO L276 IsEmpty]: Start isEmpty. Operand 3676 states and 8434 transitions. [2018-12-09 04:50:02,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 04:50:02,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:50:02,620 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 04:50:02,620 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:50:02,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:50:02,620 INFO L82 PathProgramCache]: Analyzing trace with hash 454383476, now seen corresponding path program 2 times [2018-12-09 04:50:02,621 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:50:02,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:02,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:50:02,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:02,621 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:50:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:50:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:50:02,685 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:50:02,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 04:50:02,685 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:50:02,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 04:50:02,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 04:50:02,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:50:02,686 INFO L87 Difference]: Start difference. First operand 3676 states and 8434 transitions. Second operand 8 states. [2018-12-09 04:50:02,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:50:02,969 INFO L93 Difference]: Finished difference Result 6529 states and 15057 transitions. [2018-12-09 04:50:02,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:50:02,969 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2018-12-09 04:50:02,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:50:02,972 INFO L225 Difference]: With dead ends: 6529 [2018-12-09 04:50:02,972 INFO L226 Difference]: Without dead ends: 2810 [2018-12-09 04:50:02,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2018-12-09 04:50:02,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2810 states. [2018-12-09 04:50:02,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2810 to 2810. [2018-12-09 04:50:02,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2810 states. [2018-12-09 04:50:02,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2810 states to 2810 states and 6504 transitions. [2018-12-09 04:50:02,991 INFO L78 Accepts]: Start accepts. Automaton has 2810 states and 6504 transitions. Word has length 84 [2018-12-09 04:50:02,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:50:02,991 INFO L480 AbstractCegarLoop]: Abstraction has 2810 states and 6504 transitions. [2018-12-09 04:50:02,991 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 04:50:02,991 INFO L276 IsEmpty]: Start isEmpty. Operand 2810 states and 6504 transitions. [2018-12-09 04:50:02,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 04:50:02,994 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:50:02,994 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] [2018-12-09 04:50:02,994 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:50:02,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:50:02,994 INFO L82 PathProgramCache]: Analyzing trace with hash 1117969270, now seen corresponding path program 1 times [2018-12-09 04:50:02,994 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:50:02,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:02,995 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:50:02,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:02,995 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:50:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:50:03,047 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-09 04:50:03,048 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:50:03,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:50:03,048 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:50:03,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:50:03,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:50:03,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:50:03,048 INFO L87 Difference]: Start difference. First operand 2810 states and 6504 transitions. Second operand 7 states. [2018-12-09 04:50:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:50:03,223 INFO L93 Difference]: Finished difference Result 3247 states and 7538 transitions. [2018-12-09 04:50:03,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 04:50:03,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-12-09 04:50:03,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:50:03,225 INFO L225 Difference]: With dead ends: 3247 [2018-12-09 04:50:03,225 INFO L226 Difference]: Without dead ends: 3247 [2018-12-09 04:50:03,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:50:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2018-12-09 04:50:03,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 2890. [2018-12-09 04:50:03,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2890 states. [2018-12-09 04:50:03,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2890 states to 2890 states and 6729 transitions. [2018-12-09 04:50:03,243 INFO L78 Accepts]: Start accepts. Automaton has 2890 states and 6729 transitions. Word has length 84 [2018-12-09 04:50:03,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:50:03,243 INFO L480 AbstractCegarLoop]: Abstraction has 2890 states and 6729 transitions. [2018-12-09 04:50:03,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:50:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 2890 states and 6729 transitions. [2018-12-09 04:50:03,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 04:50:03,245 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:50:03,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] [2018-12-09 04:50:03,245 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:50:03,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:50:03,245 INFO L82 PathProgramCache]: Analyzing trace with hash -1883380040, now seen corresponding path program 1 times [2018-12-09 04:50:03,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:50:03,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:03,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:50:03,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:03,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:50:03,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:50:03,364 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-09 04:50:03,364 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:50:03,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 04:50:03,364 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:50:03,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 04:50:03,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 04:50:03,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 04:50:03,364 INFO L87 Difference]: Start difference. First operand 2890 states and 6729 transitions. Second operand 9 states. [2018-12-09 04:50:03,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:50:03,577 INFO L93 Difference]: Finished difference Result 3605 states and 8365 transitions. [2018-12-09 04:50:03,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 04:50:03,577 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2018-12-09 04:50:03,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:50:03,579 INFO L225 Difference]: With dead ends: 3605 [2018-12-09 04:50:03,579 INFO L226 Difference]: Without dead ends: 3605 [2018-12-09 04:50:03,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-09 04:50:03,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3605 states. [2018-12-09 04:50:03,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3605 to 2924. [2018-12-09 04:50:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2924 states. [2018-12-09 04:50:03,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2924 states to 2924 states and 6809 transitions. [2018-12-09 04:50:03,599 INFO L78 Accepts]: Start accepts. Automaton has 2924 states and 6809 transitions. Word has length 84 [2018-12-09 04:50:03,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:50:03,599 INFO L480 AbstractCegarLoop]: Abstraction has 2924 states and 6809 transitions. [2018-12-09 04:50:03,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 04:50:03,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2924 states and 6809 transitions. [2018-12-09 04:50:03,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 04:50:03,601 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:50:03,601 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] [2018-12-09 04:50:03,601 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:50:03,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:50:03,601 INFO L82 PathProgramCache]: Analyzing trace with hash -995876359, now seen corresponding path program 1 times [2018-12-09 04:50:03,601 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:50:03,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:03,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:50:03,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:03,602 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:50:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:50:03,666 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-09 04:50:03,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:50:03,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 04:50:03,666 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:50:03,666 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 04:50:03,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 04:50:03,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 04:50:03,667 INFO L87 Difference]: Start difference. First operand 2924 states and 6809 transitions. Second operand 7 states. [2018-12-09 04:50:03,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:50:03,802 INFO L93 Difference]: Finished difference Result 3006 states and 6922 transitions. [2018-12-09 04:50:03,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 04:50:03,802 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2018-12-09 04:50:03,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:50:03,804 INFO L225 Difference]: With dead ends: 3006 [2018-12-09 04:50:03,804 INFO L226 Difference]: Without dead ends: 3006 [2018-12-09 04:50:03,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2018-12-09 04:50:03,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2018-12-09 04:50:03,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 2728. [2018-12-09 04:50:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2728 states. [2018-12-09 04:50:03,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2728 states to 2728 states and 6289 transitions. [2018-12-09 04:50:03,828 INFO L78 Accepts]: Start accepts. Automaton has 2728 states and 6289 transitions. Word has length 84 [2018-12-09 04:50:03,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:50:03,829 INFO L480 AbstractCegarLoop]: Abstraction has 2728 states and 6289 transitions. [2018-12-09 04:50:03,829 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 04:50:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2728 states and 6289 transitions. [2018-12-09 04:50:03,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 04:50:03,831 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:50:03,831 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] [2018-12-09 04:50:03,831 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:50:03,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:50:03,831 INFO L82 PathProgramCache]: Analyzing trace with hash -921766023, now seen corresponding path program 2 times [2018-12-09 04:50:03,832 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:50:03,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:03,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:50:03,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:03,833 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:50:03,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:50:03,911 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-09 04:50:03,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:50:03,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 04:50:03,912 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:50:03,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 04:50:03,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 04:50:03,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 04:50:03,912 INFO L87 Difference]: Start difference. First operand 2728 states and 6289 transitions. Second operand 8 states. [2018-12-09 04:50:04,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:50:04,081 INFO L93 Difference]: Finished difference Result 3112 states and 7156 transitions. [2018-12-09 04:50:04,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 04:50:04,081 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2018-12-09 04:50:04,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:50:04,084 INFO L225 Difference]: With dead ends: 3112 [2018-12-09 04:50:04,084 INFO L226 Difference]: Without dead ends: 3112 [2018-12-09 04:50:04,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-09 04:50:04,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3112 states. [2018-12-09 04:50:04,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3112 to 2751. [2018-12-09 04:50:04,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2751 states. [2018-12-09 04:50:04,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2751 states to 2751 states and 6330 transitions. [2018-12-09 04:50:04,112 INFO L78 Accepts]: Start accepts. Automaton has 2751 states and 6330 transitions. Word has length 84 [2018-12-09 04:50:04,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:50:04,112 INFO L480 AbstractCegarLoop]: Abstraction has 2751 states and 6330 transitions. [2018-12-09 04:50:04,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 04:50:04,112 INFO L276 IsEmpty]: Start isEmpty. Operand 2751 states and 6330 transitions. [2018-12-09 04:50:04,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 04:50:04,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:50:04,115 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] [2018-12-09 04:50:04,115 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:50:04,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:50:04,115 INFO L82 PathProgramCache]: Analyzing trace with hash -34262342, now seen corresponding path program 3 times [2018-12-09 04:50:04,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:50:04,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:04,116 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:50:04,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:04,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:50:04,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:50:04,204 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-09 04:50:04,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:50:04,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 04:50:04,204 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 04:50:04,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 04:50:04,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 04:50:04,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 04:50:04,205 INFO L87 Difference]: Start difference. First operand 2751 states and 6330 transitions. Second operand 11 states. [2018-12-09 04:50:05,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:50:05,006 INFO L93 Difference]: Finished difference Result 4763 states and 11016 transitions. [2018-12-09 04:50:05,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 04:50:05,007 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 84 [2018-12-09 04:50:05,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 04:50:05,011 INFO L225 Difference]: With dead ends: 4763 [2018-12-09 04:50:05,012 INFO L226 Difference]: Without dead ends: 3059 [2018-12-09 04:50:05,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-09 04:50:05,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3059 states. [2018-12-09 04:50:05,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3059 to 2731. [2018-12-09 04:50:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2731 states. [2018-12-09 04:50:05,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2731 states to 2731 states and 6288 transitions. [2018-12-09 04:50:05,044 INFO L78 Accepts]: Start accepts. Automaton has 2731 states and 6288 transitions. Word has length 84 [2018-12-09 04:50:05,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 04:50:05,045 INFO L480 AbstractCegarLoop]: Abstraction has 2731 states and 6288 transitions. [2018-12-09 04:50:05,045 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 04:50:05,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2731 states and 6288 transitions. [2018-12-09 04:50:05,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 04:50:05,046 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 04:50:05,046 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] [2018-12-09 04:50:05,047 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 04:50:05,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:50:05,047 INFO L82 PathProgramCache]: Analyzing trace with hash 365545690, now seen corresponding path program 4 times [2018-12-09 04:50:05,047 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 04:50:05,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:05,048 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:50:05,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:50:05,048 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 04:50:05,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:50:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:50:05,077 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 04:50:05,136 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 04:50:05,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 04:50:05 BasicIcfg [2018-12-09 04:50:05,137 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 04:50:05,137 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 04:50:05,137 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 04:50:05,137 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 04:50:05,137 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:49:44" (3/4) ... [2018-12-09 04:50:05,139 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 04:50:05,219 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_452a0ca8-cae5-4dda-94e6-5e6875262b63/bin-2019/utaipan/witness.graphml [2018-12-09 04:50:05,219 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 04:50:05,220 INFO L168 Benchmark]: Toolchain (without parser) took 21023.27 ms. Allocated memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: 2.4 GB). Free memory was 953.5 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-12-09 04:50:05,221 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:50:05,221 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-09 04:50:05,221 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.29 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 04:50:05,222 INFO L168 Benchmark]: Boogie Preprocessor took 25.61 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-09 04:50:05,222 INFO L168 Benchmark]: RCFGBuilder took 342.64 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: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 11.5 GB. [2018-12-09 04:50:05,222 INFO L168 Benchmark]: TraceAbstraction took 20193.13 ms. Allocated memory was 1.2 GB in the beginning and 3.4 GB in the end (delta: 2.2 GB). Free memory was 1.1 GB in the beginning and 586.6 MB in the end (delta: 484.5 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-12-09 04:50:05,223 INFO L168 Benchmark]: Witness Printer took 81.85 ms. Allocated memory was 3.4 GB in the beginning and 3.5 GB in the end (delta: 61.3 MB). Free memory was 586.6 MB in the beginning and 3.0 GB in the end (delta: -2.4 GB). Peak memory consumption was 65.5 kB. Max. memory is 11.5 GB. [2018-12-09 04:50:05,224 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 338.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.29 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: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.61 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 342.64 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: 43.2 MB). Peak memory consumption was 43.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20193.13 ms. Allocated memory was 1.2 GB in the beginning and 3.4 GB in the end (delta: 2.2 GB). Free memory was 1.1 GB in the beginning and 586.6 MB in the end (delta: 484.5 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. * Witness Printer took 81.85 ms. Allocated memory was 3.4 GB in the beginning and 3.5 GB in the end (delta: 61.3 MB). Free memory was 586.6 MB in the beginning and 3.0 GB in the end (delta: -2.4 GB). Peak memory consumption was 65.5 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L683] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L684] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L685] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L686] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L687] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L688] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L689] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L690] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L691] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L692] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L693] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L694] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L695] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L696] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L698] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L776] -1 pthread_t t1641; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L777] FCALL, FORK -1 pthread_create(&t1641, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L778] -1 pthread_t t1642; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L779] FCALL, FORK -1 pthread_create(&t1642, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L734] 0 x$w_buff1 = x$w_buff0 [L735] 0 x$w_buff0 = 1 [L736] 0 x$w_buff1_used = x$w_buff0_used [L737] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L739] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L740] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L741] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L742] 0 x$r_buff0_thd2 = (_Bool)1 [L745] 0 y = 1 [L748] 0 __unbuffered_p1_EAX = y [L751] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L704] 1 y = 2 [L709] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L710] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L711] 1 x$flush_delayed = weak$$choice2 [L712] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L713] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L755] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L756] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L713] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L756] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L757] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L714] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L714] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L715] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L715] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L716] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L716] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L717] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L717] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L757] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L758] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L718] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L718] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L719] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L719] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L721] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L721] 1 x = x$flush_delayed ? x$mem_tmp : x [L722] 1 x$flush_delayed = (_Bool)0 [L727] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L786] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L788] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L792] -1 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 3 error locations. UNSAFE Result, 20.1s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 9.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8323 SDtfs, 10101 SDslu, 20486 SDs, 0 SdLazy, 8283 SolverSat, 405 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 315 GetRequests, 77 SyntacticMatches, 27 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61472occurred in iteration=7, 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: 7.4s AutomataMinimizationTime, 31 MinimizatonAttempts, 148231 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2216 NumberOfCodeBlocks, 2216 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2101 ConstructedInterpolants, 0 QuantifiedInterpolants, 407686 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...