./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix041_rmo.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c23fa592-4d59-410a-bc82-a7e641c4a7ec/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c23fa592-4d59-410a-bc82-a7e641c4a7ec/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c23fa592-4d59-410a-bc82-a7e641c4a7ec/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c23fa592-4d59-410a-bc82-a7e641c4a7ec/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix041_rmo.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c23fa592-4d59-410a-bc82-a7e641c4a7ec/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c23fa592-4d59-410a-bc82-a7e641c4a7ec/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 63a54ca8657aa4e3c30e7aab69439afef5cd6bf9 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 02:00:05,601 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 02:00:05,602 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 02:00:05,608 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 02:00:05,608 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 02:00:05,609 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 02:00:05,610 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 02:00:05,610 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 02:00:05,611 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 02:00:05,612 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 02:00:05,612 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 02:00:05,612 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 02:00:05,613 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 02:00:05,613 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 02:00:05,614 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 02:00:05,614 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 02:00:05,615 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 02:00:05,616 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 02:00:05,617 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 02:00:05,617 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 02:00:05,618 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 02:00:05,619 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 02:00:05,620 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 02:00:05,620 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 02:00:05,620 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 02:00:05,620 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 02:00:05,621 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 02:00:05,621 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 02:00:05,622 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 02:00:05,622 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 02:00:05,623 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 02:00:05,623 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 02:00:05,623 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 02:00:05,623 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 02:00:05,624 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 02:00:05,624 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 02:00:05,624 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c23fa592-4d59-410a-bc82-a7e641c4a7ec/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 02:00:05,632 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 02:00:05,632 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 02:00:05,632 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 02:00:05,632 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 02:00:05,633 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 02:00:05,633 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 02:00:05,633 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 02:00:05,633 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 02:00:05,633 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 02:00:05,633 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 02:00:05,633 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 02:00:05,633 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 02:00:05,634 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 02:00:05,634 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 02:00:05,634 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 02:00:05,634 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 02:00:05,634 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 02:00:05,634 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 02:00:05,635 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 02:00:05,635 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 02:00:05,635 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 02:00:05,635 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 02:00:05,635 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 02:00:05,635 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 02:00:05,635 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 02:00:05,636 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 02:00:05,636 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 02:00:05,636 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 02:00:05,636 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 02:00:05,636 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 02:00:05,636 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 02:00:05,636 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 02:00:05,636 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 02:00:05,637 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 02:00:05,637 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 02:00:05,637 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 02:00:05,637 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_c23fa592-4d59-410a-bc82-a7e641c4a7ec/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 -> 63a54ca8657aa4e3c30e7aab69439afef5cd6bf9 [2018-12-09 02:00:05,655 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 02:00:05,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 02:00:05,666 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 02:00:05,668 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 02:00:05,668 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 02:00:05,668 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c23fa592-4d59-410a-bc82-a7e641c4a7ec/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix041_rmo.oepc_false-unreach-call.i [2018-12-09 02:00:05,709 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c23fa592-4d59-410a-bc82-a7e641c4a7ec/bin-2019/utaipan/data/ad4a00275/5d41d51686b14a13b05a2725e51688ce/FLAG44873cfdf [2018-12-09 02:00:06,124 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 02:00:06,124 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c23fa592-4d59-410a-bc82-a7e641c4a7ec/sv-benchmarks/c/pthread-wmm/mix041_rmo.oepc_false-unreach-call.i [2018-12-09 02:00:06,134 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c23fa592-4d59-410a-bc82-a7e641c4a7ec/bin-2019/utaipan/data/ad4a00275/5d41d51686b14a13b05a2725e51688ce/FLAG44873cfdf [2018-12-09 02:00:06,145 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c23fa592-4d59-410a-bc82-a7e641c4a7ec/bin-2019/utaipan/data/ad4a00275/5d41d51686b14a13b05a2725e51688ce [2018-12-09 02:00:06,147 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 02:00:06,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 02:00:06,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 02:00:06,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 02:00:06,151 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 02:00:06,151 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:00:06" (1/1) ... [2018-12-09 02:00:06,153 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:00:06, skipping insertion in model container [2018-12-09 02:00:06,153 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 02:00:06" (1/1) ... [2018-12-09 02:00:06,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 02:00:06,187 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 02:00:06,408 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:00:06,417 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 02:00:06,496 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 02:00:06,525 INFO L195 MainTranslator]: Completed translation [2018-12-09 02:00:06,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:00:06 WrapperNode [2018-12-09 02:00:06,526 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 02:00:06,526 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 02:00:06,526 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 02:00:06,527 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 02:00:06,532 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:00:06" (1/1) ... [2018-12-09 02:00:06,541 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:00:06" (1/1) ... [2018-12-09 02:00:06,555 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 02:00:06,556 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 02:00:06,556 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 02:00:06,556 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 02:00:06,561 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:00:06" (1/1) ... [2018-12-09 02:00:06,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:00:06" (1/1) ... [2018-12-09 02:00:06,564 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:00:06" (1/1) ... [2018-12-09 02:00:06,564 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:00:06" (1/1) ... [2018-12-09 02:00:06,569 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:00:06" (1/1) ... [2018-12-09 02:00:06,571 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:00:06" (1/1) ... [2018-12-09 02:00:06,573 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:00:06" (1/1) ... [2018-12-09 02:00:06,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 02:00:06,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 02:00:06,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 02:00:06,575 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 02:00:06,575 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:00:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c23fa592-4d59-410a-bc82-a7e641c4a7ec/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 02:00:06,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 02:00:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 02:00:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 02:00:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 02:00:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 02:00:06,607 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 02:00:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 02:00:06,607 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 02:00:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 02:00:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 02:00:06,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 02:00:06,608 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 02:00:06,899 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 02:00:06,899 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 02:00:06,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:00:06 BoogieIcfgContainer [2018-12-09 02:00:06,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 02:00:06,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 02:00:06,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 02:00:06,902 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 02:00:06,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 02:00:06" (1/3) ... [2018-12-09 02:00:06,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a97ce22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:00:06, skipping insertion in model container [2018-12-09 02:00:06,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 02:00:06" (2/3) ... [2018-12-09 02:00:06,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a97ce22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 02:00:06, skipping insertion in model container [2018-12-09 02:00:06,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:00:06" (3/3) ... [2018-12-09 02:00:06,905 INFO L112 eAbstractionObserver]: Analyzing ICFG mix041_rmo.oepc_false-unreach-call.i [2018-12-09 02:00:06,932 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,932 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,932 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,932 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,932 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,932 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,932 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,932 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,933 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,934 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,935 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,935 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,935 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,935 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,935 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,935 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,935 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,935 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,935 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,935 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,935 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,936 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,937 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,937 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,937 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,938 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,939 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,940 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,941 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,942 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,943 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,944 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,945 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,946 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,947 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,948 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,949 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,950 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,951 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,952 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,953 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,954 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 02:00:06,958 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 02:00:06,958 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 02:00:06,963 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 02:00:06,972 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 02:00:06,986 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 02:00:06,987 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 02:00:06,987 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 02:00:06,987 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 02:00:06,987 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 02:00:06,987 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 02:00:06,987 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 02:00:06,987 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 02:00:06,993 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 143places, 181 transitions [2018-12-09 02:00:08,509 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34807 states. [2018-12-09 02:00:08,510 INFO L276 IsEmpty]: Start isEmpty. Operand 34807 states. [2018-12-09 02:00:08,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 02:00:08,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:08,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:08,517 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:08,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:08,521 INFO L82 PathProgramCache]: Analyzing trace with hash 375373260, now seen corresponding path program 1 times [2018-12-09 02:00:08,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:08,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:08,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:08,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:08,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:08,667 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 02:00:08,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:08,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:00:08,669 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:08,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:00:08,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:00:08,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:00:08,682 INFO L87 Difference]: Start difference. First operand 34807 states. Second operand 4 states. [2018-12-09 02:00:09,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:09,182 INFO L93 Difference]: Finished difference Result 60791 states and 234494 transitions. [2018-12-09 02:00:09,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:00:09,183 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2018-12-09 02:00:09,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:09,351 INFO L225 Difference]: With dead ends: 60791 [2018-12-09 02:00:09,351 INFO L226 Difference]: Without dead ends: 44271 [2018-12-09 02:00:09,352 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 02:00:09,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44271 states. [2018-12-09 02:00:10,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44271 to 27339. [2018-12-09 02:00:10,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27339 states. [2018-12-09 02:00:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27339 states to 27339 states and 105500 transitions. [2018-12-09 02:00:10,168 INFO L78 Accepts]: Start accepts. Automaton has 27339 states and 105500 transitions. Word has length 34 [2018-12-09 02:00:10,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:10,168 INFO L480 AbstractCegarLoop]: Abstraction has 27339 states and 105500 transitions. [2018-12-09 02:00:10,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:00:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 27339 states and 105500 transitions. [2018-12-09 02:00:10,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-09 02:00:10,175 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:10,175 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 02:00:10,175 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:10,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:10,175 INFO L82 PathProgramCache]: Analyzing trace with hash 510140563, now seen corresponding path program 1 times [2018-12-09 02:00:10,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:10,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:10,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:10,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:10,179 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:00:10,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:10,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:00:10,249 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:10,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:00:10,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:00:10,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:00:10,251 INFO L87 Difference]: Start difference. First operand 27339 states and 105500 transitions. Second operand 5 states. [2018-12-09 02:00:10,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:10,971 INFO L93 Difference]: Finished difference Result 64005 states and 235335 transitions. [2018-12-09 02:00:10,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:00:10,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2018-12-09 02:00:10,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:11,099 INFO L225 Difference]: With dead ends: 64005 [2018-12-09 02:00:11,099 INFO L226 Difference]: Without dead ends: 63453 [2018-12-09 02:00:11,100 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 02:00:11,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63453 states. [2018-12-09 02:00:11,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63453 to 41421. [2018-12-09 02:00:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41421 states. [2018-12-09 02:00:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41421 states to 41421 states and 152330 transitions. [2018-12-09 02:00:11,960 INFO L78 Accepts]: Start accepts. Automaton has 41421 states and 152330 transitions. Word has length 46 [2018-12-09 02:00:11,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:11,961 INFO L480 AbstractCegarLoop]: Abstraction has 41421 states and 152330 transitions. [2018-12-09 02:00:11,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:00:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 41421 states and 152330 transitions. [2018-12-09 02:00:11,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 02:00:11,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:11,965 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 02:00:11,965 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:11,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:11,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1974914378, now seen corresponding path program 1 times [2018-12-09 02:00:11,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:11,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:11,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:11,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:11,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:11,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:12,019 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 02:00:12,019 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:12,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:00:12,019 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:12,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:00:12,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:00:12,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:00:12,020 INFO L87 Difference]: Start difference. First operand 41421 states and 152330 transitions. Second operand 5 states. [2018-12-09 02:00:12,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:12,435 INFO L93 Difference]: Finished difference Result 81367 states and 298048 transitions. [2018-12-09 02:00:12,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:00:12,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 02:00:12,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:12,589 INFO L225 Difference]: With dead ends: 81367 [2018-12-09 02:00:12,589 INFO L226 Difference]: Without dead ends: 80855 [2018-12-09 02:00:12,590 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 02:00:12,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80855 states. [2018-12-09 02:00:13,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80855 to 45375. [2018-12-09 02:00:13,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45375 states. [2018-12-09 02:00:13,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45375 states to 45375 states and 166018 transitions. [2018-12-09 02:00:13,551 INFO L78 Accepts]: Start accepts. Automaton has 45375 states and 166018 transitions. Word has length 47 [2018-12-09 02:00:13,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:13,552 INFO L480 AbstractCegarLoop]: Abstraction has 45375 states and 166018 transitions. [2018-12-09 02:00:13,552 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:00:13,552 INFO L276 IsEmpty]: Start isEmpty. Operand 45375 states and 166018 transitions. [2018-12-09 02:00:13,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 02:00:13,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:13,556 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 02:00:13,556 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:13,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:13,557 INFO L82 PathProgramCache]: Analyzing trace with hash 489356304, now seen corresponding path program 1 times [2018-12-09 02:00:13,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:13,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:13,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:13,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:13,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:13,580 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 02:00:13,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:13,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:00:13,580 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:13,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:00:13,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:00:13,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:00:13,581 INFO L87 Difference]: Start difference. First operand 45375 states and 166018 transitions. Second operand 3 states. [2018-12-09 02:00:13,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:13,917 INFO L93 Difference]: Finished difference Result 65251 states and 235814 transitions. [2018-12-09 02:00:13,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:00:13,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2018-12-09 02:00:13,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:14,023 INFO L225 Difference]: With dead ends: 65251 [2018-12-09 02:00:14,023 INFO L226 Difference]: Without dead ends: 65251 [2018-12-09 02:00:14,023 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 02:00:14,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65251 states. [2018-12-09 02:00:14,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65251 to 50945. [2018-12-09 02:00:14,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50945 states. [2018-12-09 02:00:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50945 states to 50945 states and 184325 transitions. [2018-12-09 02:00:14,861 INFO L78 Accepts]: Start accepts. Automaton has 50945 states and 184325 transitions. Word has length 49 [2018-12-09 02:00:14,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:14,861 INFO L480 AbstractCegarLoop]: Abstraction has 50945 states and 184325 transitions. [2018-12-09 02:00:14,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:00:14,862 INFO L276 IsEmpty]: Start isEmpty. Operand 50945 states and 184325 transitions. [2018-12-09 02:00:14,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 02:00:14,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:14,869 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 02:00:14,869 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:14,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:14,869 INFO L82 PathProgramCache]: Analyzing trace with hash -1592139769, now seen corresponding path program 1 times [2018-12-09 02:00:14,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:14,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:14,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:14,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:14,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:14,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:14,947 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 02:00:14,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:14,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:00:14,948 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:14,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:00:14,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:00:14,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:00:14,949 INFO L87 Difference]: Start difference. First operand 50945 states and 184325 transitions. Second operand 6 states. [2018-12-09 02:00:15,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:15,491 INFO L93 Difference]: Finished difference Result 67511 states and 242185 transitions. [2018-12-09 02:00:15,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:00:15,492 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 02:00:15,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:15,711 INFO L225 Difference]: With dead ends: 67511 [2018-12-09 02:00:15,711 INFO L226 Difference]: Without dead ends: 67511 [2018-12-09 02:00:15,711 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 02:00:15,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67511 states. [2018-12-09 02:00:16,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67511 to 63436. [2018-12-09 02:00:16,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63436 states. [2018-12-09 02:00:16,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63436 states to 63436 states and 227584 transitions. [2018-12-09 02:00:16,664 INFO L78 Accepts]: Start accepts. Automaton has 63436 states and 227584 transitions. Word has length 53 [2018-12-09 02:00:16,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:16,664 INFO L480 AbstractCegarLoop]: Abstraction has 63436 states and 227584 transitions. [2018-12-09 02:00:16,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:00:16,664 INFO L276 IsEmpty]: Start isEmpty. Operand 63436 states and 227584 transitions. [2018-12-09 02:00:16,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 02:00:16,672 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:16,672 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 02:00:16,673 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:16,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:16,673 INFO L82 PathProgramCache]: Analyzing trace with hash 905876168, now seen corresponding path program 1 times [2018-12-09 02:00:16,673 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:16,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:16,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:16,674 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:16,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:16,733 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 02:00:16,734 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:16,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:00:16,734 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:16,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:00:16,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:00:16,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:00:16,735 INFO L87 Difference]: Start difference. First operand 63436 states and 227584 transitions. Second operand 7 states. [2018-12-09 02:00:17,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:17,575 INFO L93 Difference]: Finished difference Result 88528 states and 306201 transitions. [2018-12-09 02:00:17,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 02:00:17,576 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2018-12-09 02:00:17,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:17,721 INFO L225 Difference]: With dead ends: 88528 [2018-12-09 02:00:17,721 INFO L226 Difference]: Without dead ends: 88528 [2018-12-09 02:00:17,721 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 02:00:17,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88528 states. [2018-12-09 02:00:18,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88528 to 74881. [2018-12-09 02:00:18,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74881 states. [2018-12-09 02:00:18,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74881 states to 74881 states and 262987 transitions. [2018-12-09 02:00:18,887 INFO L78 Accepts]: Start accepts. Automaton has 74881 states and 262987 transitions. Word has length 53 [2018-12-09 02:00:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:18,887 INFO L480 AbstractCegarLoop]: Abstraction has 74881 states and 262987 transitions. [2018-12-09 02:00:18,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:00:18,887 INFO L276 IsEmpty]: Start isEmpty. Operand 74881 states and 262987 transitions. [2018-12-09 02:00:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 02:00:18,896 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:18,896 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 02:00:18,896 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:18,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:18,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1793379849, now seen corresponding path program 1 times [2018-12-09 02:00:18,896 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:18,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:18,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:18,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:18,898 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:18,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:18,930 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 02:00:18,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:18,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:00:18,930 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:18,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:00:18,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:00:18,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:00:18,931 INFO L87 Difference]: Start difference. First operand 74881 states and 262987 transitions. Second operand 4 states. [2018-12-09 02:00:18,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:18,993 INFO L93 Difference]: Finished difference Result 15375 states and 48826 transitions. [2018-12-09 02:00:18,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:00:18,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-09 02:00:18,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:19,009 INFO L225 Difference]: With dead ends: 15375 [2018-12-09 02:00:19,009 INFO L226 Difference]: Without dead ends: 13789 [2018-12-09 02:00:19,010 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 02:00:19,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13789 states. [2018-12-09 02:00:19,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13789 to 13740. [2018-12-09 02:00:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13740 states. [2018-12-09 02:00:19,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13740 states to 13740 states and 43352 transitions. [2018-12-09 02:00:19,162 INFO L78 Accepts]: Start accepts. Automaton has 13740 states and 43352 transitions. Word has length 53 [2018-12-09 02:00:19,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:19,163 INFO L480 AbstractCegarLoop]: Abstraction has 13740 states and 43352 transitions. [2018-12-09 02:00:19,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:00:19,163 INFO L276 IsEmpty]: Start isEmpty. Operand 13740 states and 43352 transitions. [2018-12-09 02:00:19,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-09 02:00:19,164 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:19,164 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 02:00:19,164 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:19,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:19,164 INFO L82 PathProgramCache]: Analyzing trace with hash 35134875, now seen corresponding path program 1 times [2018-12-09 02:00:19,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:19,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:19,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:19,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:19,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:19,210 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 02:00:19,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:19,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:00:19,211 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:19,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:00:19,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:00:19,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:00:19,212 INFO L87 Difference]: Start difference. First operand 13740 states and 43352 transitions. Second operand 6 states. [2018-12-09 02:00:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:19,474 INFO L93 Difference]: Finished difference Result 19970 states and 62589 transitions. [2018-12-09 02:00:19,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 02:00:19,475 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2018-12-09 02:00:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:19,497 INFO L225 Difference]: With dead ends: 19970 [2018-12-09 02:00:19,497 INFO L226 Difference]: Without dead ends: 19898 [2018-12-09 02:00:19,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-09 02:00:19,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19898 states. [2018-12-09 02:00:19,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19898 to 14314. [2018-12-09 02:00:19,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14314 states. [2018-12-09 02:00:19,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14314 states to 14314 states and 45049 transitions. [2018-12-09 02:00:19,683 INFO L78 Accepts]: Start accepts. Automaton has 14314 states and 45049 transitions. Word has length 53 [2018-12-09 02:00:19,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:19,683 INFO L480 AbstractCegarLoop]: Abstraction has 14314 states and 45049 transitions. [2018-12-09 02:00:19,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:00:19,684 INFO L276 IsEmpty]: Start isEmpty. Operand 14314 states and 45049 transitions. [2018-12-09 02:00:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 02:00:19,686 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:19,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:19,687 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:19,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:19,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1993804535, now seen corresponding path program 1 times [2018-12-09 02:00:19,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:19,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:19,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:19,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:19,689 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:19,724 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 02:00:19,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:19,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:00:19,724 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:19,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:00:19,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:00:19,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:00:19,725 INFO L87 Difference]: Start difference. First operand 14314 states and 45049 transitions. Second operand 4 states. [2018-12-09 02:00:19,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:19,810 INFO L93 Difference]: Finished difference Result 16617 states and 52377 transitions. [2018-12-09 02:00:19,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 02:00:19,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-09 02:00:19,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:19,830 INFO L225 Difference]: With dead ends: 16617 [2018-12-09 02:00:19,830 INFO L226 Difference]: Without dead ends: 16617 [2018-12-09 02:00:19,831 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 02:00:19,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16617 states. [2018-12-09 02:00:19,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16617 to 15134. [2018-12-09 02:00:19,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15134 states. [2018-12-09 02:00:19,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15134 states to 15134 states and 47639 transitions. [2018-12-09 02:00:19,997 INFO L78 Accepts]: Start accepts. Automaton has 15134 states and 47639 transitions. Word has length 61 [2018-12-09 02:00:19,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:19,997 INFO L480 AbstractCegarLoop]: Abstraction has 15134 states and 47639 transitions. [2018-12-09 02:00:19,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:00:19,997 INFO L276 IsEmpty]: Start isEmpty. Operand 15134 states and 47639 transitions. [2018-12-09 02:00:20,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-09 02:00:20,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:20,000 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:20,000 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:20,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:20,000 INFO L82 PathProgramCache]: Analyzing trace with hash -558352426, now seen corresponding path program 1 times [2018-12-09 02:00:20,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:20,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:20,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:20,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:20,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:20,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:20,043 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 02:00:20,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:20,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:00:20,044 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:20,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:00:20,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:00:20,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:00:20,044 INFO L87 Difference]: Start difference. First operand 15134 states and 47639 transitions. Second operand 6 states. [2018-12-09 02:00:20,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:20,313 INFO L93 Difference]: Finished difference Result 28106 states and 88147 transitions. [2018-12-09 02:00:20,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 02:00:20,313 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-09 02:00:20,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:20,348 INFO L225 Difference]: With dead ends: 28106 [2018-12-09 02:00:20,348 INFO L226 Difference]: Without dead ends: 28035 [2018-12-09 02:00:20,348 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 02:00:20,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28035 states. [2018-12-09 02:00:20,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28035 to 17412. [2018-12-09 02:00:20,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17412 states. [2018-12-09 02:00:20,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17412 states to 17412 states and 54313 transitions. [2018-12-09 02:00:20,587 INFO L78 Accepts]: Start accepts. Automaton has 17412 states and 54313 transitions. Word has length 61 [2018-12-09 02:00:20,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:20,587 INFO L480 AbstractCegarLoop]: Abstraction has 17412 states and 54313 transitions. [2018-12-09 02:00:20,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:00:20,587 INFO L276 IsEmpty]: Start isEmpty. Operand 17412 states and 54313 transitions. [2018-12-09 02:00:20,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 02:00:20,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:20,591 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 02:00:20,591 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:20,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:20,591 INFO L82 PathProgramCache]: Analyzing trace with hash 527633642, now seen corresponding path program 1 times [2018-12-09 02:00:20,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:20,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:20,593 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:20,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:20,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:20,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:20,616 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 02:00:20,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:20,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:00:20,616 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:20,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:00:20,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:00:20,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:00:20,617 INFO L87 Difference]: Start difference. First operand 17412 states and 54313 transitions. Second operand 3 states. [2018-12-09 02:00:20,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:20,759 INFO L93 Difference]: Finished difference Result 18092 states and 56145 transitions. [2018-12-09 02:00:20,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:00:20,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2018-12-09 02:00:20,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:20,779 INFO L225 Difference]: With dead ends: 18092 [2018-12-09 02:00:20,779 INFO L226 Difference]: Without dead ends: 18092 [2018-12-09 02:00:20,780 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 02:00:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18092 states. [2018-12-09 02:00:20,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18092 to 17752. [2018-12-09 02:00:20,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17752 states. [2018-12-09 02:00:20,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17752 states to 17752 states and 55229 transitions. [2018-12-09 02:00:20,960 INFO L78 Accepts]: Start accepts. Automaton has 17752 states and 55229 transitions. Word has length 65 [2018-12-09 02:00:20,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:20,961 INFO L480 AbstractCegarLoop]: Abstraction has 17752 states and 55229 transitions. [2018-12-09 02:00:20,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:00:20,961 INFO L276 IsEmpty]: Start isEmpty. Operand 17752 states and 55229 transitions. [2018-12-09 02:00:20,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 02:00:20,965 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:20,965 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 02:00:20,965 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:20,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:20,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1690124311, now seen corresponding path program 1 times [2018-12-09 02:00:20,965 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:20,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:20,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:20,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:20,967 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:20,993 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 02:00:20,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:20,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:00:20,994 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:20,994 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:00:20,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:00:20,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:00:20,994 INFO L87 Difference]: Start difference. First operand 17752 states and 55229 transitions. Second operand 4 states. [2018-12-09 02:00:21,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:21,157 INFO L93 Difference]: Finished difference Result 21696 states and 66718 transitions. [2018-12-09 02:00:21,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:00:21,157 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 02:00:21,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:21,181 INFO L225 Difference]: With dead ends: 21696 [2018-12-09 02:00:21,181 INFO L226 Difference]: Without dead ends: 21696 [2018-12-09 02:00:21,181 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 02:00:21,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21696 states. [2018-12-09 02:00:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21696 to 19646. [2018-12-09 02:00:21,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19646 states. [2018-12-09 02:00:21,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19646 states to 19646 states and 60608 transitions. [2018-12-09 02:00:21,389 INFO L78 Accepts]: Start accepts. Automaton has 19646 states and 60608 transitions. Word has length 65 [2018-12-09 02:00:21,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:21,390 INFO L480 AbstractCegarLoop]: Abstraction has 19646 states and 60608 transitions. [2018-12-09 02:00:21,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:00:21,390 INFO L276 IsEmpty]: Start isEmpty. Operand 19646 states and 60608 transitions. [2018-12-09 02:00:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:00:21,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:21,396 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 02:00:21,396 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:21,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:21,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1735068466, now seen corresponding path program 1 times [2018-12-09 02:00:21,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:21,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:21,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:21,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:21,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:21,453 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 02:00:21,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:21,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:00:21,453 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:21,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:00:21,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:00:21,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:00:21,454 INFO L87 Difference]: Start difference. First operand 19646 states and 60608 transitions. Second operand 6 states. [2018-12-09 02:00:22,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:22,093 INFO L93 Difference]: Finished difference Result 23814 states and 72326 transitions. [2018-12-09 02:00:22,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:00:22,094 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 02:00:22,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:22,116 INFO L225 Difference]: With dead ends: 23814 [2018-12-09 02:00:22,116 INFO L226 Difference]: Without dead ends: 23814 [2018-12-09 02:00:22,116 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 02:00:22,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23814 states. [2018-12-09 02:00:22,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23814 to 22474. [2018-12-09 02:00:22,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22474 states. [2018-12-09 02:00:22,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22474 states to 22474 states and 68748 transitions. [2018-12-09 02:00:22,338 INFO L78 Accepts]: Start accepts. Automaton has 22474 states and 68748 transitions. Word has length 67 [2018-12-09 02:00:22,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:22,338 INFO L480 AbstractCegarLoop]: Abstraction has 22474 states and 68748 transitions. [2018-12-09 02:00:22,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:00:22,338 INFO L276 IsEmpty]: Start isEmpty. Operand 22474 states and 68748 transitions. [2018-12-09 02:00:22,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:00:22,345 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:22,345 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 02:00:22,345 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:22,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:22,346 INFO L82 PathProgramCache]: Analyzing trace with hash -342140877, now seen corresponding path program 1 times [2018-12-09 02:00:22,346 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:22,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:22,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:22,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:22,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:22,409 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 02:00:22,409 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:22,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:00:22,410 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:22,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:00:22,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:00:22,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:00:22,410 INFO L87 Difference]: Start difference. First operand 22474 states and 68748 transitions. Second operand 6 states. [2018-12-09 02:00:22,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:22,696 INFO L93 Difference]: Finished difference Result 25702 states and 76208 transitions. [2018-12-09 02:00:22,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:00:22,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-09 02:00:22,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:22,723 INFO L225 Difference]: With dead ends: 25702 [2018-12-09 02:00:22,723 INFO L226 Difference]: Without dead ends: 25702 [2018-12-09 02:00:22,723 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 02:00:22,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2018-12-09 02:00:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 22858. [2018-12-09 02:00:22,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22858 states. [2018-12-09 02:00:22,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22858 states to 22858 states and 68854 transitions. [2018-12-09 02:00:22,952 INFO L78 Accepts]: Start accepts. Automaton has 22858 states and 68854 transitions. Word has length 67 [2018-12-09 02:00:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:22,952 INFO L480 AbstractCegarLoop]: Abstraction has 22858 states and 68854 transitions. [2018-12-09 02:00:22,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:00:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 22858 states and 68854 transitions. [2018-12-09 02:00:22,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:00:22,958 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:22,958 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 02:00:22,958 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:22,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:22,958 INFO L82 PathProgramCache]: Analyzing trace with hash -130789964, now seen corresponding path program 1 times [2018-12-09 02:00:22,958 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:22,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:22,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:22,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:22,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:22,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:23,007 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 02:00:23,007 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:23,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:00:23,007 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:23,007 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:00:23,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:00:23,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:00:23,008 INFO L87 Difference]: Start difference. First operand 22858 states and 68854 transitions. Second operand 5 states. [2018-12-09 02:00:23,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:23,248 INFO L93 Difference]: Finished difference Result 29793 states and 89419 transitions. [2018-12-09 02:00:23,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:00:23,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 02:00:23,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:23,284 INFO L225 Difference]: With dead ends: 29793 [2018-12-09 02:00:23,284 INFO L226 Difference]: Without dead ends: 29793 [2018-12-09 02:00:23,284 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 02:00:23,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29793 states. [2018-12-09 02:00:23,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29793 to 26814. [2018-12-09 02:00:23,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26814 states. [2018-12-09 02:00:23,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26814 states to 26814 states and 80363 transitions. [2018-12-09 02:00:23,588 INFO L78 Accepts]: Start accepts. Automaton has 26814 states and 80363 transitions. Word has length 67 [2018-12-09 02:00:23,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:23,588 INFO L480 AbstractCegarLoop]: Abstraction has 26814 states and 80363 transitions. [2018-12-09 02:00:23,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:00:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 26814 states and 80363 transitions. [2018-12-09 02:00:23,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:00:23,597 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:23,597 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 02:00:23,597 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:23,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:23,597 INFO L82 PathProgramCache]: Analyzing trace with hash -641324141, now seen corresponding path program 1 times [2018-12-09 02:00:23,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:23,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:23,598 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:23,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:23,598 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:23,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:23,650 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 02:00:23,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:23,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:00:23,650 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:23,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:00:23,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:00:23,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:00:23,651 INFO L87 Difference]: Start difference. First operand 26814 states and 80363 transitions. Second operand 5 states. [2018-12-09 02:00:23,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:23,965 INFO L93 Difference]: Finished difference Result 36420 states and 108433 transitions. [2018-12-09 02:00:23,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:00:23,965 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 02:00:23,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:24,007 INFO L225 Difference]: With dead ends: 36420 [2018-12-09 02:00:24,007 INFO L226 Difference]: Without dead ends: 36420 [2018-12-09 02:00:24,007 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 02:00:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36420 states. [2018-12-09 02:00:24,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36420 to 29428. [2018-12-09 02:00:24,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29428 states. [2018-12-09 02:00:24,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29428 states to 29428 states and 87839 transitions. [2018-12-09 02:00:24,366 INFO L78 Accepts]: Start accepts. Automaton has 29428 states and 87839 transitions. Word has length 67 [2018-12-09 02:00:24,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:24,367 INFO L480 AbstractCegarLoop]: Abstraction has 29428 states and 87839 transitions. [2018-12-09 02:00:24,367 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:00:24,367 INFO L276 IsEmpty]: Start isEmpty. Operand 29428 states and 87839 transitions. [2018-12-09 02:00:24,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:00:24,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:24,375 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 02:00:24,375 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:24,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:24,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1846188692, now seen corresponding path program 1 times [2018-12-09 02:00:24,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:24,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:24,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:24,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:24,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:24,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:24,414 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 02:00:24,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:24,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:00:24,414 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:24,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:00:24,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:00:24,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:00:24,415 INFO L87 Difference]: Start difference. First operand 29428 states and 87839 transitions. Second operand 5 states. [2018-12-09 02:00:24,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:24,454 INFO L93 Difference]: Finished difference Result 9076 states and 21915 transitions. [2018-12-09 02:00:24,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 02:00:24,454 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2018-12-09 02:00:24,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:24,459 INFO L225 Difference]: With dead ends: 9076 [2018-12-09 02:00:24,459 INFO L226 Difference]: Without dead ends: 7224 [2018-12-09 02:00:24,459 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 02:00:24,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2018-12-09 02:00:24,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 6121. [2018-12-09 02:00:24,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6121 states. [2018-12-09 02:00:24,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 14386 transitions. [2018-12-09 02:00:24,506 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 14386 transitions. Word has length 67 [2018-12-09 02:00:24,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:24,506 INFO L480 AbstractCegarLoop]: Abstraction has 6121 states and 14386 transitions. [2018-12-09 02:00:24,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:00:24,507 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 14386 transitions. [2018-12-09 02:00:24,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 02:00:24,510 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:24,510 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 02:00:24,510 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:24,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:24,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1392892313, now seen corresponding path program 1 times [2018-12-09 02:00:24,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:24,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:24,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:24,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:24,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:24,528 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 02:00:24,528 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:24,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 02:00:24,528 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:24,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 02:00:24,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 02:00:24,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 02:00:24,529 INFO L87 Difference]: Start difference. First operand 6121 states and 14386 transitions. Second operand 3 states. [2018-12-09 02:00:24,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:24,563 INFO L93 Difference]: Finished difference Result 8340 states and 19493 transitions. [2018-12-09 02:00:24,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 02:00:24,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-09 02:00:24,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:24,569 INFO L225 Difference]: With dead ends: 8340 [2018-12-09 02:00:24,570 INFO L226 Difference]: Without dead ends: 8340 [2018-12-09 02:00:24,570 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 02:00:24,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8340 states. [2018-12-09 02:00:24,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8340 to 6060. [2018-12-09 02:00:24,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6060 states. [2018-12-09 02:00:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6060 states to 6060 states and 13926 transitions. [2018-12-09 02:00:24,633 INFO L78 Accepts]: Start accepts. Automaton has 6060 states and 13926 transitions. Word has length 67 [2018-12-09 02:00:24,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:24,634 INFO L480 AbstractCegarLoop]: Abstraction has 6060 states and 13926 transitions. [2018-12-09 02:00:24,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 02:00:24,634 INFO L276 IsEmpty]: Start isEmpty. Operand 6060 states and 13926 transitions. [2018-12-09 02:00:24,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 02:00:24,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:24,638 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:24,639 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:24,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:24,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1912290010, now seen corresponding path program 1 times [2018-12-09 02:00:24,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:24,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:24,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:24,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:24,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:24,680 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 02:00:24,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:24,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:00:24,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:24,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:00:24,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:00:24,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:00:24,681 INFO L87 Difference]: Start difference. First operand 6060 states and 13926 transitions. Second operand 5 states. [2018-12-09 02:00:24,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:24,789 INFO L93 Difference]: Finished difference Result 7230 states and 16567 transitions. [2018-12-09 02:00:24,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:00:24,790 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-12-09 02:00:24,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:24,795 INFO L225 Difference]: With dead ends: 7230 [2018-12-09 02:00:24,795 INFO L226 Difference]: Without dead ends: 7230 [2018-12-09 02:00:24,795 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 02:00:24,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7230 states. [2018-12-09 02:00:24,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7230 to 6504. [2018-12-09 02:00:24,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6504 states. [2018-12-09 02:00:24,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6504 states to 6504 states and 14930 transitions. [2018-12-09 02:00:24,858 INFO L78 Accepts]: Start accepts. Automaton has 6504 states and 14930 transitions. Word has length 73 [2018-12-09 02:00:24,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:24,858 INFO L480 AbstractCegarLoop]: Abstraction has 6504 states and 14930 transitions. [2018-12-09 02:00:24,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:00:24,858 INFO L276 IsEmpty]: Start isEmpty. Operand 6504 states and 14930 transitions. [2018-12-09 02:00:24,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-12-09 02:00:24,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:24,863 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:24,863 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:24,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:24,863 INFO L82 PathProgramCache]: Analyzing trace with hash -639866951, now seen corresponding path program 1 times [2018-12-09 02:00:24,863 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:24,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:24,864 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:24,864 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:24,864 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:24,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:24,913 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 02:00:24,913 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:24,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:00:24,913 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:24,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:00:24,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:00:24,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:00:24,914 INFO L87 Difference]: Start difference. First operand 6504 states and 14930 transitions. Second operand 7 states. [2018-12-09 02:00:25,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:25,152 INFO L93 Difference]: Finished difference Result 7577 states and 17192 transitions. [2018-12-09 02:00:25,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 02:00:25,153 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-12-09 02:00:25,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:25,158 INFO L225 Difference]: With dead ends: 7577 [2018-12-09 02:00:25,158 INFO L226 Difference]: Without dead ends: 7458 [2018-12-09 02:00:25,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-09 02:00:25,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7458 states. [2018-12-09 02:00:25,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7458 to 6601. [2018-12-09 02:00:25,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6601 states. [2018-12-09 02:00:25,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6601 states to 6601 states and 15023 transitions. [2018-12-09 02:00:25,211 INFO L78 Accepts]: Start accepts. Automaton has 6601 states and 15023 transitions. Word has length 73 [2018-12-09 02:00:25,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:25,211 INFO L480 AbstractCegarLoop]: Abstraction has 6601 states and 15023 transitions. [2018-12-09 02:00:25,211 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:00:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand 6601 states and 15023 transitions. [2018-12-09 02:00:25,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 02:00:25,215 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:25,215 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:25,215 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:25,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:25,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1914844155, now seen corresponding path program 1 times [2018-12-09 02:00:25,216 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:25,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:25,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:25,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:25,217 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:25,242 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 02:00:25,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:25,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:00:25,242 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:25,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:00:25,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:00:25,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:00:25,243 INFO L87 Difference]: Start difference. First operand 6601 states and 15023 transitions. Second operand 4 states. [2018-12-09 02:00:25,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:25,438 INFO L93 Difference]: Finished difference Result 10288 states and 23294 transitions. [2018-12-09 02:00:25,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:00:25,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-09 02:00:25,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:25,459 INFO L225 Difference]: With dead ends: 10288 [2018-12-09 02:00:25,459 INFO L226 Difference]: Without dead ends: 10288 [2018-12-09 02:00:25,459 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:00:25,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10288 states. [2018-12-09 02:00:25,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10288 to 7721. [2018-12-09 02:00:25,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7721 states. [2018-12-09 02:00:25,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7721 states to 7721 states and 17357 transitions. [2018-12-09 02:00:25,519 INFO L78 Accepts]: Start accepts. Automaton has 7721 states and 17357 transitions. Word has length 92 [2018-12-09 02:00:25,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:25,519 INFO L480 AbstractCegarLoop]: Abstraction has 7721 states and 17357 transitions. [2018-12-09 02:00:25,519 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:00:25,519 INFO L276 IsEmpty]: Start isEmpty. Operand 7721 states and 17357 transitions. [2018-12-09 02:00:25,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-12-09 02:00:25,525 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:25,525 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:25,525 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:25,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:25,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1127474233, now seen corresponding path program 2 times [2018-12-09 02:00:25,525 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:25,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:25,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:25,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:25,526 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:25,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:25,557 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 02:00:25,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:25,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 02:00:25,558 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:25,558 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 02:00:25,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 02:00:25,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 02:00:25,558 INFO L87 Difference]: Start difference. First operand 7721 states and 17357 transitions. Second operand 4 states. [2018-12-09 02:00:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:25,622 INFO L93 Difference]: Finished difference Result 8286 states and 18650 transitions. [2018-12-09 02:00:25,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 02:00:25,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2018-12-09 02:00:25,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:25,628 INFO L225 Difference]: With dead ends: 8286 [2018-12-09 02:00:25,628 INFO L226 Difference]: Without dead ends: 8286 [2018-12-09 02:00:25,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:00:25,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8286 states. [2018-12-09 02:00:25,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8286 to 7627. [2018-12-09 02:00:25,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7627 states. [2018-12-09 02:00:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7627 states to 7627 states and 17252 transitions. [2018-12-09 02:00:25,685 INFO L78 Accepts]: Start accepts. Automaton has 7627 states and 17252 transitions. Word has length 92 [2018-12-09 02:00:25,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:25,686 INFO L480 AbstractCegarLoop]: Abstraction has 7627 states and 17252 transitions. [2018-12-09 02:00:25,686 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 02:00:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 7627 states and 17252 transitions. [2018-12-09 02:00:25,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 02:00:25,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:25,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:25,691 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:25,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:25,691 INFO L82 PathProgramCache]: Analyzing trace with hash 879761931, now seen corresponding path program 1 times [2018-12-09 02:00:25,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:25,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:25,692 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:00:25,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:25,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:25,750 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 02:00:25,750 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:25,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:00:25,751 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:25,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:00:25,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:00:25,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:00:25,751 INFO L87 Difference]: Start difference. First operand 7627 states and 17252 transitions. Second operand 7 states. [2018-12-09 02:00:26,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:26,066 INFO L93 Difference]: Finished difference Result 9401 states and 21200 transitions. [2018-12-09 02:00:26,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:00:26,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-09 02:00:26,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:26,072 INFO L225 Difference]: With dead ends: 9401 [2018-12-09 02:00:26,073 INFO L226 Difference]: Without dead ends: 9401 [2018-12-09 02:00:26,073 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 02:00:26,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9401 states. [2018-12-09 02:00:26,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9401 to 7739. [2018-12-09 02:00:26,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7739 states. [2018-12-09 02:00:26,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7739 states to 7739 states and 17572 transitions. [2018-12-09 02:00:26,134 INFO L78 Accepts]: Start accepts. Automaton has 7739 states and 17572 transitions. Word has length 94 [2018-12-09 02:00:26,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:26,134 INFO L480 AbstractCegarLoop]: Abstraction has 7739 states and 17572 transitions. [2018-12-09 02:00:26,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:00:26,134 INFO L276 IsEmpty]: Start isEmpty. Operand 7739 states and 17572 transitions. [2018-12-09 02:00:26,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 02:00:26,139 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:26,139 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:00:26,140 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:26,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:26,140 INFO L82 PathProgramCache]: Analyzing trace with hash 45519536, now seen corresponding path program 1 times [2018-12-09 02:00:26,140 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:26,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:26,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:26,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:26,141 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:26,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:26,175 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 02:00:26,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:26,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:00:26,176 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:26,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:00:26,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:00:26,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:00:26,176 INFO L87 Difference]: Start difference. First operand 7739 states and 17572 transitions. Second operand 5 states. [2018-12-09 02:00:26,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:26,234 INFO L93 Difference]: Finished difference Result 8646 states and 19530 transitions. [2018-12-09 02:00:26,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:00:26,234 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 02:00:26,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:26,239 INFO L225 Difference]: With dead ends: 8646 [2018-12-09 02:00:26,239 INFO L226 Difference]: Without dead ends: 8646 [2018-12-09 02:00:26,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:00:26,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8646 states. [2018-12-09 02:00:26,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8646 to 6635. [2018-12-09 02:00:26,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6635 states. [2018-12-09 02:00:26,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6635 states to 6635 states and 15091 transitions. [2018-12-09 02:00:26,295 INFO L78 Accepts]: Start accepts. Automaton has 6635 states and 15091 transitions. Word has length 94 [2018-12-09 02:00:26,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:26,295 INFO L480 AbstractCegarLoop]: Abstraction has 6635 states and 15091 transitions. [2018-12-09 02:00:26,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:00:26,295 INFO L276 IsEmpty]: Start isEmpty. Operand 6635 states and 15091 transitions. [2018-12-09 02:00:26,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 02:00:26,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:26,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:26,300 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:26,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:26,300 INFO L82 PathProgramCache]: Analyzing trace with hash -209217009, now seen corresponding path program 1 times [2018-12-09 02:00:26,300 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:26,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:26,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:26,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:26,301 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:26,330 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 02:00:26,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:26,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:00:26,330 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:26,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:00:26,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:00:26,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:00:26,330 INFO L87 Difference]: Start difference. First operand 6635 states and 15091 transitions. Second operand 5 states. [2018-12-09 02:00:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:26,593 INFO L93 Difference]: Finished difference Result 10801 states and 24708 transitions. [2018-12-09 02:00:26,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 02:00:26,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2018-12-09 02:00:26,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:26,600 INFO L225 Difference]: With dead ends: 10801 [2018-12-09 02:00:26,600 INFO L226 Difference]: Without dead ends: 10723 [2018-12-09 02:00:26,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 02:00:26,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10723 states. [2018-12-09 02:00:26,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10723 to 7776. [2018-12-09 02:00:26,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7776 states. [2018-12-09 02:00:26,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7776 states to 7776 states and 17738 transitions. [2018-12-09 02:00:26,666 INFO L78 Accepts]: Start accepts. Automaton has 7776 states and 17738 transitions. Word has length 94 [2018-12-09 02:00:26,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:26,666 INFO L480 AbstractCegarLoop]: Abstraction has 7776 states and 17738 transitions. [2018-12-09 02:00:26,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:00:26,666 INFO L276 IsEmpty]: Start isEmpty. Operand 7776 states and 17738 transitions. [2018-12-09 02:00:26,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 02:00:26,671 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:26,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:26,671 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:26,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:26,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1035547472, now seen corresponding path program 1 times [2018-12-09 02:00:26,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:26,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:26,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:26,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:26,672 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:26,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:26,724 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 02:00:26,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:26,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:00:26,724 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:26,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:00:26,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:00:26,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:00:26,725 INFO L87 Difference]: Start difference. First operand 7776 states and 17738 transitions. Second operand 6 states. [2018-12-09 02:00:26,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:26,923 INFO L93 Difference]: Finished difference Result 9783 states and 22140 transitions. [2018-12-09 02:00:26,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 02:00:26,923 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 02:00:26,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:26,930 INFO L225 Difference]: With dead ends: 9783 [2018-12-09 02:00:26,930 INFO L226 Difference]: Without dead ends: 9704 [2018-12-09 02:00:26,930 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 02:00:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9704 states. [2018-12-09 02:00:26,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9704 to 7375. [2018-12-09 02:00:26,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7375 states. [2018-12-09 02:00:26,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7375 states to 7375 states and 16848 transitions. [2018-12-09 02:00:26,997 INFO L78 Accepts]: Start accepts. Automaton has 7375 states and 16848 transitions. Word has length 94 [2018-12-09 02:00:26,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:26,997 INFO L480 AbstractCegarLoop]: Abstraction has 7375 states and 16848 transitions. [2018-12-09 02:00:26,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:00:26,997 INFO L276 IsEmpty]: Start isEmpty. Operand 7375 states and 16848 transitions. [2018-12-09 02:00:27,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 02:00:27,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:27,003 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:27,003 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:27,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:27,003 INFO L82 PathProgramCache]: Analyzing trace with hash -202429449, now seen corresponding path program 1 times [2018-12-09 02:00:27,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:27,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:27,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:27,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:27,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:27,075 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 02:00:27,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:27,076 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 02:00:27,076 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:27,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 02:00:27,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 02:00:27,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-09 02:00:27,076 INFO L87 Difference]: Start difference. First operand 7375 states and 16848 transitions. Second operand 9 states. [2018-12-09 02:00:27,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:27,393 INFO L93 Difference]: Finished difference Result 10375 states and 23670 transitions. [2018-12-09 02:00:27,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 02:00:27,393 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 94 [2018-12-09 02:00:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:27,400 INFO L225 Difference]: With dead ends: 10375 [2018-12-09 02:00:27,400 INFO L226 Difference]: Without dead ends: 10343 [2018-12-09 02:00:27,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=245, Unknown=0, NotChecked=0, Total=306 [2018-12-09 02:00:27,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10343 states. [2018-12-09 02:00:27,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10343 to 9164. [2018-12-09 02:00:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9164 states. [2018-12-09 02:00:27,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9164 states to 9164 states and 20930 transitions. [2018-12-09 02:00:27,471 INFO L78 Accepts]: Start accepts. Automaton has 9164 states and 20930 transitions. Word has length 94 [2018-12-09 02:00:27,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:27,472 INFO L480 AbstractCegarLoop]: Abstraction has 9164 states and 20930 transitions. [2018-12-09 02:00:27,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 02:00:27,472 INFO L276 IsEmpty]: Start isEmpty. Operand 9164 states and 20930 transitions. [2018-12-09 02:00:27,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 02:00:27,478 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:27,478 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:27,479 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:27,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:27,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1999380808, now seen corresponding path program 1 times [2018-12-09 02:00:27,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:27,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:27,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:27,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:27,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:27,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:27,544 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 02:00:27,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:27,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 02:00:27,545 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:27,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 02:00:27,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 02:00:27,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:00:27,545 INFO L87 Difference]: Start difference. First operand 9164 states and 20930 transitions. Second operand 8 states. [2018-12-09 02:00:27,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:27,793 INFO L93 Difference]: Finished difference Result 14572 states and 33838 transitions. [2018-12-09 02:00:27,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 02:00:27,793 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 94 [2018-12-09 02:00:27,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:27,803 INFO L225 Difference]: With dead ends: 14572 [2018-12-09 02:00:27,803 INFO L226 Difference]: Without dead ends: 14572 [2018-12-09 02:00:27,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 02:00:27,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14572 states. [2018-12-09 02:00:27,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14572 to 9802. [2018-12-09 02:00:27,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9802 states. [2018-12-09 02:00:27,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9802 states to 9802 states and 22597 transitions. [2018-12-09 02:00:27,895 INFO L78 Accepts]: Start accepts. Automaton has 9802 states and 22597 transitions. Word has length 94 [2018-12-09 02:00:27,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:27,896 INFO L480 AbstractCegarLoop]: Abstraction has 9802 states and 22597 transitions. [2018-12-09 02:00:27,896 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 02:00:27,896 INFO L276 IsEmpty]: Start isEmpty. Operand 9802 states and 22597 transitions. [2018-12-09 02:00:27,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 02:00:27,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:27,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:27,903 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:27,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:27,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1111877127, now seen corresponding path program 1 times [2018-12-09 02:00:27,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:27,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:27,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:27,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:27,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:27,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:27,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 02:00:27,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:27,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 02:00:27,980 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:27,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 02:00:27,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 02:00:27,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 02:00:27,980 INFO L87 Difference]: Start difference. First operand 9802 states and 22597 transitions. Second operand 7 states. [2018-12-09 02:00:28,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:28,090 INFO L93 Difference]: Finished difference Result 13733 states and 31919 transitions. [2018-12-09 02:00:28,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:00:28,090 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 94 [2018-12-09 02:00:28,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:28,100 INFO L225 Difference]: With dead ends: 13733 [2018-12-09 02:00:28,100 INFO L226 Difference]: Without dead ends: 13733 [2018-12-09 02:00:28,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 02:00:28,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13733 states. [2018-12-09 02:00:28,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13733 to 9882. [2018-12-09 02:00:28,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9882 states. [2018-12-09 02:00:28,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9882 states to 9882 states and 22528 transitions. [2018-12-09 02:00:28,187 INFO L78 Accepts]: Start accepts. Automaton has 9882 states and 22528 transitions. Word has length 94 [2018-12-09 02:00:28,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:28,187 INFO L480 AbstractCegarLoop]: Abstraction has 9882 states and 22528 transitions. [2018-12-09 02:00:28,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 02:00:28,187 INFO L276 IsEmpty]: Start isEmpty. Operand 9882 states and 22528 transitions. [2018-12-09 02:00:28,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-09 02:00:28,194 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:28,194 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:28,194 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:28,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:28,195 INFO L82 PathProgramCache]: Analyzing trace with hash 1451114617, now seen corresponding path program 1 times [2018-12-09 02:00:28,195 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:28,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:28,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:28,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:28,196 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:28,283 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 02:00:28,283 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:28,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:00:28,283 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:28,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:00:28,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:00:28,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:00:28,283 INFO L87 Difference]: Start difference. First operand 9882 states and 22528 transitions. Second operand 6 states. [2018-12-09 02:00:28,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:28,354 INFO L93 Difference]: Finished difference Result 9610 states and 21576 transitions. [2018-12-09 02:00:28,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 02:00:28,355 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-12-09 02:00:28,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:28,361 INFO L225 Difference]: With dead ends: 9610 [2018-12-09 02:00:28,361 INFO L226 Difference]: Without dead ends: 9610 [2018-12-09 02:00:28,361 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 02:00:28,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9610 states. [2018-12-09 02:00:28,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9610 to 5823. [2018-12-09 02:00:28,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5823 states. [2018-12-09 02:00:28,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5823 states to 5823 states and 13050 transitions. [2018-12-09 02:00:28,417 INFO L78 Accepts]: Start accepts. Automaton has 5823 states and 13050 transitions. Word has length 94 [2018-12-09 02:00:28,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:28,417 INFO L480 AbstractCegarLoop]: Abstraction has 5823 states and 13050 transitions. [2018-12-09 02:00:28,417 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:00:28,417 INFO L276 IsEmpty]: Start isEmpty. Operand 5823 states and 13050 transitions. [2018-12-09 02:00:28,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:00:28,421 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:28,421 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:28,421 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:28,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:28,421 INFO L82 PathProgramCache]: Analyzing trace with hash 322215098, now seen corresponding path program 1 times [2018-12-09 02:00:28,421 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:28,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:28,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:28,422 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:28,422 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:28,513 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 02:00:28,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:28,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 02:00:28,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:28,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 02:00:28,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 02:00:28,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 02:00:28,514 INFO L87 Difference]: Start difference. First operand 5823 states and 13050 transitions. Second operand 9 states. [2018-12-09 02:00:28,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:28,773 INFO L93 Difference]: Finished difference Result 6968 states and 15490 transitions. [2018-12-09 02:00:28,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 02:00:28,773 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 96 [2018-12-09 02:00:28,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:28,777 INFO L225 Difference]: With dead ends: 6968 [2018-12-09 02:00:28,777 INFO L226 Difference]: Without dead ends: 6968 [2018-12-09 02:00:28,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-12-09 02:00:28,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6968 states. [2018-12-09 02:00:28,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6968 to 6729. [2018-12-09 02:00:28,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6729 states. [2018-12-09 02:00:28,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6729 states to 6729 states and 15021 transitions. [2018-12-09 02:00:28,823 INFO L78 Accepts]: Start accepts. Automaton has 6729 states and 15021 transitions. Word has length 96 [2018-12-09 02:00:28,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:28,823 INFO L480 AbstractCegarLoop]: Abstraction has 6729 states and 15021 transitions. [2018-12-09 02:00:28,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 02:00:28,824 INFO L276 IsEmpty]: Start isEmpty. Operand 6729 states and 15021 transitions. [2018-12-09 02:00:28,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:00:28,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:28,828 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:28,828 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:28,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:28,828 INFO L82 PathProgramCache]: Analyzing trace with hash 1209718779, now seen corresponding path program 1 times [2018-12-09 02:00:28,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:28,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:28,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:28,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:28,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:28,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:28,919 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 02:00:28,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:28,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-09 02:00:28,920 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:28,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-09 02:00:28,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-09 02:00:28,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-09 02:00:28,920 INFO L87 Difference]: Start difference. First operand 6729 states and 15021 transitions. Second operand 11 states. [2018-12-09 02:00:29,479 WARN L180 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2018-12-09 02:00:31,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:31,081 INFO L93 Difference]: Finished difference Result 12990 states and 29183 transitions. [2018-12-09 02:00:31,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 02:00:31,081 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2018-12-09 02:00:31,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:31,095 INFO L225 Difference]: With dead ends: 12990 [2018-12-09 02:00:31,096 INFO L226 Difference]: Without dead ends: 8864 [2018-12-09 02:00:31,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=376, Unknown=0, NotChecked=0, Total=462 [2018-12-09 02:00:31,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8864 states. [2018-12-09 02:00:31,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8864 to 6572. [2018-12-09 02:00:31,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6572 states. [2018-12-09 02:00:31,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6572 states to 6572 states and 14628 transitions. [2018-12-09 02:00:31,162 INFO L78 Accepts]: Start accepts. Automaton has 6572 states and 14628 transitions. Word has length 96 [2018-12-09 02:00:31,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:31,162 INFO L480 AbstractCegarLoop]: Abstraction has 6572 states and 14628 transitions. [2018-12-09 02:00:31,163 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-09 02:00:31,163 INFO L276 IsEmpty]: Start isEmpty. Operand 6572 states and 14628 transitions. [2018-12-09 02:00:31,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:00:31,167 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:31,167 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:31,167 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:31,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:31,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1847691802, now seen corresponding path program 1 times [2018-12-09 02:00:31,167 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:31,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:31,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:31,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:31,169 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:31,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:31,228 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 02:00:31,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:31,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 02:00:31,228 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:31,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 02:00:31,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 02:00:31,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 02:00:31,229 INFO L87 Difference]: Start difference. First operand 6572 states and 14628 transitions. Second operand 5 states. [2018-12-09 02:00:31,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:31,340 INFO L93 Difference]: Finished difference Result 5952 states and 13080 transitions. [2018-12-09 02:00:31,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 02:00:31,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2018-12-09 02:00:31,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:31,344 INFO L225 Difference]: With dead ends: 5952 [2018-12-09 02:00:31,344 INFO L226 Difference]: Without dead ends: 5931 [2018-12-09 02:00:31,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:00:31,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5931 states. [2018-12-09 02:00:31,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5931 to 5552. [2018-12-09 02:00:31,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5552 states. [2018-12-09 02:00:31,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5552 states to 5552 states and 12239 transitions. [2018-12-09 02:00:31,381 INFO L78 Accepts]: Start accepts. Automaton has 5552 states and 12239 transitions. Word has length 96 [2018-12-09 02:00:31,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:31,381 INFO L480 AbstractCegarLoop]: Abstraction has 5552 states and 12239 transitions. [2018-12-09 02:00:31,381 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 02:00:31,381 INFO L276 IsEmpty]: Start isEmpty. Operand 5552 states and 12239 transitions. [2018-12-09 02:00:31,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:00:31,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:31,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:31,385 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:31,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:31,385 INFO L82 PathProgramCache]: Analyzing trace with hash -157130344, now seen corresponding path program 2 times [2018-12-09 02:00:31,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:31,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:31,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:31,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:31,386 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:31,431 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 02:00:31,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:31,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 02:00:31,431 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:31,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 02:00:31,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 02:00:31,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 02:00:31,431 INFO L87 Difference]: Start difference. First operand 5552 states and 12239 transitions. Second operand 6 states. [2018-12-09 02:00:31,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:31,590 INFO L93 Difference]: Finished difference Result 6325 states and 13928 transitions. [2018-12-09 02:00:31,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 02:00:31,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-12-09 02:00:31,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:31,594 INFO L225 Difference]: With dead ends: 6325 [2018-12-09 02:00:31,594 INFO L226 Difference]: Without dead ends: 6283 [2018-12-09 02:00:31,595 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:00:31,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6283 states. [2018-12-09 02:00:31,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6283 to 5716. [2018-12-09 02:00:31,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5716 states. [2018-12-09 02:00:31,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5716 states to 5716 states and 12591 transitions. [2018-12-09 02:00:31,632 INFO L78 Accepts]: Start accepts. Automaton has 5716 states and 12591 transitions. Word has length 96 [2018-12-09 02:00:31,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:31,633 INFO L480 AbstractCegarLoop]: Abstraction has 5716 states and 12591 transitions. [2018-12-09 02:00:31,633 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 02:00:31,633 INFO L276 IsEmpty]: Start isEmpty. Operand 5716 states and 12591 transitions. [2018-12-09 02:00:31,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:00:31,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:31,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:31,636 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:31,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:31,636 INFO L82 PathProgramCache]: Analyzing trace with hash -188789864, now seen corresponding path program 1 times [2018-12-09 02:00:31,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:31,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:31,637 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 02:00:31,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:31,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:31,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 02:00:31,709 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 02:00:31,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 02:00:31,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 02:00:31,710 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 02:00:31,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 02:00:31,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 02:00:31,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 02:00:31,710 INFO L87 Difference]: Start difference. First operand 5716 states and 12591 transitions. Second operand 8 states. [2018-12-09 02:00:32,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 02:00:32,069 INFO L93 Difference]: Finished difference Result 8744 states and 19221 transitions. [2018-12-09 02:00:32,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 02:00:32,069 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2018-12-09 02:00:32,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 02:00:32,075 INFO L225 Difference]: With dead ends: 8744 [2018-12-09 02:00:32,075 INFO L226 Difference]: Without dead ends: 8704 [2018-12-09 02:00:32,075 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2018-12-09 02:00:32,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8704 states. [2018-12-09 02:00:32,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8704 to 6232. [2018-12-09 02:00:32,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6232 states. [2018-12-09 02:00:32,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6232 states to 6232 states and 13667 transitions. [2018-12-09 02:00:32,128 INFO L78 Accepts]: Start accepts. Automaton has 6232 states and 13667 transitions. Word has length 96 [2018-12-09 02:00:32,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 02:00:32,128 INFO L480 AbstractCegarLoop]: Abstraction has 6232 states and 13667 transitions. [2018-12-09 02:00:32,128 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 02:00:32,128 INFO L276 IsEmpty]: Start isEmpty. Operand 6232 states and 13667 transitions. [2018-12-09 02:00:32,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-09 02:00:32,132 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 02:00:32,132 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 02:00:32,132 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 02:00:32,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 02:00:32,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2028968089, now seen corresponding path program 2 times [2018-12-09 02:00:32,132 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 02:00:32,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:32,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 02:00:32,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 02:00:32,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 02:00:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:00:32,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 02:00:32,169 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 02:00:32,238 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 02:00:32,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 02:00:32 BasicIcfg [2018-12-09 02:00:32,239 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 02:00:32,239 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 02:00:32,239 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 02:00:32,239 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 02:00:32,240 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 02:00:06" (3/4) ... [2018-12-09 02:00:32,241 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 02:00:32,313 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c23fa592-4d59-410a-bc82-a7e641c4a7ec/bin-2019/utaipan/witness.graphml [2018-12-09 02:00:32,313 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 02:00:32,313 INFO L168 Benchmark]: Toolchain (without parser) took 26165.84 ms. Allocated memory was 1.0 GB in the beginning and 3.9 GB in the end (delta: 2.8 GB). Free memory was 945.9 MB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 795.8 MB. Max. memory is 11.5 GB. [2018-12-09 02:00:32,314 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:00:32,314 INFO L168 Benchmark]: CACSL2BoogieTranslator took 377.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -131.2 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-12-09 02:00:32,314 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 02:00:32,314 INFO L168 Benchmark]: Boogie Preprocessor took 18.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:00:32,315 INFO L168 Benchmark]: RCFGBuilder took 324.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. [2018-12-09 02:00:32,315 INFO L168 Benchmark]: TraceAbstraction took 25339.01 ms. Allocated memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 778.1 MB. Max. memory is 11.5 GB. [2018-12-09 02:00:32,315 INFO L168 Benchmark]: Witness Printer took 73.71 ms. Allocated memory is still 3.9 GB. Free memory is still 3.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 02:00:32,316 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 377.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 99.1 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -131.2 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.93 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 324.53 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 47.2 MB). Peak memory consumption was 47.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25339.01 ms. Allocated memory was 1.1 GB in the beginning and 3.9 GB in the end (delta: 2.7 GB). Free memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: -1.9 GB). Peak memory consumption was 778.1 MB. Max. memory is 11.5 GB. * Witness Printer took 73.71 ms. Allocated memory is still 3.9 GB. Free memory is still 3.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L683] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L684] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L685] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L686] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L687] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L688] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L689] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L690] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L691] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L692] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L693] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L694] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L695] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L696] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L697] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L698] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L699] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L778] -1 pthread_t t1099; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L779] FCALL, FORK -1 pthread_create(&t1099, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L703] 0 z$w_buff1 = z$w_buff0 [L704] 0 z$w_buff0 = 1 [L705] 0 z$w_buff1_used = z$w_buff0_used [L706] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L708] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L709] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L710] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L711] 0 z$r_buff0_thd1 = (_Bool)1 [L714] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L717] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] -1 pthread_t t1100; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] FCALL, FORK -1 pthread_create(&t1100, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 x = 2 [L734] 1 y = 1 [L737] 1 __unbuffered_p1_EAX = y [L740] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L741] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L742] 1 z$flush_delayed = weak$$choice2 [L743] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L745] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L746] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L747] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L750] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L717] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L752] 1 z = z$flush_delayed ? z$mem_tmp : z [L753] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L756] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L756] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L757] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L758] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L718] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L718] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L719] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L719] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L720] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L720] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L721] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L721] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L724] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L788] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L789] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L790] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L791] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L791] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 223 locations, 3 error locations. UNSAFE Result, 25.2s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 12.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9641 SDtfs, 10779 SDslu, 22577 SDs, 0 SdLazy, 10100 SolverSat, 594 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 372 GetRequests, 92 SyntacticMatches, 32 SemanticMatches, 248 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 292 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74881occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.9s AutomataMinimizationTime, 35 MinimizatonAttempts, 177433 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 2700 NumberOfCodeBlocks, 2700 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2569 ConstructedInterpolants, 0 QuantifiedInterpolants, 599295 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...