./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi000_tso.opt_true-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_a28bae6d-3927-42f9-9cbf-9f4f23cb6027/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a28bae6d-3927-42f9-9cbf-9f4f23cb6027/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a28bae6d-3927-42f9-9cbf-9f4f23cb6027/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a28bae6d-3927-42f9-9cbf-9f4f23cb6027/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi000_tso.opt_true-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a28bae6d-3927-42f9-9cbf-9f4f23cb6027/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a28bae6d-3927-42f9-9cbf-9f4f23cb6027/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 790725247cef75c6754a6505b2fc4c22454b4126 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 18:55:37,197 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 18:55:37,198 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 18:55:37,204 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 18:55:37,205 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 18:55:37,205 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 18:55:37,206 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 18:55:37,206 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 18:55:37,207 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 18:55:37,208 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 18:55:37,208 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 18:55:37,208 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 18:55:37,209 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 18:55:37,209 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 18:55:37,210 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 18:55:37,210 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 18:55:37,211 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 18:55:37,211 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 18:55:37,212 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 18:55:37,213 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 18:55:37,214 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 18:55:37,214 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 18:55:37,215 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 18:55:37,215 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 18:55:37,215 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 18:55:37,216 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 18:55:37,216 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 18:55:37,217 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 18:55:37,217 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 18:55:37,218 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 18:55:37,218 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 18:55:37,218 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 18:55:37,218 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 18:55:37,218 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 18:55:37,219 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 18:55:37,219 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 18:55:37,219 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a28bae6d-3927-42f9-9cbf-9f4f23cb6027/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 18:55:37,226 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 18:55:37,226 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 18:55:37,227 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 18:55:37,227 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 18:55:37,227 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 18:55:37,227 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 18:55:37,227 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 18:55:37,227 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 18:55:37,228 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 18:55:37,228 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 18:55:37,228 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 18:55:37,228 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 18:55:37,228 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 18:55:37,228 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 18:55:37,229 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 18:55:37,229 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 18:55:37,229 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 18:55:37,229 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 18:55:37,229 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 18:55:37,229 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 18:55:37,229 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 18:55:37,229 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 18:55:37,230 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 18:55:37,230 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 18:55:37,230 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 18:55:37,230 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 18:55:37,230 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 18:55:37,230 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 18:55:37,230 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 18:55:37,230 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 18:55:37,231 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 18:55:37,231 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 18:55:37,231 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 18:55:37,231 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 18:55:37,231 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 18:55:37,231 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 18:55:37,231 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_a28bae6d-3927-42f9-9cbf-9f4f23cb6027/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 -> 790725247cef75c6754a6505b2fc4c22454b4126 [2018-12-09 18:55:37,249 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 18:55:37,258 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 18:55:37,260 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 18:55:37,261 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 18:55:37,262 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 18:55:37,262 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a28bae6d-3927-42f9-9cbf-9f4f23cb6027/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi000_tso.opt_true-unreach-call.i [2018-12-09 18:55:37,305 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a28bae6d-3927-42f9-9cbf-9f4f23cb6027/bin-2019/utaipan/data/69be13ca0/135392013d0945298deb97fd84961681/FLAG3d72ed0e6 [2018-12-09 18:55:37,759 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 18:55:37,759 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a28bae6d-3927-42f9-9cbf-9f4f23cb6027/sv-benchmarks/c/pthread-wmm/rfi000_tso.opt_true-unreach-call.i [2018-12-09 18:55:37,767 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a28bae6d-3927-42f9-9cbf-9f4f23cb6027/bin-2019/utaipan/data/69be13ca0/135392013d0945298deb97fd84961681/FLAG3d72ed0e6 [2018-12-09 18:55:37,775 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a28bae6d-3927-42f9-9cbf-9f4f23cb6027/bin-2019/utaipan/data/69be13ca0/135392013d0945298deb97fd84961681 [2018-12-09 18:55:37,777 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 18:55:37,778 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 18:55:37,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 18:55:37,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 18:55:37,780 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 18:55:37,781 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:55:37" (1/1) ... [2018-12-09 18:55:37,782 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:55:37, skipping insertion in model container [2018-12-09 18:55:37,782 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 06:55:37" (1/1) ... [2018-12-09 18:55:37,787 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 18:55:37,818 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 18:55:38,015 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:55:38,022 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 18:55:38,108 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 18:55:38,137 INFO L195 MainTranslator]: Completed translation [2018-12-09 18:55:38,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:55:38 WrapperNode [2018-12-09 18:55:38,138 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 18:55:38,138 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 18:55:38,138 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 18:55:38,138 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 18:55:38,143 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:55:38" (1/1) ... [2018-12-09 18:55:38,155 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:55:38" (1/1) ... [2018-12-09 18:55:38,174 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 18:55:38,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 18:55:38,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 18:55:38,174 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 18:55:38,180 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:55:38" (1/1) ... [2018-12-09 18:55:38,180 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:55:38" (1/1) ... [2018-12-09 18:55:38,183 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:55:38" (1/1) ... [2018-12-09 18:55:38,183 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:55:38" (1/1) ... [2018-12-09 18:55:38,190 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:55:38" (1/1) ... [2018-12-09 18:55:38,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:55:38" (1/1) ... [2018-12-09 18:55:38,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:55:38" (1/1) ... [2018-12-09 18:55:38,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 18:55:38,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 18:55:38,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 18:55:38,198 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 18:55:38,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:55:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a28bae6d-3927-42f9-9cbf-9f4f23cb6027/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 18:55:38,231 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 18:55:38,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 18:55:38,231 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 18:55:38,231 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 18:55:38,231 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 18:55:38,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 18:55:38,231 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 18:55:38,231 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 18:55:38,232 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 18:55:38,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 18:55:38,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 18:55:38,233 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 18:55:38,655 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 18:55:38,656 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 18:55:38,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:55:38 BoogieIcfgContainer [2018-12-09 18:55:38,656 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 18:55:38,657 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 18:55:38,657 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 18:55:38,658 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 18:55:38,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 06:55:37" (1/3) ... [2018-12-09 18:55:38,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b3d390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:55:38, skipping insertion in model container [2018-12-09 18:55:38,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 06:55:38" (2/3) ... [2018-12-09 18:55:38,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75b3d390 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 06:55:38, skipping insertion in model container [2018-12-09 18:55:38,660 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:55:38" (3/3) ... [2018-12-09 18:55:38,661 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi000_tso.opt_true-unreach-call.i [2018-12-09 18:55:38,688 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,689 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,689 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,689 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,690 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,691 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,692 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,692 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,692 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,692 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,692 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,693 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,693 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,693 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,693 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,693 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,693 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,694 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,695 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,696 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,697 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,698 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,699 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,700 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,701 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,702 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,703 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,704 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,705 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,706 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,707 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,708 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,709 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,710 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 18:55:38,720 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 18:55:38,720 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 18:55:38,725 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 18:55:38,734 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 18:55:38,749 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 18:55:38,749 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 18:55:38,749 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 18:55:38,749 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 18:55:38,749 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 18:55:38,749 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 18:55:38,750 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 18:55:38,750 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 18:55:38,757 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 226places, 306 transitions [2018-12-09 18:55:47,559 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 125048 states. [2018-12-09 18:55:47,560 INFO L276 IsEmpty]: Start isEmpty. Operand 125048 states. [2018-12-09 18:55:47,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 18:55:47,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:55:47,566 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:55:47,568 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:55:47,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:55:47,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1224915915, now seen corresponding path program 1 times [2018-12-09 18:55:47,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:55:47,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:55:47,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:55:47,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:55:47,609 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:55:47,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:55:47,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:55:47,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:55:47,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:55:47,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:55:47,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:55:47,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:55:47,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:55:47,744 INFO L87 Difference]: Start difference. First operand 125048 states. Second operand 4 states. [2018-12-09 18:55:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:55:50,356 INFO L93 Difference]: Finished difference Result 240604 states and 990158 transitions. [2018-12-09 18:55:50,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:55:50,357 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-09 18:55:50,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:55:51,052 INFO L225 Difference]: With dead ends: 240604 [2018-12-09 18:55:51,052 INFO L226 Difference]: Without dead ends: 212996 [2018-12-09 18:55:51,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:55:53,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212996 states. [2018-12-09 18:55:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212996 to 112198. [2018-12-09 18:55:55,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112198 states. [2018-12-09 18:55:55,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112198 states to 112198 states and 465587 transitions. [2018-12-09 18:55:55,551 INFO L78 Accepts]: Start accepts. Automaton has 112198 states and 465587 transitions. Word has length 37 [2018-12-09 18:55:55,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:55:55,551 INFO L480 AbstractCegarLoop]: Abstraction has 112198 states and 465587 transitions. [2018-12-09 18:55:55,551 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:55:55,551 INFO L276 IsEmpty]: Start isEmpty. Operand 112198 states and 465587 transitions. [2018-12-09 18:55:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-12-09 18:55:55,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:55:55,555 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] [2018-12-09 18:55:55,555 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:55:55,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:55:55,555 INFO L82 PathProgramCache]: Analyzing trace with hash -694802140, now seen corresponding path program 1 times [2018-12-09 18:55:55,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:55:55,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:55:55,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:55:55,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:55:55,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:55:55,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:55:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:55:55,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:55:55,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:55:55,606 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:55:55,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:55:55,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:55:55,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:55:55,607 INFO L87 Difference]: Start difference. First operand 112198 states and 465587 transitions. Second operand 5 states. [2018-12-09 18:55:57,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:55:57,576 INFO L93 Difference]: Finished difference Result 337662 states and 1310633 transitions. [2018-12-09 18:55:57,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 18:55:57,577 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2018-12-09 18:55:57,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:55:58,359 INFO L225 Difference]: With dead ends: 337662 [2018-12-09 18:55:58,360 INFO L226 Difference]: Without dead ends: 337502 [2018-12-09 18:55:58,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:56:01,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337502 states. [2018-12-09 18:56:06,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337502 to 182336. [2018-12-09 18:56:06,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182336 states. [2018-12-09 18:56:06,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182336 states to 182336 states and 707538 transitions. [2018-12-09 18:56:06,927 INFO L78 Accepts]: Start accepts. Automaton has 182336 states and 707538 transitions. Word has length 44 [2018-12-09 18:56:06,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:06,927 INFO L480 AbstractCegarLoop]: Abstraction has 182336 states and 707538 transitions. [2018-12-09 18:56:06,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:56:06,928 INFO L276 IsEmpty]: Start isEmpty. Operand 182336 states and 707538 transitions. [2018-12-09 18:56:06,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-09 18:56:06,930 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:06,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] [2018-12-09 18:56:06,930 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:06,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:06,931 INFO L82 PathProgramCache]: Analyzing trace with hash -7464308, now seen corresponding path program 1 times [2018-12-09 18:56:06,931 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:06,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:06,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:06,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:06,933 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:06,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:06,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:06,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:06,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:06,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:06,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:06,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:06,962 INFO L87 Difference]: Start difference. First operand 182336 states and 707538 transitions. Second operand 4 states. [2018-12-09 18:56:07,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:07,080 INFO L93 Difference]: Finished difference Result 39892 states and 138215 transitions. [2018-12-09 18:56:07,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:56:07,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-09 18:56:07,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:07,146 INFO L225 Difference]: With dead ends: 39892 [2018-12-09 18:56:07,146 INFO L226 Difference]: Without dead ends: 37019 [2018-12-09 18:56:07,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:56:07,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37019 states. [2018-12-09 18:56:07,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37019 to 37019. [2018-12-09 18:56:07,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37019 states. [2018-12-09 18:56:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37019 states to 37019 states and 128876 transitions. [2018-12-09 18:56:07,602 INFO L78 Accepts]: Start accepts. Automaton has 37019 states and 128876 transitions. Word has length 45 [2018-12-09 18:56:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:07,602 INFO L480 AbstractCegarLoop]: Abstraction has 37019 states and 128876 transitions. [2018-12-09 18:56:07,602 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:07,602 INFO L276 IsEmpty]: Start isEmpty. Operand 37019 states and 128876 transitions. [2018-12-09 18:56:07,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 18:56:07,605 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:07,605 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] [2018-12-09 18:56:07,606 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:07,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:07,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1439202624, now seen corresponding path program 1 times [2018-12-09 18:56:07,606 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:07,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:07,607 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:07,607 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:07,608 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:07,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:07,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:07,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:07,663 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:07,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:07,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:07,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:07,663 INFO L87 Difference]: Start difference. First operand 37019 states and 128876 transitions. Second operand 4 states. [2018-12-09 18:56:07,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:07,981 INFO L93 Difference]: Finished difference Result 49059 states and 166861 transitions. [2018-12-09 18:56:07,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:56:07,981 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-09 18:56:07,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:08,049 INFO L225 Difference]: With dead ends: 49059 [2018-12-09 18:56:08,049 INFO L226 Difference]: Without dead ends: 49059 [2018-12-09 18:56:08,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:56:08,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49059 states. [2018-12-09 18:56:08,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49059 to 42063. [2018-12-09 18:56:08,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42063 states. [2018-12-09 18:56:08,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42063 states to 42063 states and 144442 transitions. [2018-12-09 18:56:08,625 INFO L78 Accepts]: Start accepts. Automaton has 42063 states and 144442 transitions. Word has length 58 [2018-12-09 18:56:08,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:08,625 INFO L480 AbstractCegarLoop]: Abstraction has 42063 states and 144442 transitions. [2018-12-09 18:56:08,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:08,625 INFO L276 IsEmpty]: Start isEmpty. Operand 42063 states and 144442 transitions. [2018-12-09 18:56:08,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 18:56:08,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:08,629 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] [2018-12-09 18:56:08,630 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:08,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:08,630 INFO L82 PathProgramCache]: Analyzing trace with hash -340567146, now seen corresponding path program 1 times [2018-12-09 18:56:08,630 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:08,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:08,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:08,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:08,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:08,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:08,662 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:08,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:08,662 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:08,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:08,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:08,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:08,662 INFO L87 Difference]: Start difference. First operand 42063 states and 144442 transitions. Second operand 4 states. [2018-12-09 18:56:09,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:09,368 INFO L93 Difference]: Finished difference Result 49638 states and 166843 transitions. [2018-12-09 18:56:09,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:56:09,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2018-12-09 18:56:09,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:09,441 INFO L225 Difference]: With dead ends: 49638 [2018-12-09 18:56:09,441 INFO L226 Difference]: Without dead ends: 49638 [2018-12-09 18:56:09,442 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:56:09,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49638 states. [2018-12-09 18:56:10,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49638 to 46731. [2018-12-09 18:56:10,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46731 states. [2018-12-09 18:56:10,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46731 states to 46731 states and 158580 transitions. [2018-12-09 18:56:10,283 INFO L78 Accepts]: Start accepts. Automaton has 46731 states and 158580 transitions. Word has length 58 [2018-12-09 18:56:10,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:10,283 INFO L480 AbstractCegarLoop]: Abstraction has 46731 states and 158580 transitions. [2018-12-09 18:56:10,283 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:10,283 INFO L276 IsEmpty]: Start isEmpty. Operand 46731 states and 158580 transitions. [2018-12-09 18:56:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 18:56:10,287 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:10,287 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] [2018-12-09 18:56:10,287 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:10,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:10,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1012742551, now seen corresponding path program 1 times [2018-12-09 18:56:10,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:10,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:10,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:10,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:10,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:10,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:10,335 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:10,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:56:10,335 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:10,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:56:10,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:56:10,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:56:10,335 INFO L87 Difference]: Start difference. First operand 46731 states and 158580 transitions. Second operand 6 states. [2018-12-09 18:56:11,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:11,004 INFO L93 Difference]: Finished difference Result 69263 states and 233515 transitions. [2018-12-09 18:56:11,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 18:56:11,005 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-09 18:56:11,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:11,106 INFO L225 Difference]: With dead ends: 69263 [2018-12-09 18:56:11,106 INFO L226 Difference]: Without dead ends: 69231 [2018-12-09 18:56:11,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 18:56:11,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69231 states. [2018-12-09 18:56:11,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69231 to 55787. [2018-12-09 18:56:11,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55787 states. [2018-12-09 18:56:11,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55787 states to 55787 states and 187260 transitions. [2018-12-09 18:56:11,893 INFO L78 Accepts]: Start accepts. Automaton has 55787 states and 187260 transitions. Word has length 58 [2018-12-09 18:56:11,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:11,894 INFO L480 AbstractCegarLoop]: Abstraction has 55787 states and 187260 transitions. [2018-12-09 18:56:11,894 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:56:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 55787 states and 187260 transitions. [2018-12-09 18:56:11,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 18:56:11,907 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:11,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:11,907 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:11,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:11,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1986386371, now seen corresponding path program 1 times [2018-12-09 18:56:11,908 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:11,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:11,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:11,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:11,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:11,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:11,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:11,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:11,951 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:11,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:11,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:11,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:11,952 INFO L87 Difference]: Start difference. First operand 55787 states and 187260 transitions. Second operand 4 states. [2018-12-09 18:56:12,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:12,700 INFO L93 Difference]: Finished difference Result 88791 states and 294033 transitions. [2018-12-09 18:56:12,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:56:12,700 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-09 18:56:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:12,830 INFO L225 Difference]: With dead ends: 88791 [2018-12-09 18:56:12,830 INFO L226 Difference]: Without dead ends: 88595 [2018-12-09 18:56:12,831 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:56:13,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88595 states. [2018-12-09 18:56:13,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88595 to 75939. [2018-12-09 18:56:13,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75939 states. [2018-12-09 18:56:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75939 states to 75939 states and 253670 transitions. [2018-12-09 18:56:14,073 INFO L78 Accepts]: Start accepts. Automaton has 75939 states and 253670 transitions. Word has length 72 [2018-12-09 18:56:14,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:14,073 INFO L480 AbstractCegarLoop]: Abstraction has 75939 states and 253670 transitions. [2018-12-09 18:56:14,073 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:14,073 INFO L276 IsEmpty]: Start isEmpty. Operand 75939 states and 253670 transitions. [2018-12-09 18:56:14,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 18:56:14,088 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:14,088 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:14,088 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:14,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:14,088 INFO L82 PathProgramCache]: Analyzing trace with hash -955271228, now seen corresponding path program 1 times [2018-12-09 18:56:14,088 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:14,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:14,089 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:14,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:14,090 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:14,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:14,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:14,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 18:56:14,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:14,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 18:56:14,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 18:56:14,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:56:14,166 INFO L87 Difference]: Start difference. First operand 75939 states and 253670 transitions. Second operand 8 states. [2018-12-09 18:56:16,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:16,227 INFO L93 Difference]: Finished difference Result 111793 states and 364107 transitions. [2018-12-09 18:56:16,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 18:56:16,227 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2018-12-09 18:56:16,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:16,407 INFO L225 Difference]: With dead ends: 111793 [2018-12-09 18:56:16,407 INFO L226 Difference]: Without dead ends: 111529 [2018-12-09 18:56:16,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2018-12-09 18:56:16,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111529 states. [2018-12-09 18:56:17,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111529 to 90424. [2018-12-09 18:56:17,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90424 states. [2018-12-09 18:56:17,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90424 states to 90424 states and 298936 transitions. [2018-12-09 18:56:17,683 INFO L78 Accepts]: Start accepts. Automaton has 90424 states and 298936 transitions. Word has length 72 [2018-12-09 18:56:17,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:17,683 INFO L480 AbstractCegarLoop]: Abstraction has 90424 states and 298936 transitions. [2018-12-09 18:56:17,683 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 18:56:17,683 INFO L276 IsEmpty]: Start isEmpty. Operand 90424 states and 298936 transitions. [2018-12-09 18:56:17,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 18:56:17,704 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:17,704 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:17,705 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:17,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:17,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1248674235, now seen corresponding path program 1 times [2018-12-09 18:56:17,705 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:17,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:17,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:17,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:17,706 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:17,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:17,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 18:56:17,759 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:17,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 18:56:17,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 18:56:17,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:56:17,760 INFO L87 Difference]: Start difference. First operand 90424 states and 298936 transitions. Second operand 7 states. [2018-12-09 18:56:18,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:18,812 INFO L93 Difference]: Finished difference Result 114912 states and 379658 transitions. [2018-12-09 18:56:18,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 18:56:18,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2018-12-09 18:56:18,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:19,148 INFO L225 Difference]: With dead ends: 114912 [2018-12-09 18:56:19,148 INFO L226 Difference]: Without dead ends: 114848 [2018-12-09 18:56:19,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-12-09 18:56:19,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114848 states. [2018-12-09 18:56:20,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114848 to 99644. [2018-12-09 18:56:20,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99644 states. [2018-12-09 18:56:20,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99644 states to 99644 states and 327295 transitions. [2018-12-09 18:56:20,403 INFO L78 Accepts]: Start accepts. Automaton has 99644 states and 327295 transitions. Word has length 72 [2018-12-09 18:56:20,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:20,403 INFO L480 AbstractCegarLoop]: Abstraction has 99644 states and 327295 transitions. [2018-12-09 18:56:20,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 18:56:20,403 INFO L276 IsEmpty]: Start isEmpty. Operand 99644 states and 327295 transitions. [2018-12-09 18:56:20,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 18:56:20,430 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:20,430 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] [2018-12-09 18:56:20,430 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:20,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:20,431 INFO L82 PathProgramCache]: Analyzing trace with hash 21000313, now seen corresponding path program 1 times [2018-12-09 18:56:20,431 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:20,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:20,432 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:20,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:20,432 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:20,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:20,461 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:20,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:56:20,461 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:20,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:56:20,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:56:20,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:56:20,461 INFO L87 Difference]: Start difference. First operand 99644 states and 327295 transitions. Second operand 3 states. [2018-12-09 18:56:20,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:20,947 INFO L93 Difference]: Finished difference Result 149994 states and 480376 transitions. [2018-12-09 18:56:20,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:56:20,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2018-12-09 18:56:20,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:21,177 INFO L225 Difference]: With dead ends: 149994 [2018-12-09 18:56:21,178 INFO L226 Difference]: Without dead ends: 149994 [2018-12-09 18:56:21,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:56:21,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149994 states. [2018-12-09 18:56:22,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149994 to 127827. [2018-12-09 18:56:22,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127827 states. [2018-12-09 18:56:23,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127827 states to 127827 states and 411652 transitions. [2018-12-09 18:56:23,136 INFO L78 Accepts]: Start accepts. Automaton has 127827 states and 411652 transitions. Word has length 74 [2018-12-09 18:56:23,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:23,136 INFO L480 AbstractCegarLoop]: Abstraction has 127827 states and 411652 transitions. [2018-12-09 18:56:23,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:56:23,137 INFO L276 IsEmpty]: Start isEmpty. Operand 127827 states and 411652 transitions. [2018-12-09 18:56:23,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-12-09 18:56:23,170 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:23,170 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] [2018-12-09 18:56:23,170 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:23,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:23,171 INFO L82 PathProgramCache]: Analyzing trace with hash 744217605, now seen corresponding path program 1 times [2018-12-09 18:56:23,171 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:23,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:23,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:23,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:23,172 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:23,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:23,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:23,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:23,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 18:56:23,225 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:23,225 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 18:56:23,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 18:56:23,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:56:23,226 INFO L87 Difference]: Start difference. First operand 127827 states and 411652 transitions. Second operand 8 states. [2018-12-09 18:56:24,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:24,834 INFO L93 Difference]: Finished difference Result 145051 states and 462606 transitions. [2018-12-09 18:56:24,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-12-09 18:56:24,835 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-12-09 18:56:24,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:25,058 INFO L225 Difference]: With dead ends: 145051 [2018-12-09 18:56:25,058 INFO L226 Difference]: Without dead ends: 144987 [2018-12-09 18:56:25,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2018-12-09 18:56:25,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144987 states. [2018-12-09 18:56:26,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144987 to 128275. [2018-12-09 18:56:26,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128275 states. [2018-12-09 18:56:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128275 states to 128275 states and 413192 transitions. [2018-12-09 18:56:26,797 INFO L78 Accepts]: Start accepts. Automaton has 128275 states and 413192 transitions. Word has length 78 [2018-12-09 18:56:26,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:26,798 INFO L480 AbstractCegarLoop]: Abstraction has 128275 states and 413192 transitions. [2018-12-09 18:56:26,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 18:56:26,798 INFO L276 IsEmpty]: Start isEmpty. Operand 128275 states and 413192 transitions. [2018-12-09 18:56:26,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 18:56:26,842 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:26,842 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] [2018-12-09 18:56:26,842 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:26,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:26,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1691318381, now seen corresponding path program 1 times [2018-12-09 18:56:26,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:26,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:26,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:26,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:26,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:26,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:26,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:26,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:56:26,913 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:26,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:56:26,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:56:26,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:56:26,913 INFO L87 Difference]: Start difference. First operand 128275 states and 413192 transitions. Second operand 6 states. [2018-12-09 18:56:27,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:27,908 INFO L93 Difference]: Finished difference Result 160065 states and 514282 transitions. [2018-12-09 18:56:27,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 18:56:27,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-12-09 18:56:27,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:28,146 INFO L225 Difference]: With dead ends: 160065 [2018-12-09 18:56:28,147 INFO L226 Difference]: Without dead ends: 160065 [2018-12-09 18:56:28,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:56:28,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160065 states. [2018-12-09 18:56:29,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160065 to 130671. [2018-12-09 18:56:29,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130671 states. [2018-12-09 18:56:29,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130671 states to 130671 states and 420722 transitions. [2018-12-09 18:56:29,963 INFO L78 Accepts]: Start accepts. Automaton has 130671 states and 420722 transitions. Word has length 81 [2018-12-09 18:56:29,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:29,963 INFO L480 AbstractCegarLoop]: Abstraction has 130671 states and 420722 transitions. [2018-12-09 18:56:29,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:56:29,963 INFO L276 IsEmpty]: Start isEmpty. Operand 130671 states and 420722 transitions. [2018-12-09 18:56:30,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 18:56:30,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:30,007 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] [2018-12-09 18:56:30,007 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:30,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:30,008 INFO L82 PathProgramCache]: Analyzing trace with hash -878168018, now seen corresponding path program 1 times [2018-12-09 18:56:30,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:30,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:30,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:30,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:30,010 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:30,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:30,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:30,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 18:56:30,057 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:30,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 18:56:30,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 18:56:30,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 18:56:30,058 INFO L87 Difference]: Start difference. First operand 130671 states and 420722 transitions. Second operand 3 states. [2018-12-09 18:56:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:30,455 INFO L93 Difference]: Finished difference Result 126035 states and 401713 transitions. [2018-12-09 18:56:30,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 18:56:30,455 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-09 18:56:30,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:30,635 INFO L225 Difference]: With dead ends: 126035 [2018-12-09 18:56:30,635 INFO L226 Difference]: Without dead ends: 125771 [2018-12-09 18:56:30,635 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-09 18:56:30,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125771 states. [2018-12-09 18:56:32,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125771 to 125563. [2018-12-09 18:56:32,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125563 states. [2018-12-09 18:56:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125563 states to 125563 states and 400455 transitions. [2018-12-09 18:56:32,303 INFO L78 Accepts]: Start accepts. Automaton has 125563 states and 400455 transitions. Word has length 81 [2018-12-09 18:56:32,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:32,303 INFO L480 AbstractCegarLoop]: Abstraction has 125563 states and 400455 transitions. [2018-12-09 18:56:32,303 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 18:56:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 125563 states and 400455 transitions. [2018-12-09 18:56:32,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 18:56:32,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:32,346 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] [2018-12-09 18:56:32,346 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:32,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:32,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1825660350, now seen corresponding path program 1 times [2018-12-09 18:56:32,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:32,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:32,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:32,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:32,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:32,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:32,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:32,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:56:32,415 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:32,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:56:32,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:56:32,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:56:32,415 INFO L87 Difference]: Start difference. First operand 125563 states and 400455 transitions. Second operand 6 states. [2018-12-09 18:56:33,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:33,235 INFO L93 Difference]: Finished difference Result 126351 states and 402250 transitions. [2018-12-09 18:56:33,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 18:56:33,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2018-12-09 18:56:33,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:33,424 INFO L225 Difference]: With dead ends: 126351 [2018-12-09 18:56:33,424 INFO L226 Difference]: Without dead ends: 126351 [2018-12-09 18:56:33,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:56:33,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126351 states. [2018-12-09 18:56:35,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126351 to 124144. [2018-12-09 18:56:35,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124144 states. [2018-12-09 18:56:35,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124144 states to 124144 states and 396466 transitions. [2018-12-09 18:56:35,274 INFO L78 Accepts]: Start accepts. Automaton has 124144 states and 396466 transitions. Word has length 81 [2018-12-09 18:56:35,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:35,274 INFO L480 AbstractCegarLoop]: Abstraction has 124144 states and 396466 transitions. [2018-12-09 18:56:35,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:56:35,274 INFO L276 IsEmpty]: Start isEmpty. Operand 124144 states and 396466 transitions. [2018-12-09 18:56:35,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 18:56:35,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:35,312 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] [2018-12-09 18:56:35,312 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:35,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:35,312 INFO L82 PathProgramCache]: Analyzing trace with hash -109999937, now seen corresponding path program 1 times [2018-12-09 18:56:35,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:35,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:35,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:35,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:35,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:35,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:35,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:35,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:35,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 18:56:35,369 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:35,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 18:56:35,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 18:56:35,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:56:35,369 INFO L87 Difference]: Start difference. First operand 124144 states and 396466 transitions. Second operand 7 states. [2018-12-09 18:56:36,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:36,312 INFO L93 Difference]: Finished difference Result 131826 states and 419584 transitions. [2018-12-09 18:56:36,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 18:56:36,313 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-12-09 18:56:36,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:36,517 INFO L225 Difference]: With dead ends: 131826 [2018-12-09 18:56:36,517 INFO L226 Difference]: Without dead ends: 131826 [2018-12-09 18:56:36,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:56:36,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131826 states. [2018-12-09 18:56:37,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131826 to 126150. [2018-12-09 18:56:37,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126150 states. [2018-12-09 18:56:38,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126150 states to 126150 states and 402000 transitions. [2018-12-09 18:56:38,123 INFO L78 Accepts]: Start accepts. Automaton has 126150 states and 402000 transitions. Word has length 81 [2018-12-09 18:56:38,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:38,123 INFO L480 AbstractCegarLoop]: Abstraction has 126150 states and 402000 transitions. [2018-12-09 18:56:38,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 18:56:38,123 INFO L276 IsEmpty]: Start isEmpty. Operand 126150 states and 402000 transitions. [2018-12-09 18:56:38,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 18:56:38,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:38,165 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] [2018-12-09 18:56:38,165 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:38,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:38,166 INFO L82 PathProgramCache]: Analyzing trace with hash 219765824, now seen corresponding path program 1 times [2018-12-09 18:56:38,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:38,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:38,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:38,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:38,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:38,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:38,211 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:38,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:56:38,211 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:38,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:56:38,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:56:38,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:56:38,212 INFO L87 Difference]: Start difference. First operand 126150 states and 402000 transitions. Second operand 5 states. [2018-12-09 18:56:38,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:38,256 INFO L93 Difference]: Finished difference Result 15022 states and 38122 transitions. [2018-12-09 18:56:38,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 18:56:38,257 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2018-12-09 18:56:38,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:38,265 INFO L225 Difference]: With dead ends: 15022 [2018-12-09 18:56:38,265 INFO L226 Difference]: Without dead ends: 11832 [2018-12-09 18:56:38,266 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:56:38,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11832 states. [2018-12-09 18:56:38,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11832 to 9190. [2018-12-09 18:56:38,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9190 states. [2018-12-09 18:56:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9190 states to 9190 states and 23229 transitions. [2018-12-09 18:56:38,348 INFO L78 Accepts]: Start accepts. Automaton has 9190 states and 23229 transitions. Word has length 81 [2018-12-09 18:56:38,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:38,348 INFO L480 AbstractCegarLoop]: Abstraction has 9190 states and 23229 transitions. [2018-12-09 18:56:38,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:56:38,348 INFO L276 IsEmpty]: Start isEmpty. Operand 9190 states and 23229 transitions. [2018-12-09 18:56:38,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 18:56:38,479 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:38,479 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:38,479 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:38,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:38,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1241095565, now seen corresponding path program 1 times [2018-12-09 18:56:38,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:38,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:38,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:38,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:38,480 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:38,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:38,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:38,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 18:56:38,560 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:38,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 18:56:38,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 18:56:38,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:56:38,560 INFO L87 Difference]: Start difference. First operand 9190 states and 23229 transitions. Second operand 7 states. [2018-12-09 18:56:38,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:38,851 INFO L93 Difference]: Finished difference Result 10010 states and 25092 transitions. [2018-12-09 18:56:38,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 18:56:38,852 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 125 [2018-12-09 18:56:38,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:38,859 INFO L225 Difference]: With dead ends: 10010 [2018-12-09 18:56:38,859 INFO L226 Difference]: Without dead ends: 10010 [2018-12-09 18:56:38,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:56:38,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10010 states. [2018-12-09 18:56:38,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10010 to 9262. [2018-12-09 18:56:38,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9262 states. [2018-12-09 18:56:38,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9262 states to 9262 states and 23391 transitions. [2018-12-09 18:56:38,930 INFO L78 Accepts]: Start accepts. Automaton has 9262 states and 23391 transitions. Word has length 125 [2018-12-09 18:56:38,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:38,930 INFO L480 AbstractCegarLoop]: Abstraction has 9262 states and 23391 transitions. [2018-12-09 18:56:38,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 18:56:38,930 INFO L276 IsEmpty]: Start isEmpty. Operand 9262 states and 23391 transitions. [2018-12-09 18:56:38,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 18:56:38,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:38,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:38,936 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:38,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:38,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1446211312, now seen corresponding path program 1 times [2018-12-09 18:56:38,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:38,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:38,938 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:38,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:38,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:38,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:38,989 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:38,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:56:38,989 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:38,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:56:38,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:56:38,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:56:38,989 INFO L87 Difference]: Start difference. First operand 9262 states and 23391 transitions. Second operand 5 states. [2018-12-09 18:56:39,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:39,197 INFO L93 Difference]: Finished difference Result 9908 states and 24738 transitions. [2018-12-09 18:56:39,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 18:56:39,197 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2018-12-09 18:56:39,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:39,204 INFO L225 Difference]: With dead ends: 9908 [2018-12-09 18:56:39,204 INFO L226 Difference]: Without dead ends: 9908 [2018-12-09 18:56:39,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:56:39,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9908 states. [2018-12-09 18:56:39,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9908 to 9531. [2018-12-09 18:56:39,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9531 states. [2018-12-09 18:56:39,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9531 states to 9531 states and 23965 transitions. [2018-12-09 18:56:39,277 INFO L78 Accepts]: Start accepts. Automaton has 9531 states and 23965 transitions. Word has length 125 [2018-12-09 18:56:39,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:39,277 INFO L480 AbstractCegarLoop]: Abstraction has 9531 states and 23965 transitions. [2018-12-09 18:56:39,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:56:39,277 INFO L276 IsEmpty]: Start isEmpty. Operand 9531 states and 23965 transitions. [2018-12-09 18:56:39,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 18:56:39,283 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:39,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:39,283 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:39,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:39,284 INFO L82 PathProgramCache]: Analyzing trace with hash -40867375, now seen corresponding path program 1 times [2018-12-09 18:56:39,284 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:39,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:39,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:39,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:39,285 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:39,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:39,316 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:39,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:39,316 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:39,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:39,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:39,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:39,317 INFO L87 Difference]: Start difference. First operand 9531 states and 23965 transitions. Second operand 4 states. [2018-12-09 18:56:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:39,433 INFO L93 Difference]: Finished difference Result 10128 states and 25362 transitions. [2018-12-09 18:56:39,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 18:56:39,433 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 125 [2018-12-09 18:56:39,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:39,440 INFO L225 Difference]: With dead ends: 10128 [2018-12-09 18:56:39,440 INFO L226 Difference]: Without dead ends: 10100 [2018-12-09 18:56:39,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:39,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10100 states. [2018-12-09 18:56:39,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10100 to 9754. [2018-12-09 18:56:39,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9754 states. [2018-12-09 18:56:39,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9754 states to 9754 states and 24467 transitions. [2018-12-09 18:56:39,514 INFO L78 Accepts]: Start accepts. Automaton has 9754 states and 24467 transitions. Word has length 125 [2018-12-09 18:56:39,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:39,514 INFO L480 AbstractCegarLoop]: Abstraction has 9754 states and 24467 transitions. [2018-12-09 18:56:39,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:39,515 INFO L276 IsEmpty]: Start isEmpty. Operand 9754 states and 24467 transitions. [2018-12-09 18:56:39,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 18:56:39,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:39,522 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:39,522 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:39,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:39,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1224214672, now seen corresponding path program 1 times [2018-12-09 18:56:39,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:39,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:39,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:39,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:39,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:39,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:39,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:39,591 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:39,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 18:56:39,592 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:39,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 18:56:39,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 18:56:39,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:56:39,592 INFO L87 Difference]: Start difference. First operand 9754 states and 24467 transitions. Second operand 8 states. [2018-12-09 18:56:41,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:41,149 INFO L93 Difference]: Finished difference Result 26186 states and 62182 transitions. [2018-12-09 18:56:41,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 18:56:41,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 125 [2018-12-09 18:56:41,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:41,168 INFO L225 Difference]: With dead ends: 26186 [2018-12-09 18:56:41,169 INFO L226 Difference]: Without dead ends: 25944 [2018-12-09 18:56:41,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=133, Invalid=287, Unknown=0, NotChecked=0, Total=420 [2018-12-09 18:56:41,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25944 states. [2018-12-09 18:56:41,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25944 to 17342. [2018-12-09 18:56:41,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17342 states. [2018-12-09 18:56:41,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17342 states to 17342 states and 43112 transitions. [2018-12-09 18:56:41,361 INFO L78 Accepts]: Start accepts. Automaton has 17342 states and 43112 transitions. Word has length 125 [2018-12-09 18:56:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:41,362 INFO L480 AbstractCegarLoop]: Abstraction has 17342 states and 43112 transitions. [2018-12-09 18:56:41,362 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 18:56:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 17342 states and 43112 transitions. [2018-12-09 18:56:41,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 18:56:41,374 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:41,374 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:41,374 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:41,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:41,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1331794229, now seen corresponding path program 1 times [2018-12-09 18:56:41,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:41,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:41,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:41,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:41,376 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:41,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:41,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:41,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:56:41,428 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:41,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:56:41,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:56:41,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:56:41,429 INFO L87 Difference]: Start difference. First operand 17342 states and 43112 transitions. Second operand 6 states. [2018-12-09 18:56:42,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:42,158 INFO L93 Difference]: Finished difference Result 38796 states and 95861 transitions. [2018-12-09 18:56:42,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 18:56:42,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-12-09 18:56:42,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:42,198 INFO L225 Difference]: With dead ends: 38796 [2018-12-09 18:56:42,199 INFO L226 Difference]: Without dead ends: 38796 [2018-12-09 18:56:42,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-09 18:56:42,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38796 states. [2018-12-09 18:56:42,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38796 to 19128. [2018-12-09 18:56:42,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19128 states. [2018-12-09 18:56:42,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19128 states to 19128 states and 47668 transitions. [2018-12-09 18:56:42,442 INFO L78 Accepts]: Start accepts. Automaton has 19128 states and 47668 transitions. Word has length 125 [2018-12-09 18:56:42,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:42,442 INFO L480 AbstractCegarLoop]: Abstraction has 19128 states and 47668 transitions. [2018-12-09 18:56:42,442 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:56:42,442 INFO L276 IsEmpty]: Start isEmpty. Operand 19128 states and 47668 transitions. [2018-12-09 18:56:42,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 18:56:42,456 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:42,457 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:42,457 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:42,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:42,457 INFO L82 PathProgramCache]: Analyzing trace with hash 283304405, now seen corresponding path program 1 times [2018-12-09 18:56:42,457 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:42,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:42,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:42,459 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:42,459 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:42,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:42,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:42,525 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:42,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:56:42,525 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:42,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:56:42,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:56:42,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:56:42,525 INFO L87 Difference]: Start difference. First operand 19128 states and 47668 transitions. Second operand 6 states. [2018-12-09 18:56:42,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:42,791 INFO L93 Difference]: Finished difference Result 20465 states and 50483 transitions. [2018-12-09 18:56:42,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 18:56:42,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-12-09 18:56:42,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:42,806 INFO L225 Difference]: With dead ends: 20465 [2018-12-09 18:56:42,806 INFO L226 Difference]: Without dead ends: 20465 [2018-12-09 18:56:42,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:56:42,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20465 states. [2018-12-09 18:56:42,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20465 to 19186. [2018-12-09 18:56:42,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19186 states. [2018-12-09 18:56:42,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19186 states to 19186 states and 47784 transitions. [2018-12-09 18:56:42,965 INFO L78 Accepts]: Start accepts. Automaton has 19186 states and 47784 transitions. Word has length 125 [2018-12-09 18:56:42,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:42,965 INFO L480 AbstractCegarLoop]: Abstraction has 19186 states and 47784 transitions. [2018-12-09 18:56:42,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:56:42,965 INFO L276 IsEmpty]: Start isEmpty. Operand 19186 states and 47784 transitions. [2018-12-09 18:56:42,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 18:56:42,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:42,977 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:42,977 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:42,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:42,978 INFO L82 PathProgramCache]: Analyzing trace with hash -855839804, now seen corresponding path program 1 times [2018-12-09 18:56:42,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:42,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:42,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:42,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:42,978 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:43,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:43,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:43,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 18:56:43,093 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:43,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 18:56:43,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 18:56:43,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:56:43,093 INFO L87 Difference]: Start difference. First operand 19186 states and 47784 transitions. Second operand 8 states. [2018-12-09 18:56:43,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:43,442 INFO L93 Difference]: Finished difference Result 28711 states and 70319 transitions. [2018-12-09 18:56:43,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 18:56:43,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 125 [2018-12-09 18:56:43,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:43,465 INFO L225 Difference]: With dead ends: 28711 [2018-12-09 18:56:43,466 INFO L226 Difference]: Without dead ends: 28632 [2018-12-09 18:56:43,466 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-12-09 18:56:43,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28632 states. [2018-12-09 18:56:43,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28632 to 23771. [2018-12-09 18:56:43,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23771 states. [2018-12-09 18:56:43,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23771 states to 23771 states and 59039 transitions. [2018-12-09 18:56:43,704 INFO L78 Accepts]: Start accepts. Automaton has 23771 states and 59039 transitions. Word has length 125 [2018-12-09 18:56:43,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:43,705 INFO L480 AbstractCegarLoop]: Abstraction has 23771 states and 59039 transitions. [2018-12-09 18:56:43,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 18:56:43,705 INFO L276 IsEmpty]: Start isEmpty. Operand 23771 states and 59039 transitions. [2018-12-09 18:56:43,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 18:56:43,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:43,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:43,720 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:43,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:43,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1719044832, now seen corresponding path program 2 times [2018-12-09 18:56:43,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:43,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:43,721 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:43,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:43,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:43,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:43,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-09 18:56:43,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:43,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 18:56:43,821 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:43,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 18:56:43,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 18:56:43,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:56:43,822 INFO L87 Difference]: Start difference. First operand 23771 states and 59039 transitions. Second operand 9 states. [2018-12-09 18:56:44,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:44,381 INFO L93 Difference]: Finished difference Result 25846 states and 63640 transitions. [2018-12-09 18:56:44,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-09 18:56:44,381 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2018-12-09 18:56:44,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:44,401 INFO L225 Difference]: With dead ends: 25846 [2018-12-09 18:56:44,401 INFO L226 Difference]: Without dead ends: 25846 [2018-12-09 18:56:44,402 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=235, Unknown=0, NotChecked=0, Total=342 [2018-12-09 18:56:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25846 states. [2018-12-09 18:56:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25846 to 24433. [2018-12-09 18:56:44,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24433 states. [2018-12-09 18:56:44,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24433 states to 24433 states and 60587 transitions. [2018-12-09 18:56:44,623 INFO L78 Accepts]: Start accepts. Automaton has 24433 states and 60587 transitions. Word has length 125 [2018-12-09 18:56:44,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:44,623 INFO L480 AbstractCegarLoop]: Abstraction has 24433 states and 60587 transitions. [2018-12-09 18:56:44,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 18:56:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 24433 states and 60587 transitions. [2018-12-09 18:56:44,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 18:56:44,641 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:44,641 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:44,641 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:44,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:44,641 INFO L82 PathProgramCache]: Analyzing trace with hash -2048810593, now seen corresponding path program 1 times [2018-12-09 18:56:44,641 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:44,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:44,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:56:44,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:44,642 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:44,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:44,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:44,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-09 18:56:44,761 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:44,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-09 18:56:44,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-09 18:56:44,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-09 18:56:44,762 INFO L87 Difference]: Start difference. First operand 24433 states and 60587 transitions. Second operand 9 states. [2018-12-09 18:56:45,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:45,428 INFO L93 Difference]: Finished difference Result 29203 states and 71067 transitions. [2018-12-09 18:56:45,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 18:56:45,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 125 [2018-12-09 18:56:45,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:45,450 INFO L225 Difference]: With dead ends: 29203 [2018-12-09 18:56:45,450 INFO L226 Difference]: Without dead ends: 29118 [2018-12-09 18:56:45,451 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2018-12-09 18:56:45,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29118 states. [2018-12-09 18:56:45,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29118 to 26341. [2018-12-09 18:56:45,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26341 states. [2018-12-09 18:56:45,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26341 states to 26341 states and 64947 transitions. [2018-12-09 18:56:45,695 INFO L78 Accepts]: Start accepts. Automaton has 26341 states and 64947 transitions. Word has length 125 [2018-12-09 18:56:45,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:45,695 INFO L480 AbstractCegarLoop]: Abstraction has 26341 states and 64947 transitions. [2018-12-09 18:56:45,695 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-09 18:56:45,695 INFO L276 IsEmpty]: Start isEmpty. Operand 26341 states and 64947 transitions. [2018-12-09 18:56:45,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-12-09 18:56:45,717 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:45,717 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:45,718 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:45,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:45,718 INFO L82 PathProgramCache]: Analyzing trace with hash -604502304, now seen corresponding path program 1 times [2018-12-09 18:56:45,718 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:45,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:45,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:45,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:45,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:45,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:45,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:45,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:45,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:56:45,787 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:45,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:56:45,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:56:45,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:56:45,788 INFO L87 Difference]: Start difference. First operand 26341 states and 64947 transitions. Second operand 6 states. [2018-12-09 18:56:45,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:45,999 INFO L93 Difference]: Finished difference Result 13137 states and 31368 transitions. [2018-12-09 18:56:45,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 18:56:45,999 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2018-12-09 18:56:45,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:46,008 INFO L225 Difference]: With dead ends: 13137 [2018-12-09 18:56:46,008 INFO L226 Difference]: Without dead ends: 13137 [2018-12-09 18:56:46,008 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-09 18:56:46,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13137 states. [2018-12-09 18:56:46,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13137 to 9814. [2018-12-09 18:56:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9814 states. [2018-12-09 18:56:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9814 states to 9814 states and 23462 transitions. [2018-12-09 18:56:46,092 INFO L78 Accepts]: Start accepts. Automaton has 9814 states and 23462 transitions. Word has length 125 [2018-12-09 18:56:46,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:46,092 INFO L480 AbstractCegarLoop]: Abstraction has 9814 states and 23462 transitions. [2018-12-09 18:56:46,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:56:46,092 INFO L276 IsEmpty]: Start isEmpty. Operand 9814 states and 23462 transitions. [2018-12-09 18:56:46,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 18:56:46,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:46,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:46,099 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:46,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:46,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1950787140, now seen corresponding path program 1 times [2018-12-09 18:56:46,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:46,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:46,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:46,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:46,100 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:46,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:46,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:46,129 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:46,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 18:56:46,130 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:46,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 18:56:46,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 18:56:46,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 18:56:46,130 INFO L87 Difference]: Start difference. First operand 9814 states and 23462 transitions. Second operand 4 states. [2018-12-09 18:56:46,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:46,179 INFO L93 Difference]: Finished difference Result 9654 states and 22982 transitions. [2018-12-09 18:56:46,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:56:46,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 127 [2018-12-09 18:56:46,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:46,186 INFO L225 Difference]: With dead ends: 9654 [2018-12-09 18:56:46,186 INFO L226 Difference]: Without dead ends: 9654 [2018-12-09 18:56:46,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:56:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9654 states. [2018-12-09 18:56:46,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9654 to 8946. [2018-12-09 18:56:46,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8946 states. [2018-12-09 18:56:46,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8946 states to 8946 states and 21317 transitions. [2018-12-09 18:56:46,254 INFO L78 Accepts]: Start accepts. Automaton has 8946 states and 21317 transitions. Word has length 127 [2018-12-09 18:56:46,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:46,254 INFO L480 AbstractCegarLoop]: Abstraction has 8946 states and 21317 transitions. [2018-12-09 18:56:46,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 18:56:46,254 INFO L276 IsEmpty]: Start isEmpty. Operand 8946 states and 21317 transitions. [2018-12-09 18:56:46,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 18:56:46,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:46,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:46,260 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:46,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:46,260 INFO L82 PathProgramCache]: Analyzing trace with hash 902297316, now seen corresponding path program 1 times [2018-12-09 18:56:46,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:46,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:46,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:46,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:46,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:46,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:46,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:46,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:46,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:56:46,324 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:46,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:56:46,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:56:46,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:56:46,325 INFO L87 Difference]: Start difference. First operand 8946 states and 21317 transitions. Second operand 5 states. [2018-12-09 18:56:46,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:46,463 INFO L93 Difference]: Finished difference Result 9394 states and 22421 transitions. [2018-12-09 18:56:46,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 18:56:46,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 127 [2018-12-09 18:56:46,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:46,470 INFO L225 Difference]: With dead ends: 9394 [2018-12-09 18:56:46,470 INFO L226 Difference]: Without dead ends: 9362 [2018-12-09 18:56:46,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:56:46,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9362 states. [2018-12-09 18:56:46,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9362 to 8747. [2018-12-09 18:56:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8747 states. [2018-12-09 18:56:46,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8747 states to 8747 states and 20821 transitions. [2018-12-09 18:56:46,532 INFO L78 Accepts]: Start accepts. Automaton has 8747 states and 20821 transitions. Word has length 127 [2018-12-09 18:56:46,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:46,532 INFO L480 AbstractCegarLoop]: Abstraction has 8747 states and 20821 transitions. [2018-12-09 18:56:46,532 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:56:46,532 INFO L276 IsEmpty]: Start isEmpty. Operand 8747 states and 20821 transitions. [2018-12-09 18:56:46,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 18:56:46,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:46,537 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:46,537 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:46,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:46,538 INFO L82 PathProgramCache]: Analyzing trace with hash 2147061797, now seen corresponding path program 1 times [2018-12-09 18:56:46,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:46,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:46,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:46,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:46,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:46,602 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:46,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 18:56:46,602 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:46,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 18:56:46,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 18:56:46,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 18:56:46,602 INFO L87 Difference]: Start difference. First operand 8747 states and 20821 transitions. Second operand 6 states. [2018-12-09 18:56:47,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:47,023 INFO L93 Difference]: Finished difference Result 11466 states and 26592 transitions. [2018-12-09 18:56:47,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 18:56:47,023 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2018-12-09 18:56:47,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:47,031 INFO L225 Difference]: With dead ends: 11466 [2018-12-09 18:56:47,031 INFO L226 Difference]: Without dead ends: 11281 [2018-12-09 18:56:47,031 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-12-09 18:56:47,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11281 states. [2018-12-09 18:56:47,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11281 to 9855. [2018-12-09 18:56:47,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9855 states. [2018-12-09 18:56:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9855 states to 9855 states and 23410 transitions. [2018-12-09 18:56:47,107 INFO L78 Accepts]: Start accepts. Automaton has 9855 states and 23410 transitions. Word has length 127 [2018-12-09 18:56:47,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:47,108 INFO L480 AbstractCegarLoop]: Abstraction has 9855 states and 23410 transitions. [2018-12-09 18:56:47,108 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 18:56:47,108 INFO L276 IsEmpty]: Start isEmpty. Operand 9855 states and 23410 transitions. [2018-12-09 18:56:47,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 18:56:47,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:47,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:47,114 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:47,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:47,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1663386470, now seen corresponding path program 1 times [2018-12-09 18:56:47,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:47,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:47,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:47,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:47,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:47,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:47,196 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:47,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 18:56:47,196 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:47,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 18:56:47,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 18:56:47,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:56:47,196 INFO L87 Difference]: Start difference. First operand 9855 states and 23410 transitions. Second operand 7 states. [2018-12-09 18:56:47,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:47,670 INFO L93 Difference]: Finished difference Result 12966 states and 30242 transitions. [2018-12-09 18:56:47,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 18:56:47,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 127 [2018-12-09 18:56:47,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:47,679 INFO L225 Difference]: With dead ends: 12966 [2018-12-09 18:56:47,680 INFO L226 Difference]: Without dead ends: 12966 [2018-12-09 18:56:47,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 5 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2018-12-09 18:56:47,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12966 states. [2018-12-09 18:56:47,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12966 to 10398. [2018-12-09 18:56:47,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10398 states. [2018-12-09 18:56:47,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10398 states to 10398 states and 24567 transitions. [2018-12-09 18:56:47,764 INFO L78 Accepts]: Start accepts. Automaton has 10398 states and 24567 transitions. Word has length 127 [2018-12-09 18:56:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:47,764 INFO L480 AbstractCegarLoop]: Abstraction has 10398 states and 24567 transitions. [2018-12-09 18:56:47,764 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 18:56:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 10398 states and 24567 transitions. [2018-12-09 18:56:47,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-12-09 18:56:47,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:47,771 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:47,771 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:47,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:47,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1410400133, now seen corresponding path program 2 times [2018-12-09 18:56:47,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:47,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:47,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:47,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:47,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:47,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:47,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:47,825 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:47,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 18:56:47,826 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:47,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 18:56:47,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 18:56:47,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:56:47,826 INFO L87 Difference]: Start difference. First operand 10398 states and 24567 transitions. Second operand 8 states. [2018-12-09 18:56:48,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:48,684 INFO L93 Difference]: Finished difference Result 14094 states and 32941 transitions. [2018-12-09 18:56:48,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 18:56:48,685 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-12-09 18:56:48,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:48,700 INFO L225 Difference]: With dead ends: 14094 [2018-12-09 18:56:48,700 INFO L226 Difference]: Without dead ends: 14094 [2018-12-09 18:56:48,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-12-09 18:56:48,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14094 states. [2018-12-09 18:56:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14094 to 9865. [2018-12-09 18:56:48,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9865 states. [2018-12-09 18:56:48,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9865 states to 9865 states and 23304 transitions. [2018-12-09 18:56:48,792 INFO L78 Accepts]: Start accepts. Automaton has 9865 states and 23304 transitions. Word has length 127 [2018-12-09 18:56:48,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:48,793 INFO L480 AbstractCegarLoop]: Abstraction has 9865 states and 23304 transitions. [2018-12-09 18:56:48,793 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 18:56:48,793 INFO L276 IsEmpty]: Start isEmpty. Operand 9865 states and 23304 transitions. [2018-12-09 18:56:48,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-09 18:56:48,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:48,799 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:48,799 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:48,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:48,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1553370620, now seen corresponding path program 1 times [2018-12-09 18:56:48,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:48,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:48,800 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 18:56:48,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:48,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:48,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:48,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 18:56:48,847 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:48,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 18:56:48,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 18:56:48,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 18:56:48,847 INFO L87 Difference]: Start difference. First operand 9865 states and 23304 transitions. Second operand 7 states. [2018-12-09 18:56:49,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:49,237 INFO L93 Difference]: Finished difference Result 10400 states and 24462 transitions. [2018-12-09 18:56:49,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 18:56:49,237 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 129 [2018-12-09 18:56:49,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:49,248 INFO L225 Difference]: With dead ends: 10400 [2018-12-09 18:56:49,248 INFO L226 Difference]: Without dead ends: 10380 [2018-12-09 18:56:49,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2018-12-09 18:56:49,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10380 states. [2018-12-09 18:56:49,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10380 to 9872. [2018-12-09 18:56:49,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9872 states. [2018-12-09 18:56:49,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9872 states to 9872 states and 23319 transitions. [2018-12-09 18:56:49,327 INFO L78 Accepts]: Start accepts. Automaton has 9872 states and 23319 transitions. Word has length 129 [2018-12-09 18:56:49,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:49,328 INFO L480 AbstractCegarLoop]: Abstraction has 9872 states and 23319 transitions. [2018-12-09 18:56:49,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 18:56:49,328 INFO L276 IsEmpty]: Start isEmpty. Operand 9872 states and 23319 transitions. [2018-12-09 18:56:49,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-09 18:56:49,334 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:49,334 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:49,334 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:49,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:49,334 INFO L82 PathProgramCache]: Analyzing trace with hash -116747194, now seen corresponding path program 1 times [2018-12-09 18:56:49,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:49,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:49,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:49,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:49,335 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:49,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:49,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:49,384 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:49,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 18:56:49,384 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:49,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 18:56:49,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 18:56:49,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 18:56:49,385 INFO L87 Difference]: Start difference. First operand 9872 states and 23319 transitions. Second operand 5 states. [2018-12-09 18:56:49,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:49,422 INFO L93 Difference]: Finished difference Result 12460 states and 29137 transitions. [2018-12-09 18:56:49,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 18:56:49,422 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2018-12-09 18:56:49,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:49,431 INFO L225 Difference]: With dead ends: 12460 [2018-12-09 18:56:49,431 INFO L226 Difference]: Without dead ends: 12460 [2018-12-09 18:56:49,431 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-09 18:56:49,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12460 states. [2018-12-09 18:56:49,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12460 to 8986. [2018-12-09 18:56:49,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8986 states. [2018-12-09 18:56:49,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8986 states to 8986 states and 20770 transitions. [2018-12-09 18:56:49,507 INFO L78 Accepts]: Start accepts. Automaton has 8986 states and 20770 transitions. Word has length 129 [2018-12-09 18:56:49,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:49,507 INFO L480 AbstractCegarLoop]: Abstraction has 8986 states and 20770 transitions. [2018-12-09 18:56:49,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 18:56:49,507 INFO L276 IsEmpty]: Start isEmpty. Operand 8986 states and 20770 transitions. [2018-12-09 18:56:49,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-12-09 18:56:49,512 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:49,512 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:49,513 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:49,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:49,513 INFO L82 PathProgramCache]: Analyzing trace with hash 3372679, now seen corresponding path program 1 times [2018-12-09 18:56:49,513 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:49,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:49,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:49,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:49,514 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:49,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:49,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:49,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 18:56:49,628 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:49,628 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 18:56:49,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 18:56:49,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-12-09 18:56:49,629 INFO L87 Difference]: Start difference. First operand 8986 states and 20770 transitions. Second operand 12 states. [2018-12-09 18:56:50,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:50,548 INFO L93 Difference]: Finished difference Result 23347 states and 53585 transitions. [2018-12-09 18:56:50,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-12-09 18:56:50,548 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 129 [2018-12-09 18:56:50,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:50,557 INFO L225 Difference]: With dead ends: 23347 [2018-12-09 18:56:50,557 INFO L226 Difference]: Without dead ends: 12906 [2018-12-09 18:56:50,557 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=196, Invalid=994, Unknown=0, NotChecked=0, Total=1190 [2018-12-09 18:56:50,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12906 states. [2018-12-09 18:56:50,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12906 to 9380. [2018-12-09 18:56:50,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9380 states. [2018-12-09 18:56:50,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9380 states to 9380 states and 21444 transitions. [2018-12-09 18:56:50,635 INFO L78 Accepts]: Start accepts. Automaton has 9380 states and 21444 transitions. Word has length 129 [2018-12-09 18:56:50,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:50,635 INFO L480 AbstractCegarLoop]: Abstraction has 9380 states and 21444 transitions. [2018-12-09 18:56:50,635 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 18:56:50,636 INFO L276 IsEmpty]: Start isEmpty. Operand 9380 states and 21444 transitions. [2018-12-09 18:56:50,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-09 18:56:50,642 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:50,642 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:50,642 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:50,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:50,642 INFO L82 PathProgramCache]: Analyzing trace with hash -681826470, now seen corresponding path program 1 times [2018-12-09 18:56:50,642 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:50,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:50,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:50,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:50,643 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:50,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:50,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:50,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 18:56:50,688 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:50,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 18:56:50,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 18:56:50,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 18:56:50,689 INFO L87 Difference]: Start difference. First operand 9380 states and 21444 transitions. Second operand 8 states. [2018-12-09 18:56:50,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:50,898 INFO L93 Difference]: Finished difference Result 9775 states and 22259 transitions. [2018-12-09 18:56:50,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 18:56:50,898 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 131 [2018-12-09 18:56:50,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:50,904 INFO L225 Difference]: With dead ends: 9775 [2018-12-09 18:56:50,904 INFO L226 Difference]: Without dead ends: 9775 [2018-12-09 18:56:50,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2018-12-09 18:56:50,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9775 states. [2018-12-09 18:56:50,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9775 to 9456. [2018-12-09 18:56:50,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9456 states. [2018-12-09 18:56:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9456 states to 9456 states and 21590 transitions. [2018-12-09 18:56:50,973 INFO L78 Accepts]: Start accepts. Automaton has 9456 states and 21590 transitions. Word has length 131 [2018-12-09 18:56:50,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:50,973 INFO L480 AbstractCegarLoop]: Abstraction has 9456 states and 21590 transitions. [2018-12-09 18:56:50,973 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 18:56:50,973 INFO L276 IsEmpty]: Start isEmpty. Operand 9456 states and 21590 transitions. [2018-12-09 18:56:50,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-09 18:56:50,979 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:50,979 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:50,979 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:50,980 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:50,980 INFO L82 PathProgramCache]: Analyzing trace with hash 95749886, now seen corresponding path program 1 times [2018-12-09 18:56:50,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:50,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:50,981 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:50,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:50,981 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 18:56:51,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 18:56:51,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 18:56:51,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 18:56:51,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 18:56:51,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 18:56:51,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 18:56:51,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-12-09 18:56:51,090 INFO L87 Difference]: Start difference. First operand 9456 states and 21590 transitions. Second operand 14 states. [2018-12-09 18:56:51,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 18:56:51,547 INFO L93 Difference]: Finished difference Result 14709 states and 34247 transitions. [2018-12-09 18:56:51,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-09 18:56:51,547 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 131 [2018-12-09 18:56:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 18:56:51,555 INFO L225 Difference]: With dead ends: 14709 [2018-12-09 18:56:51,555 INFO L226 Difference]: Without dead ends: 12871 [2018-12-09 18:56:51,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2018-12-09 18:56:51,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12871 states. [2018-12-09 18:56:51,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12871 to 10581. [2018-12-09 18:56:51,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10581 states. [2018-12-09 18:56:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10581 states to 10581 states and 24008 transitions. [2018-12-09 18:56:51,639 INFO L78 Accepts]: Start accepts. Automaton has 10581 states and 24008 transitions. Word has length 131 [2018-12-09 18:56:51,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 18:56:51,639 INFO L480 AbstractCegarLoop]: Abstraction has 10581 states and 24008 transitions. [2018-12-09 18:56:51,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 18:56:51,639 INFO L276 IsEmpty]: Start isEmpty. Operand 10581 states and 24008 transitions. [2018-12-09 18:56:51,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-12-09 18:56:51,645 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 18:56:51,646 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 18:56:51,646 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 18:56:51,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 18:56:51,646 INFO L82 PathProgramCache]: Analyzing trace with hash -374762910, now seen corresponding path program 2 times [2018-12-09 18:56:51,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 18:56:51,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:51,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 18:56:51,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 18:56:51,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 18:56:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 18:56:51,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 18:56:51,695 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 18:56:51,777 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 18:56:51,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 06:56:51 BasicIcfg [2018-12-09 18:56:51,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 18:56:51,779 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 18:56:51,779 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 18:56:51,779 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 18:56:51,779 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 06:55:38" (3/4) ... [2018-12-09 18:56:51,781 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 18:56:51,871 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a28bae6d-3927-42f9-9cbf-9f4f23cb6027/bin-2019/utaipan/witness.graphml [2018-12-09 18:56:51,872 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 18:56:51,872 INFO L168 Benchmark]: Toolchain (without parser) took 74095.07 ms. Allocated memory was 1.0 GB in the beginning and 6.6 GB in the end (delta: 5.6 GB). Free memory was 948.1 MB in the beginning and 2.6 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-12-09 18:56:51,873 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 18:56:51,873 INFO L168 Benchmark]: CACSL2BoogieTranslator took 359.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -142.3 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-12-09 18:56:51,873 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 18:56:51,873 INFO L168 Benchmark]: Boogie Preprocessor took 23.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 18:56:51,874 INFO L168 Benchmark]: RCFGBuilder took 458.28 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: 71.9 MB). Peak memory consumption was 71.9 MB. Max. memory is 11.5 GB. [2018-12-09 18:56:51,874 INFO L168 Benchmark]: TraceAbstraction took 73121.95 ms. Allocated memory was 1.1 GB in the beginning and 6.6 GB in the end (delta: 5.5 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2018-12-09 18:56:51,874 INFO L168 Benchmark]: Witness Printer took 92.94 ms. Allocated memory is still 6.6 GB. Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. [2018-12-09 18:56:51,875 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 359.74 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.7 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -142.3 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.76 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 458.28 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: 71.9 MB). Peak memory consumption was 71.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 73121.95 ms. Allocated memory was 1.1 GB in the beginning and 6.6 GB in the end (delta: 5.5 GB). Free memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. * Witness Printer took 92.94 ms. Allocated memory is still 6.6 GB. Free memory was 2.7 GB in the beginning and 2.6 GB in the end (delta: 46.3 MB). Peak memory consumption was 46.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L675] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L676] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L677] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L679] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L681] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L682] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L683] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L684] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L685] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L686] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L690] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L691] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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}] [L692] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L693] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L694] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L695] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, 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] [L696] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, 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] [L697] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L789] -1 pthread_t t1601; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, 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] [L790] FCALL, FORK -1 pthread_create(&t1601, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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] [L701] 0 y = 2 [L704] 0 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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] [L707] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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] [L791] -1 pthread_t t1602; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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] [L792] FCALL, FORK -1 pthread_create(&t1602, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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] [L707] EXPR 0 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L721] 1 x = 2 [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd2 = (_Bool)1 [L735] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L736] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L707] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L744] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L745] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L747] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L747] 1 y = y$flush_delayed ? y$mem_tmp : y [L748] 1 y$flush_delayed = (_Bool)0 [L751] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L752] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L753] 1 y$flush_delayed = weak$$choice2 [L754] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L755] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L755] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L755] 1 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L756] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L756] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L757] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L757] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L758] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L758] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L759] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L759] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L760] EXPR 1 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L760] 1 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L761] EXPR 1 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L761] 1 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L762] 1 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L763] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L763] 1 y = y$flush_delayed ? y$mem_tmp : y [L764] 1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L767] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L767] 1 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L768] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L768] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L707] 0 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L769] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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] [L769] 1 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 [L770] EXPR 1 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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] [L708] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 1 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] EXPR 1 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 1 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 [L774] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L708] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L709] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L709] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L710] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0] [L710] 0 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L711] EXPR 0 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0] [L711] 0 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L714] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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] [L794] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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] [L798] 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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] [L798] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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] [L798] 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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] [L798] -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) [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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] [L799] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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] [L800] -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 [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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] [L801] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 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_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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] [L802] -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 [L805] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L806] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L807] -1 y$flush_delayed = weak$$choice2 [L808] -1 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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] [L809] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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] [L809] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L810] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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] [L810] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L811] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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] [L811] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L812] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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] [L812] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L813] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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] [L813] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L814] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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] [L814] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L815] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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] [L815] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L816] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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] [L817] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, 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] [L817] -1 y = y$flush_delayed ? y$mem_tmp : y [L818] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, 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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 348 locations, 3 error locations. UNSAFE Result, 73.0s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 28.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 20302 SDtfs, 21433 SDslu, 59820 SDs, 0 SdLazy, 24551 SolverSat, 1217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 481 GetRequests, 116 SyntacticMatches, 40 SemanticMatches, 325 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=182336occurred in iteration=2, 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: 32.5s AutomataMinimizationTime, 36 MinimizatonAttempts, 470339 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 3738 NumberOfCodeBlocks, 3738 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3571 ConstructedInterpolants, 0 QuantifiedInterpolants, 1057218 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...