./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi004_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_79c28e10-57a5-44d3-be9b-6a96aa4f358e/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_79c28e10-57a5-44d3-be9b-6a96aa4f358e/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_79c28e10-57a5-44d3-be9b-6a96aa4f358e/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_79c28e10-57a5-44d3-be9b-6a96aa4f358e/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi004_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_79c28e10-57a5-44d3-be9b-6a96aa4f358e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_79c28e10-57a5-44d3-be9b-6a96aa4f358e/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 876454da50381170b67bfde0914077310251dbb9 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 02:30:40,103 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 02:30:40,104 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 02:30:40,110 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 02:30:40,110 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 02:30:40,111 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 02:30:40,111 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 02:30:40,112 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 02:30:40,113 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 02:30:40,113 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 02:30:40,114 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 02:30:40,114 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 02:30:40,115 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 02:30:40,115 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 02:30:40,116 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 02:30:40,116 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 02:30:40,117 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 02:30:40,117 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 02:30:40,118 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 02:30:40,119 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 02:30:40,120 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 02:30:40,120 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 02:30:40,122 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 02:30:40,122 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 02:30:40,122 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 02:30:40,122 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 02:30:40,123 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 02:30:40,123 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 02:30:40,124 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 02:30:40,124 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 02:30:40,124 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 02:30:40,125 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 02:30:40,125 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 02:30:40,125 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 02:30:40,126 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 02:30:40,126 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 02:30:40,126 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_79c28e10-57a5-44d3-be9b-6a96aa4f358e/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 02:30:40,133 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 02:30:40,134 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 02:30:40,134 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 02:30:40,134 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 02:30:40,134 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 02:30:40,134 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 02:30:40,135 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 02:30:40,135 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 02:30:40,135 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 02:30:40,135 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 02:30:40,135 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 02:30:40,135 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 02:30:40,135 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 02:30:40,136 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 02:30:40,136 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 02:30:40,136 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 02:30:40,136 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 02:30:40,136 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 02:30:40,136 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 02:30:40,136 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 02:30:40,137 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 02:30:40,137 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 02:30:40,137 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 02:30:40,137 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 02:30:40,137 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 02:30:40,137 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 02:30:40,137 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 02:30:40,137 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 02:30:40,137 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:30:40,138 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 02:30:40,138 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 02:30:40,138 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 02:30:40,138 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 02:30:40,138 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 02:30:40,138 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 02:30:40,138 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 02:30:40,138 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_79c28e10-57a5-44d3-be9b-6a96aa4f358e/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 -> 876454da50381170b67bfde0914077310251dbb9 [2018-12-03 02:30:40,156 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 02:30:40,163 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 02:30:40,165 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 02:30:40,166 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 02:30:40,166 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 02:30:40,166 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_79c28e10-57a5-44d3-be9b-6a96aa4f358e/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi004_power.opt_false-unreach-call.i [2018-12-03 02:30:40,200 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_79c28e10-57a5-44d3-be9b-6a96aa4f358e/bin-2019/utaipan/data/f0b71e542/7bcc2cb7a3ff4244886ec21b34791cc2/FLAGe8cb5bf46 [2018-12-03 02:30:40,684 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 02:30:40,685 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_79c28e10-57a5-44d3-be9b-6a96aa4f358e/sv-benchmarks/c/pthread-wmm/rfi004_power.opt_false-unreach-call.i [2018-12-03 02:30:40,692 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_79c28e10-57a5-44d3-be9b-6a96aa4f358e/bin-2019/utaipan/data/f0b71e542/7bcc2cb7a3ff4244886ec21b34791cc2/FLAGe8cb5bf46 [2018-12-03 02:30:41,186 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_79c28e10-57a5-44d3-be9b-6a96aa4f358e/bin-2019/utaipan/data/f0b71e542/7bcc2cb7a3ff4244886ec21b34791cc2 [2018-12-03 02:30:41,188 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 02:30:41,189 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 02:30:41,190 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 02:30:41,190 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 02:30:41,192 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 02:30:41,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:30:41" (1/1) ... [2018-12-03 02:30:41,195 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e282df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:41, skipping insertion in model container [2018-12-03 02:30:41,195 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 02:30:41" (1/1) ... [2018-12-03 02:30:41,200 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 02:30:41,222 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 02:30:41,395 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:30:41,402 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 02:30:41,476 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 02:30:41,515 INFO L195 MainTranslator]: Completed translation [2018-12-03 02:30:41,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:41 WrapperNode [2018-12-03 02:30:41,515 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 02:30:41,516 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 02:30:41,516 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 02:30:41,516 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 02:30:41,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:41" (1/1) ... [2018-12-03 02:30:41,532 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:41" (1/1) ... [2018-12-03 02:30:41,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 02:30:41,548 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 02:30:41,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 02:30:41,548 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 02:30:41,554 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:41" (1/1) ... [2018-12-03 02:30:41,554 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:41" (1/1) ... [2018-12-03 02:30:41,556 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:41" (1/1) ... [2018-12-03 02:30:41,556 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:41" (1/1) ... [2018-12-03 02:30:41,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:41" (1/1) ... [2018-12-03 02:30:41,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:41" (1/1) ... [2018-12-03 02:30:41,564 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:41" (1/1) ... [2018-12-03 02:30:41,566 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 02:30:41,567 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 02:30:41,567 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 02:30:41,567 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 02:30:41,567 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_79c28e10-57a5-44d3-be9b-6a96aa4f358e/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 02:30:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 02:30:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 02:30:41,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 02:30:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 02:30:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 02:30:41,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 02:30:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 02:30:41,601 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 02:30:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 02:30:41,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 02:30:41,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 02:30:41,602 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 02:30:41,892 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 02:30:41,892 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 02:30:41,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:30:41 BoogieIcfgContainer [2018-12-03 02:30:41,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 02:30:41,893 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 02:30:41,893 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 02:30:41,895 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 02:30:41,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 02:30:41" (1/3) ... [2018-12-03 02:30:41,895 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3348edcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:30:41, skipping insertion in model container [2018-12-03 02:30:41,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 02:30:41" (2/3) ... [2018-12-03 02:30:41,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3348edcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 02:30:41, skipping insertion in model container [2018-12-03 02:30:41,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:30:41" (3/3) ... [2018-12-03 02:30:41,897 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi004_power.opt_false-unreach-call.i [2018-12-03 02:30:41,919 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,919 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,919 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,920 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,920 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,920 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,921 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,922 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,923 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,924 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,925 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,926 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,928 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,929 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,930 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,930 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,930 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,930 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,930 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,930 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,930 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,930 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,930 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,930 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,931 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,931 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,931 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,931 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,932 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,933 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,933 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,933 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,933 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,933 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,933 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,933 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,933 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,933 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,933 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,934 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,934 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 02:30:41,937 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 02:30:41,937 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 02:30:41,942 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 02:30:41,951 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 02:30:41,966 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 02:30:41,966 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 02:30:41,966 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 02:30:41,966 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 02:30:41,967 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 02:30:41,967 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 02:30:41,967 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 02:30:41,967 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 02:30:41,973 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 132places, 164 transitions [2018-12-03 02:30:43,146 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27856 states. [2018-12-03 02:30:43,147 INFO L276 IsEmpty]: Start isEmpty. Operand 27856 states. [2018-12-03 02:30:43,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-03 02:30:43,153 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:43,153 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] [2018-12-03 02:30:43,155 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:30:43,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:43,158 INFO L82 PathProgramCache]: Analyzing trace with hash -31372928, now seen corresponding path program 1 times [2018-12-03 02:30:43,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:43,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:43,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:43,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:43,194 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:43,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:43,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:43,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:43,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:30:43,292 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:43,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:30:43,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:30:43,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:30:43,304 INFO L87 Difference]: Start difference. First operand 27856 states. Second operand 4 states. [2018-12-03 02:30:43,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:43,665 INFO L93 Difference]: Finished difference Result 47768 states and 183119 transitions. [2018-12-03 02:30:43,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:30:43,666 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-03 02:30:43,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:43,812 INFO L225 Difference]: With dead ends: 47768 [2018-12-03 02:30:43,813 INFO L226 Difference]: Without dead ends: 34608 [2018-12-03 02:30:43,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:30:44,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34608 states. [2018-12-03 02:30:44,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34608 to 21756. [2018-12-03 02:30:44,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21756 states. [2018-12-03 02:30:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21756 states to 21756 states and 83441 transitions. [2018-12-03 02:30:44,454 INFO L78 Accepts]: Start accepts. Automaton has 21756 states and 83441 transitions. Word has length 39 [2018-12-03 02:30:44,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:44,454 INFO L480 AbstractCegarLoop]: Abstraction has 21756 states and 83441 transitions. [2018-12-03 02:30:44,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:30:44,454 INFO L276 IsEmpty]: Start isEmpty. Operand 21756 states and 83441 transitions. [2018-12-03 02:30:44,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-03 02:30:44,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:44,459 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:44,459 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:30:44,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:44,460 INFO L82 PathProgramCache]: Analyzing trace with hash -954263015, now seen corresponding path program 1 times [2018-12-03 02:30:44,460 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:44,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:44,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:44,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:44,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:44,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:44,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:30:44,510 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:44,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:30:44,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:30:44,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:30:44,512 INFO L87 Difference]: Start difference. First operand 21756 states and 83441 transitions. Second operand 5 states. [2018-12-03 02:30:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:45,091 INFO L93 Difference]: Finished difference Result 47634 states and 173802 transitions. [2018-12-03 02:30:45,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:30:45,092 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-03 02:30:45,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:45,185 INFO L225 Difference]: With dead ends: 47634 [2018-12-03 02:30:45,185 INFO L226 Difference]: Without dead ends: 47066 [2018-12-03 02:30:45,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:30:45,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47066 states. [2018-12-03 02:30:45,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47066 to 31796. [2018-12-03 02:30:45,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31796 states. [2018-12-03 02:30:45,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31796 states to 31796 states and 116819 transitions. [2018-12-03 02:30:45,841 INFO L78 Accepts]: Start accepts. Automaton has 31796 states and 116819 transitions. Word has length 47 [2018-12-03 02:30:45,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:45,842 INFO L480 AbstractCegarLoop]: Abstraction has 31796 states and 116819 transitions. [2018-12-03 02:30:45,842 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:30:45,842 INFO L276 IsEmpty]: Start isEmpty. Operand 31796 states and 116819 transitions. [2018-12-03 02:30:45,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-03 02:30:45,845 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:45,845 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] [2018-12-03 02:30:45,845 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:30:45,845 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:45,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1367871073, now seen corresponding path program 1 times [2018-12-03 02:30:45,845 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:45,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:45,848 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:45,848 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:45,848 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:45,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:45,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:45,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:30:45,888 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:45,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:30:45,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:30:45,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:30:45,889 INFO L87 Difference]: Start difference. First operand 31796 states and 116819 transitions. Second operand 5 states. [2018-12-03 02:30:46,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:46,248 INFO L93 Difference]: Finished difference Result 63028 states and 229114 transitions. [2018-12-03 02:30:46,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:30:46,249 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-03 02:30:46,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:46,367 INFO L225 Difference]: With dead ends: 63028 [2018-12-03 02:30:46,368 INFO L226 Difference]: Without dead ends: 62564 [2018-12-03 02:30:46,368 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:30:46,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62564 states. [2018-12-03 02:30:47,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62564 to 35364. [2018-12-03 02:30:47,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35364 states. [2018-12-03 02:30:47,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35364 states to 35364 states and 128877 transitions. [2018-12-03 02:30:47,242 INFO L78 Accepts]: Start accepts. Automaton has 35364 states and 128877 transitions. Word has length 48 [2018-12-03 02:30:47,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:47,243 INFO L480 AbstractCegarLoop]: Abstraction has 35364 states and 128877 transitions. [2018-12-03 02:30:47,243 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:30:47,243 INFO L276 IsEmpty]: Start isEmpty. Operand 35364 states and 128877 transitions. [2018-12-03 02:30:47,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 02:30:47,247 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:47,247 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:47,247 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:30:47,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:47,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1372813561, now seen corresponding path program 1 times [2018-12-03 02:30:47,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:47,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:47,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:47,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:47,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:47,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:47,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:47,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:47,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:30:47,271 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:47,271 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:30:47,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:30:47,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:30:47,272 INFO L87 Difference]: Start difference. First operand 35364 states and 128877 transitions. Second operand 3 states. [2018-12-03 02:30:47,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:47,420 INFO L93 Difference]: Finished difference Result 45910 states and 163945 transitions. [2018-12-03 02:30:47,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:30:47,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 02:30:47,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:47,494 INFO L225 Difference]: With dead ends: 45910 [2018-12-03 02:30:47,494 INFO L226 Difference]: Without dead ends: 45910 [2018-12-03 02:30:47,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:30:47,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45910 states. [2018-12-03 02:30:48,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45910 to 40247. [2018-12-03 02:30:48,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40247 states. [2018-12-03 02:30:48,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40247 states to 40247 states and 145215 transitions. [2018-12-03 02:30:48,268 INFO L78 Accepts]: Start accepts. Automaton has 40247 states and 145215 transitions. Word has length 50 [2018-12-03 02:30:48,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:48,268 INFO L480 AbstractCegarLoop]: Abstraction has 40247 states and 145215 transitions. [2018-12-03 02:30:48,268 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:30:48,268 INFO L276 IsEmpty]: Start isEmpty. Operand 40247 states and 145215 transitions. [2018-12-03 02:30:48,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 02:30:48,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:48,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:48,276 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:30:48,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:48,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1505170194, now seen corresponding path program 1 times [2018-12-03 02:30:48,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:48,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:48,278 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:48,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:48,278 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:48,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:48,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-03 02:30:48,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:48,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:30:48,330 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:48,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:30:48,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:30:48,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:30:48,331 INFO L87 Difference]: Start difference. First operand 40247 states and 145215 transitions. Second operand 6 states. [2018-12-03 02:30:48,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:48,780 INFO L93 Difference]: Finished difference Result 70850 states and 252355 transitions. [2018-12-03 02:30:48,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 02:30:48,781 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-03 02:30:48,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:48,900 INFO L225 Difference]: With dead ends: 70850 [2018-12-03 02:30:48,900 INFO L226 Difference]: Without dead ends: 70314 [2018-12-03 02:30:48,900 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-03 02:30:49,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70314 states. [2018-12-03 02:30:49,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70314 to 40898. [2018-12-03 02:30:49,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40898 states. [2018-12-03 02:30:49,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40898 states to 40898 states and 147668 transitions. [2018-12-03 02:30:49,667 INFO L78 Accepts]: Start accepts. Automaton has 40898 states and 147668 transitions. Word has length 54 [2018-12-03 02:30:49,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:49,667 INFO L480 AbstractCegarLoop]: Abstraction has 40898 states and 147668 transitions. [2018-12-03 02:30:49,667 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:30:49,667 INFO L276 IsEmpty]: Start isEmpty. Operand 40898 states and 147668 transitions. [2018-12-03 02:30:49,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 02:30:49,674 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:49,674 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:49,674 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:30:49,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:49,674 INFO L82 PathProgramCache]: Analyzing trace with hash -1915358571, now seen corresponding path program 1 times [2018-12-03 02:30:49,675 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:49,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:49,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:49,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:49,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:49,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:49,741 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:49,741 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:30:49,741 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:49,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:30:49,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:30:49,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:30:49,741 INFO L87 Difference]: Start difference. First operand 40898 states and 147668 transitions. Second operand 6 states. [2018-12-03 02:30:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:50,311 INFO L93 Difference]: Finished difference Result 56599 states and 201648 transitions. [2018-12-03 02:30:50,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:30:50,312 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-03 02:30:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:50,402 INFO L225 Difference]: With dead ends: 56599 [2018-12-03 02:30:50,402 INFO L226 Difference]: Without dead ends: 55460 [2018-12-03 02:30:50,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:30:50,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55460 states. [2018-12-03 02:30:51,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55460 to 51955. [2018-12-03 02:30:51,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51955 states. [2018-12-03 02:30:51,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51955 states to 51955 states and 186007 transitions. [2018-12-03 02:30:51,179 INFO L78 Accepts]: Start accepts. Automaton has 51955 states and 186007 transitions. Word has length 54 [2018-12-03 02:30:51,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:51,179 INFO L480 AbstractCegarLoop]: Abstraction has 51955 states and 186007 transitions. [2018-12-03 02:30:51,179 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:30:51,179 INFO L276 IsEmpty]: Start isEmpty. Operand 51955 states and 186007 transitions. [2018-12-03 02:30:51,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 02:30:51,189 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:51,189 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:51,189 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:30:51,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:51,189 INFO L82 PathProgramCache]: Analyzing trace with hash 582657366, now seen corresponding path program 1 times [2018-12-03 02:30:51,189 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:51,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:51,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:51,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:51,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:51,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:51,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:51,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 02:30:51,238 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:51,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 02:30:51,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 02:30:51,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:30:51,239 INFO L87 Difference]: Start difference. First operand 51955 states and 186007 transitions. Second operand 7 states. [2018-12-03 02:30:51,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:51,877 INFO L93 Difference]: Finished difference Result 75638 states and 260104 transitions. [2018-12-03 02:30:51,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 02:30:51,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-03 02:30:51,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:51,999 INFO L225 Difference]: With dead ends: 75638 [2018-12-03 02:30:51,999 INFO L226 Difference]: Without dead ends: 75638 [2018-12-03 02:30:51,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:30:52,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75638 states. [2018-12-03 02:30:52,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75638 to 61473. [2018-12-03 02:30:52,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61473 states. [2018-12-03 02:30:53,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61473 states to 61473 states and 215184 transitions. [2018-12-03 02:30:53,017 INFO L78 Accepts]: Start accepts. Automaton has 61473 states and 215184 transitions. Word has length 54 [2018-12-03 02:30:53,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:53,017 INFO L480 AbstractCegarLoop]: Abstraction has 61473 states and 215184 transitions. [2018-12-03 02:30:53,017 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 02:30:53,017 INFO L276 IsEmpty]: Start isEmpty. Operand 61473 states and 215184 transitions. [2018-12-03 02:30:53,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-03 02:30:53,027 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:53,027 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:53,027 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:30:53,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:53,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1470161047, now seen corresponding path program 1 times [2018-12-03 02:30:53,027 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:53,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:53,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:53,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:53,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:53,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:53,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:53,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 02:30:53,060 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:53,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 02:30:53,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 02:30:53,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:30:53,060 INFO L87 Difference]: Start difference. First operand 61473 states and 215184 transitions. Second operand 3 states. [2018-12-03 02:30:53,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:53,205 INFO L93 Difference]: Finished difference Result 46767 states and 162434 transitions. [2018-12-03 02:30:53,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 02:30:53,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-03 02:30:53,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:53,284 INFO L225 Difference]: With dead ends: 46767 [2018-12-03 02:30:53,284 INFO L226 Difference]: Without dead ends: 46187 [2018-12-03 02:30:53,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 02:30:53,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46187 states. [2018-12-03 02:30:53,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46187 to 44422. [2018-12-03 02:30:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44422 states. [2018-12-03 02:30:53,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44422 states to 44422 states and 155155 transitions. [2018-12-03 02:30:53,922 INFO L78 Accepts]: Start accepts. Automaton has 44422 states and 155155 transitions. Word has length 54 [2018-12-03 02:30:53,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:53,923 INFO L480 AbstractCegarLoop]: Abstraction has 44422 states and 155155 transitions. [2018-12-03 02:30:53,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 02:30:53,923 INFO L276 IsEmpty]: Start isEmpty. Operand 44422 states and 155155 transitions. [2018-12-03 02:30:53,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 02:30:53,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:53,930 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:53,931 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:30:53,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:53,931 INFO L82 PathProgramCache]: Analyzing trace with hash -1915106411, now seen corresponding path program 1 times [2018-12-03 02:30:53,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:53,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:53,932 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:53,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:53,932 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:53,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:53,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:53,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:53,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:30:53,989 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:53,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:30:53,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:30:53,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:30:53,990 INFO L87 Difference]: Start difference. First operand 44422 states and 155155 transitions. Second operand 6 states. [2018-12-03 02:30:54,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:54,432 INFO L93 Difference]: Finished difference Result 58724 states and 198370 transitions. [2018-12-03 02:30:54,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:30:54,433 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-03 02:30:54,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:54,536 INFO L225 Difference]: With dead ends: 58724 [2018-12-03 02:30:54,536 INFO L226 Difference]: Without dead ends: 58724 [2018-12-03 02:30:54,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:30:54,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58724 states. [2018-12-03 02:30:55,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58724 to 48778. [2018-12-03 02:30:55,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48778 states. [2018-12-03 02:30:55,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48778 states to 48778 states and 167871 transitions. [2018-12-03 02:30:55,340 INFO L78 Accepts]: Start accepts. Automaton has 48778 states and 167871 transitions. Word has length 55 [2018-12-03 02:30:55,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:55,340 INFO L480 AbstractCegarLoop]: Abstraction has 48778 states and 167871 transitions. [2018-12-03 02:30:55,340 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:30:55,341 INFO L276 IsEmpty]: Start isEmpty. Operand 48778 states and 167871 transitions. [2018-12-03 02:30:55,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-03 02:30:55,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:55,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:55,348 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:30:55,348 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:55,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1027602730, now seen corresponding path program 1 times [2018-12-03 02:30:55,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:55,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:55,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:55,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:55,349 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:55,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:55,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:55,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:30:55,375 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:55,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:30:55,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:30:55,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:30:55,376 INFO L87 Difference]: Start difference. First operand 48778 states and 167871 transitions. Second operand 4 states. [2018-12-03 02:30:55,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:55,410 INFO L93 Difference]: Finished difference Result 10152 states and 31522 transitions. [2018-12-03 02:30:55,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:30:55,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-03 02:30:55,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:55,419 INFO L225 Difference]: With dead ends: 10152 [2018-12-03 02:30:55,419 INFO L226 Difference]: Without dead ends: 8646 [2018-12-03 02:30:55,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:30:55,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8646 states. [2018-12-03 02:30:55,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8646 to 8598. [2018-12-03 02:30:55,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8598 states. [2018-12-03 02:30:55,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8598 states to 8598 states and 26467 transitions. [2018-12-03 02:30:55,499 INFO L78 Accepts]: Start accepts. Automaton has 8598 states and 26467 transitions. Word has length 55 [2018-12-03 02:30:55,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:55,499 INFO L480 AbstractCegarLoop]: Abstraction has 8598 states and 26467 transitions. [2018-12-03 02:30:55,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:30:55,499 INFO L276 IsEmpty]: Start isEmpty. Operand 8598 states and 26467 transitions. [2018-12-03 02:30:55,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 02:30:55,502 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:55,502 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:55,502 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:30:55,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:55,502 INFO L82 PathProgramCache]: Analyzing trace with hash 2067258406, now seen corresponding path program 1 times [2018-12-03 02:30:55,503 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:55,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:55,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:55,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:55,504 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:55,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:55,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:55,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:55,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:30:55,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:55,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:30:55,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:30:55,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:30:55,531 INFO L87 Difference]: Start difference. First operand 8598 states and 26467 transitions. Second operand 4 states. [2018-12-03 02:30:55,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:55,614 INFO L93 Difference]: Finished difference Result 10217 states and 31174 transitions. [2018-12-03 02:30:55,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:30:55,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-03 02:30:55,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:55,624 INFO L225 Difference]: With dead ends: 10217 [2018-12-03 02:30:55,624 INFO L226 Difference]: Without dead ends: 10217 [2018-12-03 02:30:55,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:30:55,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10217 states. [2018-12-03 02:30:55,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10217 to 9249. [2018-12-03 02:30:55,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9249 states. [2018-12-03 02:30:55,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9249 states to 9249 states and 28328 transitions. [2018-12-03 02:30:55,716 INFO L78 Accepts]: Start accepts. Automaton has 9249 states and 28328 transitions. Word has length 64 [2018-12-03 02:30:55,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:55,716 INFO L480 AbstractCegarLoop]: Abstraction has 9249 states and 28328 transitions. [2018-12-03 02:30:55,716 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:30:55,716 INFO L276 IsEmpty]: Start isEmpty. Operand 9249 states and 28328 transitions. [2018-12-03 02:30:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-03 02:30:55,719 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:55,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:55,720 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:30:55,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:55,720 INFO L82 PathProgramCache]: Analyzing trace with hash -484898555, now seen corresponding path program 1 times [2018-12-03 02:30:55,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:55,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:55,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:55,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:55,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:55,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:55,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:30:55,765 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:55,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:30:55,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:30:55,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:30:55,765 INFO L87 Difference]: Start difference. First operand 9249 states and 28328 transitions. Second operand 6 states. [2018-12-03 02:30:55,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:55,956 INFO L93 Difference]: Finished difference Result 16143 states and 49321 transitions. [2018-12-03 02:30:55,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-03 02:30:55,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-03 02:30:55,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:55,973 INFO L225 Difference]: With dead ends: 16143 [2018-12-03 02:30:55,973 INFO L226 Difference]: Without dead ends: 16079 [2018-12-03 02:30:55,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:30:55,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16079 states. [2018-12-03 02:30:56,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16079 to 10330. [2018-12-03 02:30:56,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10330 states. [2018-12-03 02:30:56,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10330 states to 10330 states and 31497 transitions. [2018-12-03 02:30:56,097 INFO L78 Accepts]: Start accepts. Automaton has 10330 states and 31497 transitions. Word has length 64 [2018-12-03 02:30:56,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:56,097 INFO L480 AbstractCegarLoop]: Abstraction has 10330 states and 31497 transitions. [2018-12-03 02:30:56,098 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:30:56,098 INFO L276 IsEmpty]: Start isEmpty. Operand 10330 states and 31497 transitions. [2018-12-03 02:30:56,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 02:30:56,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:56,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:56,103 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:30:56,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:56,103 INFO L82 PathProgramCache]: Analyzing trace with hash 990890537, now seen corresponding path program 1 times [2018-12-03 02:30:56,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:56,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:56,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:56,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:56,105 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:56,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:56,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:56,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:30:56,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:56,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:30:56,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:30:56,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:30:56,141 INFO L87 Difference]: Start difference. First operand 10330 states and 31497 transitions. Second operand 6 states. [2018-12-03 02:30:56,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:56,512 INFO L93 Difference]: Finished difference Result 13727 states and 40916 transitions. [2018-12-03 02:30:56,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:30:56,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-03 02:30:56,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:56,526 INFO L225 Difference]: With dead ends: 13727 [2018-12-03 02:30:56,526 INFO L226 Difference]: Without dead ends: 13727 [2018-12-03 02:30:56,526 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:30:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13727 states. [2018-12-03 02:30:56,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13727 to 13018. [2018-12-03 02:30:56,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13018 states. [2018-12-03 02:30:56,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13018 states to 13018 states and 39085 transitions. [2018-12-03 02:30:56,659 INFO L78 Accepts]: Start accepts. Automaton has 13018 states and 39085 transitions. Word has length 68 [2018-12-03 02:30:56,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:56,659 INFO L480 AbstractCegarLoop]: Abstraction has 13018 states and 39085 transitions. [2018-12-03 02:30:56,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:30:56,659 INFO L276 IsEmpty]: Start isEmpty. Operand 13018 states and 39085 transitions. [2018-12-03 02:30:56,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 02:30:56,666 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:56,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:56,666 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:30:56,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:56,666 INFO L82 PathProgramCache]: Analyzing trace with hash -253873944, now seen corresponding path program 1 times [2018-12-03 02:30:56,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:56,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:56,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:56,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:56,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:56,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:56,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:56,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:56,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:30:56,715 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:56,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:30:56,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:30:56,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:30:56,716 INFO L87 Difference]: Start difference. First operand 13018 states and 39085 transitions. Second operand 4 states. [2018-12-03 02:30:56,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:56,844 INFO L93 Difference]: Finished difference Result 16578 states and 49219 transitions. [2018-12-03 02:30:56,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 02:30:56,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-03 02:30:56,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:56,861 INFO L225 Difference]: With dead ends: 16578 [2018-12-03 02:30:56,861 INFO L226 Difference]: Without dead ends: 16578 [2018-12-03 02:30:56,861 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-03 02:30:56,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16578 states. [2018-12-03 02:30:56,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16578 to 14153. [2018-12-03 02:30:56,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14153 states. [2018-12-03 02:30:57,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14153 states to 14153 states and 42248 transitions. [2018-12-03 02:30:57,012 INFO L78 Accepts]: Start accepts. Automaton has 14153 states and 42248 transitions. Word has length 68 [2018-12-03 02:30:57,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:57,013 INFO L480 AbstractCegarLoop]: Abstraction has 14153 states and 42248 transitions. [2018-12-03 02:30:57,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:30:57,013 INFO L276 IsEmpty]: Start isEmpty. Operand 14153 states and 42248 transitions. [2018-12-03 02:30:57,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 02:30:57,021 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:57,021 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:57,021 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:30:57,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:57,021 INFO L82 PathProgramCache]: Analyzing trace with hash -1086318806, now seen corresponding path program 1 times [2018-12-03 02:30:57,021 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:57,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:57,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:57,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:57,022 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:57,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:57,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:30:57,086 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:57,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:30:57,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:30:57,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:30:57,087 INFO L87 Difference]: Start difference. First operand 14153 states and 42248 transitions. Second operand 6 states. [2018-12-03 02:30:57,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:57,299 INFO L93 Difference]: Finished difference Result 16779 states and 48544 transitions. [2018-12-03 02:30:57,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 02:30:57,299 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-03 02:30:57,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:57,314 INFO L225 Difference]: With dead ends: 16779 [2018-12-03 02:30:57,314 INFO L226 Difference]: Without dead ends: 16779 [2018-12-03 02:30:57,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:30:57,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16779 states. [2018-12-03 02:30:57,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16779 to 14089. [2018-12-03 02:30:57,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14089 states. [2018-12-03 02:30:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14089 states to 14089 states and 41311 transitions. [2018-12-03 02:30:57,455 INFO L78 Accepts]: Start accepts. Automaton has 14089 states and 41311 transitions. Word has length 68 [2018-12-03 02:30:57,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:57,455 INFO L480 AbstractCegarLoop]: Abstraction has 14089 states and 41311 transitions. [2018-12-03 02:30:57,456 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:30:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 14089 states and 41311 transitions. [2018-12-03 02:30:57,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 02:30:57,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:57,461 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:57,462 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:30:57,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:57,462 INFO L82 PathProgramCache]: Analyzing trace with hash -874967893, now seen corresponding path program 1 times [2018-12-03 02:30:57,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:57,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:57,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:57,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:57,464 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:57,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:57,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:57,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:30:57,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:57,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:30:57,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:30:57,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:30:57,505 INFO L87 Difference]: Start difference. First operand 14089 states and 41311 transitions. Second operand 5 states. [2018-12-03 02:30:57,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:57,676 INFO L93 Difference]: Finished difference Result 17352 states and 50546 transitions. [2018-12-03 02:30:57,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:30:57,676 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-03 02:30:57,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:57,693 INFO L225 Difference]: With dead ends: 17352 [2018-12-03 02:30:57,693 INFO L226 Difference]: Without dead ends: 17352 [2018-12-03 02:30:57,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:30:57,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17352 states. [2018-12-03 02:30:57,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17352 to 15080. [2018-12-03 02:30:57,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15080 states. [2018-12-03 02:30:57,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15080 states to 15080 states and 43876 transitions. [2018-12-03 02:30:57,879 INFO L78 Accepts]: Start accepts. Automaton has 15080 states and 43876 transitions. Word has length 68 [2018-12-03 02:30:57,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:57,880 INFO L480 AbstractCegarLoop]: Abstraction has 15080 states and 43876 transitions. [2018-12-03 02:30:57,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:30:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 15080 states and 43876 transitions. [2018-12-03 02:30:57,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 02:30:57,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:57,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:57,887 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:30:57,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:57,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1385502070, now seen corresponding path program 1 times [2018-12-03 02:30:57,887 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:57,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:57,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:57,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:57,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:57,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:57,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:30:57,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:57,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:30:57,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:30:57,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:30:57,956 INFO L87 Difference]: Start difference. First operand 15080 states and 43876 transitions. Second operand 6 states. [2018-12-03 02:30:58,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:58,372 INFO L93 Difference]: Finished difference Result 23712 states and 68586 transitions. [2018-12-03 02:30:58,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 02:30:58,372 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2018-12-03 02:30:58,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:58,394 INFO L225 Difference]: With dead ends: 23712 [2018-12-03 02:30:58,395 INFO L226 Difference]: Without dead ends: 23712 [2018-12-03 02:30:58,395 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-12-03 02:30:58,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23712 states. [2018-12-03 02:30:58,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23712 to 19436. [2018-12-03 02:30:58,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19436 states. [2018-12-03 02:30:58,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19436 states to 19436 states and 56779 transitions. [2018-12-03 02:30:58,614 INFO L78 Accepts]: Start accepts. Automaton has 19436 states and 56779 transitions. Word has length 68 [2018-12-03 02:30:58,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:58,614 INFO L480 AbstractCegarLoop]: Abstraction has 19436 states and 56779 transitions. [2018-12-03 02:30:58,614 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:30:58,614 INFO L276 IsEmpty]: Start isEmpty. Operand 19436 states and 56779 transitions. [2018-12-03 02:30:58,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 02:30:58,623 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:58,623 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:58,623 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:30:58,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:58,623 INFO L82 PathProgramCache]: Analyzing trace with hash -497998389, now seen corresponding path program 1 times [2018-12-03 02:30:58,623 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:58,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:58,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:58,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:58,624 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:58,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:58,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:58,654 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:58,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:30:58,654 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:58,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:30:58,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:30:58,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:30:58,655 INFO L87 Difference]: Start difference. First operand 19436 states and 56779 transitions. Second operand 4 states. [2018-12-03 02:30:58,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:30:58,955 INFO L93 Difference]: Finished difference Result 20064 states and 58266 transitions. [2018-12-03 02:30:58,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:30:58,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2018-12-03 02:30:58,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:30:58,977 INFO L225 Difference]: With dead ends: 20064 [2018-12-03 02:30:58,977 INFO L226 Difference]: Without dead ends: 19360 [2018-12-03 02:30:58,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:30:59,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19360 states. [2018-12-03 02:30:59,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19360 to 18392. [2018-12-03 02:30:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18392 states. [2018-12-03 02:30:59,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18392 states to 18392 states and 53455 transitions. [2018-12-03 02:30:59,168 INFO L78 Accepts]: Start accepts. Automaton has 18392 states and 53455 transitions. Word has length 68 [2018-12-03 02:30:59,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:30:59,168 INFO L480 AbstractCegarLoop]: Abstraction has 18392 states and 53455 transitions. [2018-12-03 02:30:59,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:30:59,168 INFO L276 IsEmpty]: Start isEmpty. Operand 18392 states and 53455 transitions. [2018-12-03 02:30:59,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 02:30:59,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:30:59,176 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:30:59,177 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:30:59,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:30:59,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1112513867, now seen corresponding path program 1 times [2018-12-03 02:30:59,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:30:59,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:59,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:30:59,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:30:59,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:30:59,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:30:59,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:30:59,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:30:59,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-03 02:30:59,260 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:30:59,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 02:30:59,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 02:30:59,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-03 02:30:59,261 INFO L87 Difference]: Start difference. First operand 18392 states and 53455 transitions. Second operand 9 states. [2018-12-03 02:31:00,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:31:00,401 INFO L93 Difference]: Finished difference Result 26124 states and 75518 transitions. [2018-12-03 02:31:00,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 02:31:00,402 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 68 [2018-12-03 02:31:00,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:31:00,432 INFO L225 Difference]: With dead ends: 26124 [2018-12-03 02:31:00,432 INFO L226 Difference]: Without dead ends: 26124 [2018-12-03 02:31:00,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-03 02:31:00,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26124 states. [2018-12-03 02:31:00,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26124 to 21225. [2018-12-03 02:31:00,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21225 states. [2018-12-03 02:31:00,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21225 states to 21225 states and 61505 transitions. [2018-12-03 02:31:00,655 INFO L78 Accepts]: Start accepts. Automaton has 21225 states and 61505 transitions. Word has length 68 [2018-12-03 02:31:00,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:31:00,655 INFO L480 AbstractCegarLoop]: Abstraction has 21225 states and 61505 transitions. [2018-12-03 02:31:00,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 02:31:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 21225 states and 61505 transitions. [2018-12-03 02:31:00,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-03 02:31:00,663 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:31:00,663 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 02:31:00,663 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:31:00,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:31:00,664 INFO L82 PathProgramCache]: Analyzing trace with hash 2000017548, now seen corresponding path program 1 times [2018-12-03 02:31:00,664 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:31:00,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:31:00,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:31:00,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:31:00,665 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:31:00,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:31:00,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:31:00,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:31:00,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:31:00,715 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:31:00,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:31:00,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:31:00,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:31:00,715 INFO L87 Difference]: Start difference. First operand 21225 states and 61505 transitions. Second operand 5 states. [2018-12-03 02:31:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:31:00,743 INFO L93 Difference]: Finished difference Result 5849 states and 14057 transitions. [2018-12-03 02:31:00,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 02:31:00,743 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2018-12-03 02:31:00,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:31:00,746 INFO L225 Difference]: With dead ends: 5849 [2018-12-03 02:31:00,747 INFO L226 Difference]: Without dead ends: 4653 [2018-12-03 02:31:00,747 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:31:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4653 states. [2018-12-03 02:31:00,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4653 to 3961. [2018-12-03 02:31:00,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3961 states. [2018-12-03 02:31:00,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3961 states to 3961 states and 9298 transitions. [2018-12-03 02:31:00,774 INFO L78 Accepts]: Start accepts. Automaton has 3961 states and 9298 transitions. Word has length 68 [2018-12-03 02:31:00,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:31:00,774 INFO L480 AbstractCegarLoop]: Abstraction has 3961 states and 9298 transitions. [2018-12-03 02:31:00,774 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:31:00,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3961 states and 9298 transitions. [2018-12-03 02:31:00,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 02:31:00,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:31:00,776 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] [2018-12-03 02:31:00,777 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:31:00,777 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:31:00,777 INFO L82 PathProgramCache]: Analyzing trace with hash -901530196, now seen corresponding path program 1 times [2018-12-03 02:31:00,777 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:31:00,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:31:00,778 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:31:00,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:31:00,778 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:31:00,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:31:00,803 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:31:00,803 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:31:00,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 02:31:00,804 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:31:00,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 02:31:00,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 02:31:00,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 02:31:00,804 INFO L87 Difference]: Start difference. First operand 3961 states and 9298 transitions. Second operand 4 states. [2018-12-03 02:31:00,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:31:00,820 INFO L93 Difference]: Finished difference Result 3881 states and 9066 transitions. [2018-12-03 02:31:00,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:31:00,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-12-03 02:31:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:31:00,822 INFO L225 Difference]: With dead ends: 3881 [2018-12-03 02:31:00,822 INFO L226 Difference]: Without dead ends: 3881 [2018-12-03 02:31:00,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:31:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3881 states. [2018-12-03 02:31:00,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3881 to 3384. [2018-12-03 02:31:00,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3384 states. [2018-12-03 02:31:00,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3384 states to 3384 states and 7916 transitions. [2018-12-03 02:31:00,846 INFO L78 Accepts]: Start accepts. Automaton has 3384 states and 7916 transitions. Word has length 85 [2018-12-03 02:31:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:31:00,846 INFO L480 AbstractCegarLoop]: Abstraction has 3384 states and 7916 transitions. [2018-12-03 02:31:00,846 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 02:31:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 3384 states and 7916 transitions. [2018-12-03 02:31:00,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 02:31:00,849 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:31:00,849 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] [2018-12-03 02:31:00,849 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:31:00,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:31:00,849 INFO L82 PathProgramCache]: Analyzing trace with hash 1085951564, now seen corresponding path program 1 times [2018-12-03 02:31:00,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:31:00,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:31:00,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:31:00,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:31:00,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:31:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:31:00,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:31:00,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:31:00,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 02:31:00,898 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:31:00,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 02:31:00,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 02:31:00,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 02:31:00,899 INFO L87 Difference]: Start difference. First operand 3384 states and 7916 transitions. Second operand 5 states. [2018-12-03 02:31:00,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:31:00,917 INFO L93 Difference]: Finished difference Result 3384 states and 7900 transitions. [2018-12-03 02:31:00,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 02:31:00,918 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2018-12-03 02:31:00,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:31:00,920 INFO L225 Difference]: With dead ends: 3384 [2018-12-03 02:31:00,920 INFO L226 Difference]: Without dead ends: 3384 [2018-12-03 02:31:00,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:31:00,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3384 states. [2018-12-03 02:31:00,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3384 to 2958. [2018-12-03 02:31:00,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2958 states. [2018-12-03 02:31:00,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 6888 transitions. [2018-12-03 02:31:00,941 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 6888 transitions. Word has length 85 [2018-12-03 02:31:00,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:31:00,942 INFO L480 AbstractCegarLoop]: Abstraction has 2958 states and 6888 transitions. [2018-12-03 02:31:00,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 02:31:00,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 6888 transitions. [2018-12-03 02:31:00,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 02:31:00,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:31:00,944 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] [2018-12-03 02:31:00,944 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:31:00,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:31:00,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1973455245, now seen corresponding path program 1 times [2018-12-03 02:31:00,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:31:00,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:31:00,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:31:00,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:31:00,945 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:31:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:31:01,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:31:01,041 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:31:01,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 02:31:01,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:31:01,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 02:31:01,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 02:31:01,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:31:01,042 INFO L87 Difference]: Start difference. First operand 2958 states and 6888 transitions. Second operand 10 states. [2018-12-03 02:31:01,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:31:01,721 INFO L93 Difference]: Finished difference Result 5014 states and 11654 transitions. [2018-12-03 02:31:01,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 02:31:01,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-12-03 02:31:01,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:31:01,723 INFO L225 Difference]: With dead ends: 5014 [2018-12-03 02:31:01,724 INFO L226 Difference]: Without dead ends: 3506 [2018-12-03 02:31:01,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-03 02:31:01,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3506 states. [2018-12-03 02:31:01,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3506 to 3031. [2018-12-03 02:31:01,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3031 states. [2018-12-03 02:31:01,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3031 states to 3031 states and 6990 transitions. [2018-12-03 02:31:01,744 INFO L78 Accepts]: Start accepts. Automaton has 3031 states and 6990 transitions. Word has length 85 [2018-12-03 02:31:01,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:31:01,744 INFO L480 AbstractCegarLoop]: Abstraction has 3031 states and 6990 transitions. [2018-12-03 02:31:01,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 02:31:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 3031 states and 6990 transitions. [2018-12-03 02:31:01,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 02:31:01,746 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:31:01,746 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] [2018-12-03 02:31:01,746 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:31:01,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:31:01,746 INFO L82 PathProgramCache]: Analyzing trace with hash -749097736, now seen corresponding path program 1 times [2018-12-03 02:31:01,747 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:31:01,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:31:01,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:31:01,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:31:01,748 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:31:01,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:31:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:31:01,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:31:01,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 02:31:01,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:31:01,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 02:31:01,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 02:31:01,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 02:31:01,822 INFO L87 Difference]: Start difference. First operand 3031 states and 6990 transitions. Second operand 6 states. [2018-12-03 02:31:01,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:31:01,952 INFO L93 Difference]: Finished difference Result 3507 states and 7993 transitions. [2018-12-03 02:31:01,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 02:31:01,953 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-12-03 02:31:01,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:31:01,955 INFO L225 Difference]: With dead ends: 3507 [2018-12-03 02:31:01,955 INFO L226 Difference]: Without dead ends: 3453 [2018-12-03 02:31:01,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-03 02:31:01,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3453 states. [2018-12-03 02:31:01,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3453 to 3048. [2018-12-03 02:31:01,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3048 states. [2018-12-03 02:31:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3048 states to 3048 states and 6969 transitions. [2018-12-03 02:31:01,978 INFO L78 Accepts]: Start accepts. Automaton has 3048 states and 6969 transitions. Word has length 85 [2018-12-03 02:31:01,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:31:01,978 INFO L480 AbstractCegarLoop]: Abstraction has 3048 states and 6969 transitions. [2018-12-03 02:31:01,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 02:31:01,978 INFO L276 IsEmpty]: Start isEmpty. Operand 3048 states and 6969 transitions. [2018-12-03 02:31:01,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 02:31:01,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:31:01,980 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] [2018-12-03 02:31:01,980 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:31:01,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:31:01,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1468660217, now seen corresponding path program 2 times [2018-12-03 02:31:01,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:31:01,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:31:01,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 02:31:01,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:31:01,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:31:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:31:02,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 02:31:02,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:31:02,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 02:31:02,053 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:31:02,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 02:31:02,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 02:31:02,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-03 02:31:02,054 INFO L87 Difference]: Start difference. First operand 3048 states and 6969 transitions. Second operand 10 states. [2018-12-03 02:31:02,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:31:02,450 INFO L93 Difference]: Finished difference Result 5878 states and 13478 transitions. [2018-12-03 02:31:02,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-03 02:31:02,450 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-12-03 02:31:02,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:31:02,452 INFO L225 Difference]: With dead ends: 5878 [2018-12-03 02:31:02,452 INFO L226 Difference]: Without dead ends: 2287 [2018-12-03 02:31:02,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-03 02:31:02,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2287 states. [2018-12-03 02:31:02,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2287 to 2287. [2018-12-03 02:31:02,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2287 states. [2018-12-03 02:31:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 5233 transitions. [2018-12-03 02:31:02,467 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 5233 transitions. Word has length 85 [2018-12-03 02:31:02,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:31:02,467 INFO L480 AbstractCegarLoop]: Abstraction has 2287 states and 5233 transitions. [2018-12-03 02:31:02,467 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 02:31:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 5233 transitions. [2018-12-03 02:31:02,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 02:31:02,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:31:02,469 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] [2018-12-03 02:31:02,469 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:31:02,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:31:02,469 INFO L82 PathProgramCache]: Analyzing trace with hash -1942685255, now seen corresponding path program 3 times [2018-12-03 02:31:02,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:31:02,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:31:02,470 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 02:31:02,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:31:02,470 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:31:02,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 02:31:02,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-03 02:31:02,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 02:31:02,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-03 02:31:02,557 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 02:31:02,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-03 02:31:02,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-03 02:31:02,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-03 02:31:02,558 INFO L87 Difference]: Start difference. First operand 2287 states and 5233 transitions. Second operand 11 states. [2018-12-03 02:31:03,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 02:31:03,052 INFO L93 Difference]: Finished difference Result 3776 states and 8669 transitions. [2018-12-03 02:31:03,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-03 02:31:03,052 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-12-03 02:31:03,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 02:31:03,054 INFO L225 Difference]: With dead ends: 3776 [2018-12-03 02:31:03,054 INFO L226 Difference]: Without dead ends: 2473 [2018-12-03 02:31:03,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-03 02:31:03,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2473 states. [2018-12-03 02:31:03,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2473 to 2267. [2018-12-03 02:31:03,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2267 states. [2018-12-03 02:31:03,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2267 states to 2267 states and 5191 transitions. [2018-12-03 02:31:03,074 INFO L78 Accepts]: Start accepts. Automaton has 2267 states and 5191 transitions. Word has length 85 [2018-12-03 02:31:03,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 02:31:03,074 INFO L480 AbstractCegarLoop]: Abstraction has 2267 states and 5191 transitions. [2018-12-03 02:31:03,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-03 02:31:03,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2267 states and 5191 transitions. [2018-12-03 02:31:03,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 02:31:03,076 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 02:31:03,076 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] [2018-12-03 02:31:03,076 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 02:31:03,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 02:31:03,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1542877223, now seen corresponding path program 4 times [2018-12-03 02:31:03,077 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 02:31:03,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:31:03,077 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 02:31:03,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 02:31:03,078 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 02:31:03,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 02:31:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 02:31:03,112 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 02:31:03,178 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 02:31:03,179 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 02:31:03 BasicIcfg [2018-12-03 02:31:03,179 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 02:31:03,180 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 02:31:03,180 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 02:31:03,180 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 02:31:03,180 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 02:30:41" (3/4) ... [2018-12-03 02:31:03,182 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 02:31:03,258 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_79c28e10-57a5-44d3-be9b-6a96aa4f358e/bin-2019/utaipan/witness.graphml [2018-12-03 02:31:03,258 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 02:31:03,259 INFO L168 Benchmark]: Toolchain (without parser) took 22070.20 ms. Allocated memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: 2.7 GB). Free memory was 954.9 MB in the beginning and 1.0 GB in the end (delta: -68.5 MB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2018-12-03 02:31:03,259 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 02:31:03,260 INFO L168 Benchmark]: CACSL2BoogieTranslator took 325.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -122.4 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. [2018-12-03 02:31:03,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.62 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2018-12-03 02:31:03,260 INFO L168 Benchmark]: Boogie Preprocessor took 18.78 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-03 02:31:03,260 INFO L168 Benchmark]: RCFGBuilder took 325.80 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: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. [2018-12-03 02:31:03,260 INFO L168 Benchmark]: TraceAbstraction took 21286.66 ms. Allocated memory was 1.1 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -47.3 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. [2018-12-03 02:31:03,260 INFO L168 Benchmark]: Witness Printer took 78.25 ms. Allocated memory is still 3.7 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. [2018-12-03 02:31:03,261 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 325.88 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 954.9 MB in the beginning and 1.1 GB in the end (delta: -122.4 MB). Peak memory consumption was 31.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.62 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: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.78 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 325.80 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: 44.0 MB). Peak memory consumption was 44.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 21286.66 ms. Allocated memory was 1.1 GB in the beginning and 3.7 GB in the end (delta: 2.6 GB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -47.3 MB). Peak memory consumption was 2.5 GB. Max. memory is 11.5 GB. * Witness Printer took 78.25 ms. Allocated memory is still 3.7 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.5 MB). Peak memory consumption was 50.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L678] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L691] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L692] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L693] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L694] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L695] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L696] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L697] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L698] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L700] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t1653; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1653, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t1654; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t1654, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 y$w_buff1 = y$w_buff0 [L737] 0 y$w_buff0 = 1 [L738] 0 y$w_buff1_used = y$w_buff0_used [L739] 0 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L742] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L743] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L744] 0 y$r_buff0_thd2 = (_Bool)1 [L747] 0 z = 1 [L750] 0 __unbuffered_p1_EAX = z [L753] 0 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L706] 1 x = 1 [L711] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L712] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L713] 1 y$flush_delayed = weak$$choice2 [L714] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L715] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 0 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L715] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L716] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L716] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L717] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L717] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L759] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 0 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] EXPR 0 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L760] 0 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L763] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L718] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L719] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L719] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L720] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L720] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L721] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L721] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L722] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 1 y = y$flush_delayed ? y$mem_tmp : y [L724] 1 y$flush_delayed = (_Bool)0 [L729] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 3 error locations. UNSAFE Result, 21.2s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 9.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6872 SDtfs, 9215 SDslu, 16522 SDs, 0 SdLazy, 7322 SolverSat, 431 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 67 SyntacticMatches, 15 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61473occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 8.6s AutomataMinimizationTime, 26 MinimizatonAttempts, 147487 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1777 NumberOfCodeBlocks, 1777 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1666 ConstructedInterpolants, 0 QuantifiedInterpolants, 315503 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...