./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi008_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_6525336c-84cf-4fb9-9ca9-342eded348f7/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6525336c-84cf-4fb9-9ca9-342eded348f7/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6525336c-84cf-4fb9-9ca9-342eded348f7/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6525336c-84cf-4fb9-9ca9-342eded348f7/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi008_power.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6525336c-84cf-4fb9-9ca9-342eded348f7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6525336c-84cf-4fb9-9ca9-342eded348f7/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 158274064a5b01e53a5759ad2c88b4f4d442183d .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 10:23:24,313 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 10:23:24,314 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 10:23:24,321 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 10:23:24,322 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 10:23:24,322 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 10:23:24,323 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 10:23:24,323 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 10:23:24,324 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 10:23:24,325 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 10:23:24,325 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 10:23:24,325 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 10:23:24,325 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 10:23:24,326 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 10:23:24,326 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 10:23:24,327 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 10:23:24,327 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 10:23:24,328 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 10:23:24,329 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 10:23:24,330 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 10:23:24,331 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 10:23:24,331 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 10:23:24,332 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 10:23:24,332 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 10:23:24,332 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 10:23:24,333 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 10:23:24,333 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 10:23:24,334 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 10:23:24,334 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 10:23:24,335 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 10:23:24,335 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 10:23:24,335 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 10:23:24,335 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 10:23:24,335 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 10:23:24,336 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 10:23:24,336 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 10:23:24,336 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6525336c-84cf-4fb9-9ca9-342eded348f7/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 10:23:24,346 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 10:23:24,346 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 10:23:24,347 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 10:23:24,347 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 10:23:24,347 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 10:23:24,347 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 10:23:24,347 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 10:23:24,348 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 10:23:24,348 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 10:23:24,348 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 10:23:24,348 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 10:23:24,348 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 10:23:24,348 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 10:23:24,349 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 10:23:24,349 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 10:23:24,349 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 10:23:24,349 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 10:23:24,349 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 10:23:24,350 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 10:23:24,350 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 10:23:24,350 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 10:23:24,350 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 10:23:24,350 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 10:23:24,350 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 10:23:24,350 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 10:23:24,351 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 10:23:24,351 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 10:23:24,351 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 10:23:24,351 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 10:23:24,351 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 10:23:24,351 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 10:23:24,351 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 10:23:24,352 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 10:23:24,352 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 10:23:24,352 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 10:23:24,352 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 10:23:24,352 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_6525336c-84cf-4fb9-9ca9-342eded348f7/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 -> 158274064a5b01e53a5759ad2c88b4f4d442183d [2018-12-09 10:23:24,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 10:23:24,382 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 10:23:24,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 10:23:24,386 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 10:23:24,386 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 10:23:24,386 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6525336c-84cf-4fb9-9ca9-342eded348f7/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi008_power.oepc_false-unreach-call.i [2018-12-09 10:23:24,422 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6525336c-84cf-4fb9-9ca9-342eded348f7/bin-2019/utaipan/data/4c613c80f/b7fd20dd8cf44576be83a5f005ff9db5/FLAGad06ea7b5 [2018-12-09 10:23:24,831 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 10:23:24,831 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6525336c-84cf-4fb9-9ca9-342eded348f7/sv-benchmarks/c/pthread-wmm/rfi008_power.oepc_false-unreach-call.i [2018-12-09 10:23:24,839 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6525336c-84cf-4fb9-9ca9-342eded348f7/bin-2019/utaipan/data/4c613c80f/b7fd20dd8cf44576be83a5f005ff9db5/FLAGad06ea7b5 [2018-12-09 10:23:24,848 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6525336c-84cf-4fb9-9ca9-342eded348f7/bin-2019/utaipan/data/4c613c80f/b7fd20dd8cf44576be83a5f005ff9db5 [2018-12-09 10:23:24,850 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 10:23:24,850 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 10:23:24,851 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 10:23:24,851 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 10:23:24,854 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 10:23:24,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:23:24" (1/1) ... [2018-12-09 10:23:24,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cdc5e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:24, skipping insertion in model container [2018-12-09 10:23:24,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 10:23:24" (1/1) ... [2018-12-09 10:23:24,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 10:23:24,890 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 10:23:25,077 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:23:25,085 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 10:23:25,159 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 10:23:25,189 INFO L195 MainTranslator]: Completed translation [2018-12-09 10:23:25,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:25 WrapperNode [2018-12-09 10:23:25,190 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 10:23:25,190 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 10:23:25,190 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 10:23:25,190 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 10:23:25,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:25" (1/1) ... [2018-12-09 10:23:25,207 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:25" (1/1) ... [2018-12-09 10:23:25,225 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 10:23:25,225 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 10:23:25,225 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 10:23:25,225 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 10:23:25,231 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:25" (1/1) ... [2018-12-09 10:23:25,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:25" (1/1) ... [2018-12-09 10:23:25,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:25" (1/1) ... [2018-12-09 10:23:25,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:25" (1/1) ... [2018-12-09 10:23:25,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:25" (1/1) ... [2018-12-09 10:23:25,248 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:25" (1/1) ... [2018-12-09 10:23:25,251 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:25" (1/1) ... [2018-12-09 10:23:25,254 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 10:23:25,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 10:23:25,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 10:23:25,255 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 10:23:25,256 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6525336c-84cf-4fb9-9ca9-342eded348f7/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 10:23:25,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 10:23:25,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 10:23:25,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 10:23:25,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 10:23:25,295 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 10:23:25,295 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 10:23:25,295 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 10:23:25,295 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 10:23:25,295 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 10:23:25,295 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 10:23:25,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 10:23:25,296 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 10:23:25,679 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 10:23:25,679 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 10:23:25,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:23:25 BoogieIcfgContainer [2018-12-09 10:23:25,680 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 10:23:25,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 10:23:25,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 10:23:25,682 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 10:23:25,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 10:23:24" (1/3) ... [2018-12-09 10:23:25,682 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87ab03a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:23:25, skipping insertion in model container [2018-12-09 10:23:25,682 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 10:23:25" (2/3) ... [2018-12-09 10:23:25,683 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@87ab03a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 10:23:25, skipping insertion in model container [2018-12-09 10:23:25,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:23:25" (3/3) ... [2018-12-09 10:23:25,684 INFO L112 eAbstractionObserver]: Analyzing ICFG rfi008_power.oepc_false-unreach-call.i [2018-12-09 10:23:25,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,711 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,711 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,712 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,712 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,712 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,712 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,712 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,713 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,714 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,715 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,716 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,717 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,718 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,719 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,720 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,721 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,722 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,723 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,724 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,725 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,726 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,727 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,728 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,729 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet32.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,730 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,730 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,731 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,731 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,731 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,731 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,731 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,731 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,731 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,732 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,732 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,732 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,732 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,732 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,732 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,732 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,733 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,733 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,733 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,733 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,733 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,733 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,733 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,734 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,734 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,734 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,734 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,734 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,734 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,734 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,734 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,735 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,735 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,735 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,735 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,735 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,735 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,735 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,735 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,736 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,736 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,736 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,736 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,736 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,736 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,736 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,736 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,737 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,737 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,737 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,737 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,737 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,737 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,737 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,737 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,738 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,739 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,740 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,741 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,742 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,743 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,743 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,743 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,743 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,743 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,743 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,743 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,743 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,744 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,744 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,744 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,744 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,744 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,744 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,744 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,744 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,745 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,746 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet62.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 10:23:25,750 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 10:23:25,750 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 10:23:25,755 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 10:23:25,764 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 10:23:25,778 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 10:23:25,778 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 10:23:25,778 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 10:23:25,778 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 10:23:25,778 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 10:23:25,779 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 10:23:25,779 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 10:23:25,779 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 10:23:25,785 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 186places, 245 transitions [2018-12-09 10:23:33,362 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104360 states. [2018-12-09 10:23:33,364 INFO L276 IsEmpty]: Start isEmpty. Operand 104360 states. [2018-12-09 10:23:33,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 10:23:33,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:33,369 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] [2018-12-09 10:23:33,370 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:33,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:33,373 INFO L82 PathProgramCache]: Analyzing trace with hash -513582767, now seen corresponding path program 1 times [2018-12-09 10:23:33,375 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:33,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:33,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:33,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:33,409 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:33,506 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 10:23:33,508 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:33,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:23:33,508 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:33,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:23:33,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:23:33,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:23:33,521 INFO L87 Difference]: Start difference. First operand 104360 states. Second operand 4 states. [2018-12-09 10:23:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:34,589 INFO L93 Difference]: Finished difference Result 192000 states and 772893 transitions. [2018-12-09 10:23:34,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:23:34,590 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-12-09 10:23:34,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:35,045 INFO L225 Difference]: With dead ends: 192000 [2018-12-09 10:23:35,045 INFO L226 Difference]: Without dead ends: 135832 [2018-12-09 10:23:35,046 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 10:23:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135832 states. [2018-12-09 10:23:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135832 to 77068. [2018-12-09 10:23:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77068 states. [2018-12-09 10:23:39,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77068 states to 77068 states and 313611 transitions. [2018-12-09 10:23:39,059 INFO L78 Accepts]: Start accepts. Automaton has 77068 states and 313611 transitions. Word has length 35 [2018-12-09 10:23:39,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:39,059 INFO L480 AbstractCegarLoop]: Abstraction has 77068 states and 313611 transitions. [2018-12-09 10:23:39,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:23:39,060 INFO L276 IsEmpty]: Start isEmpty. Operand 77068 states and 313611 transitions. [2018-12-09 10:23:39,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-09 10:23:39,064 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:39,064 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:23:39,065 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:39,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:39,065 INFO L82 PathProgramCache]: Analyzing trace with hash 133524022, now seen corresponding path program 1 times [2018-12-09 10:23:39,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:39,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:39,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:39,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:39,068 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:39,127 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 10:23:39,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:39,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:23:39,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:39,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:23:39,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:23:39,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:23:39,129 INFO L87 Difference]: Start difference. First operand 77068 states and 313611 transitions. Second operand 5 states. [2018-12-09 10:23:40,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:40,212 INFO L93 Difference]: Finished difference Result 195844 states and 748303 transitions. [2018-12-09 10:23:40,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:23:40,213 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2018-12-09 10:23:40,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:40,627 INFO L225 Difference]: With dead ends: 195844 [2018-12-09 10:23:40,627 INFO L226 Difference]: Without dead ends: 195292 [2018-12-09 10:23:40,628 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 10:23:42,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195292 states. [2018-12-09 10:23:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195292 to 123067. [2018-12-09 10:23:43,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123067 states. [2018-12-09 10:23:44,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123067 states to 123067 states and 470493 transitions. [2018-12-09 10:23:44,253 INFO L78 Accepts]: Start accepts. Automaton has 123067 states and 470493 transitions. Word has length 47 [2018-12-09 10:23:44,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:44,254 INFO L480 AbstractCegarLoop]: Abstraction has 123067 states and 470493 transitions. [2018-12-09 10:23:44,254 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:23:44,254 INFO L276 IsEmpty]: Start isEmpty. Operand 123067 states and 470493 transitions. [2018-12-09 10:23:44,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 10:23:44,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:44,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:23:44,258 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:44,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:44,258 INFO L82 PathProgramCache]: Analyzing trace with hash 84336861, now seen corresponding path program 1 times [2018-12-09 10:23:44,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:44,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:44,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:44,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:44,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:44,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:44,304 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 10:23:44,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:44,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:23:44,304 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:44,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:23:44,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:23:44,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:23:44,305 INFO L87 Difference]: Start difference. First operand 123067 states and 470493 transitions. Second operand 5 states. [2018-12-09 10:23:45,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:45,582 INFO L93 Difference]: Finished difference Result 253868 states and 961457 transitions. [2018-12-09 10:23:45,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:23:45,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-09 10:23:45,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:47,862 INFO L225 Difference]: With dead ends: 253868 [2018-12-09 10:23:47,862 INFO L226 Difference]: Without dead ends: 253356 [2018-12-09 10:23:47,863 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 10:23:49,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253356 states. [2018-12-09 10:23:51,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253356 to 135934. [2018-12-09 10:23:51,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135934 states. [2018-12-09 10:23:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135934 states to 135934 states and 515687 transitions. [2018-12-09 10:23:51,867 INFO L78 Accepts]: Start accepts. Automaton has 135934 states and 515687 transitions. Word has length 48 [2018-12-09 10:23:51,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:51,867 INFO L480 AbstractCegarLoop]: Abstraction has 135934 states and 515687 transitions. [2018-12-09 10:23:51,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:23:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 135934 states and 515687 transitions. [2018-12-09 10:23:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 10:23:51,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:51,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:23:51,873 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:51,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:51,874 INFO L82 PathProgramCache]: Analyzing trace with hash 475594115, now seen corresponding path program 1 times [2018-12-09 10:23:51,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:51,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:51,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:51,876 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:51,876 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:51,899 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 10:23:51,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:51,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:23:51,900 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:51,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:23:51,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:23:51,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:23:51,900 INFO L87 Difference]: Start difference. First operand 135934 states and 515687 transitions. Second operand 3 states. [2018-12-09 10:23:52,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:23:52,834 INFO L93 Difference]: Finished difference Result 234162 states and 866041 transitions. [2018-12-09 10:23:52,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:23:52,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 10:23:52,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:23:53,316 INFO L225 Difference]: With dead ends: 234162 [2018-12-09 10:23:53,316 INFO L226 Difference]: Without dead ends: 234162 [2018-12-09 10:23:53,317 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 10:23:55,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234162 states. [2018-12-09 10:23:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234162 to 207903. [2018-12-09 10:23:57,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207903 states. [2018-12-09 10:23:58,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207903 states to 207903 states and 772292 transitions. [2018-12-09 10:23:58,481 INFO L78 Accepts]: Start accepts. Automaton has 207903 states and 772292 transitions. Word has length 50 [2018-12-09 10:23:58,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:23:58,481 INFO L480 AbstractCegarLoop]: Abstraction has 207903 states and 772292 transitions. [2018-12-09 10:23:58,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:23:58,482 INFO L276 IsEmpty]: Start isEmpty. Operand 207903 states and 772292 transitions. [2018-12-09 10:23:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 10:23:58,496 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:23:58,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:23:58,497 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:23:58,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:23:58,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1121194702, now seen corresponding path program 1 times [2018-12-09 10:23:58,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:23:58,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:58,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:23:58,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:23:58,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:23:58,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:23:58,554 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 10:23:58,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:23:58,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:23:58,555 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:23:58,555 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:23:58,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:23:58,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:23:58,555 INFO L87 Difference]: Start difference. First operand 207903 states and 772292 transitions. Second operand 6 states. [2018-12-09 10:24:00,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:00,570 INFO L93 Difference]: Finished difference Result 402833 states and 1473119 transitions. [2018-12-09 10:24:00,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 10:24:00,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-09 10:24:00,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:01,430 INFO L225 Difference]: With dead ends: 402833 [2018-12-09 10:24:01,430 INFO L226 Difference]: Without dead ends: 402257 [2018-12-09 10:24:01,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-09 10:24:06,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402257 states. [2018-12-09 10:24:09,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402257 to 208069. [2018-12-09 10:24:09,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208069 states. [2018-12-09 10:24:10,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208069 states to 208069 states and 773298 transitions. [2018-12-09 10:24:10,271 INFO L78 Accepts]: Start accepts. Automaton has 208069 states and 773298 transitions. Word has length 54 [2018-12-09 10:24:10,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:10,272 INFO L480 AbstractCegarLoop]: Abstraction has 208069 states and 773298 transitions. [2018-12-09 10:24:10,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:24:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 208069 states and 773298 transitions. [2018-12-09 10:24:10,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 10:24:10,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:10,286 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:10,287 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:10,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:10,287 INFO L82 PathProgramCache]: Analyzing trace with hash 1930693029, now seen corresponding path program 1 times [2018-12-09 10:24:10,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:10,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:10,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:10,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:10,289 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:10,341 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 10:24:10,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:10,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:24:10,341 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:10,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:24:10,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:24:10,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:24:10,342 INFO L87 Difference]: Start difference. First operand 208069 states and 773298 transitions. Second operand 7 states. [2018-12-09 10:24:12,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:12,540 INFO L93 Difference]: Finished difference Result 325852 states and 1170129 transitions. [2018-12-09 10:24:12,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 10:24:12,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2018-12-09 10:24:12,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:13,186 INFO L225 Difference]: With dead ends: 325852 [2018-12-09 10:24:13,186 INFO L226 Difference]: Without dead ends: 325852 [2018-12-09 10:24:13,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 10:24:15,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325852 states. [2018-12-09 10:24:21,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325852 to 256642. [2018-12-09 10:24:21,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256642 states. [2018-12-09 10:24:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256642 states to 256642 states and 939283 transitions. [2018-12-09 10:24:22,110 INFO L78 Accepts]: Start accepts. Automaton has 256642 states and 939283 transitions. Word has length 54 [2018-12-09 10:24:22,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:22,110 INFO L480 AbstractCegarLoop]: Abstraction has 256642 states and 939283 transitions. [2018-12-09 10:24:22,110 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:24:22,110 INFO L276 IsEmpty]: Start isEmpty. Operand 256642 states and 939283 transitions. [2018-12-09 10:24:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-09 10:24:22,127 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:22,127 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:22,127 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:22,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:22,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1476770586, now seen corresponding path program 1 times [2018-12-09 10:24:22,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:22,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:22,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:22,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:22,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:22,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 10:24:22,165 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:22,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:24:22,165 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:22,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:24:22,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:24:22,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:24:22,166 INFO L87 Difference]: Start difference. First operand 256642 states and 939283 transitions. Second operand 3 states. [2018-12-09 10:24:22,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:22,934 INFO L93 Difference]: Finished difference Result 209798 states and 761087 transitions. [2018-12-09 10:24:22,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:24:22,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-09 10:24:22,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:23,361 INFO L225 Difference]: With dead ends: 209798 [2018-12-09 10:24:23,362 INFO L226 Difference]: Without dead ends: 209798 [2018-12-09 10:24:23,362 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 10:24:25,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209798 states. [2018-12-09 10:24:27,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209798 to 207253. [2018-12-09 10:24:27,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207253 states. [2018-12-09 10:24:27,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207253 states to 207253 states and 752339 transitions. [2018-12-09 10:24:27,942 INFO L78 Accepts]: Start accepts. Automaton has 207253 states and 752339 transitions. Word has length 54 [2018-12-09 10:24:27,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:27,942 INFO L480 AbstractCegarLoop]: Abstraction has 207253 states and 752339 transitions. [2018-12-09 10:24:27,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:24:27,942 INFO L276 IsEmpty]: Start isEmpty. Operand 207253 states and 752339 transitions. [2018-12-09 10:24:27,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-09 10:24:27,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:27,955 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:27,955 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:27,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:27,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1480801646, now seen corresponding path program 1 times [2018-12-09 10:24:27,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:27,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:27,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:27,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:27,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:27,990 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 10:24:27,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:27,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:24:27,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:27,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:24:27,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:24:27,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:24:27,991 INFO L87 Difference]: Start difference. First operand 207253 states and 752339 transitions. Second operand 4 states. [2018-12-09 10:24:28,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:28,090 INFO L93 Difference]: Finished difference Result 32822 states and 104262 transitions. [2018-12-09 10:24:28,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:24:28,091 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2018-12-09 10:24:28,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:28,125 INFO L225 Difference]: With dead ends: 32822 [2018-12-09 10:24:28,125 INFO L226 Difference]: Without dead ends: 24964 [2018-12-09 10:24:28,125 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 10:24:28,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24964 states. [2018-12-09 10:24:28,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24964 to 24717. [2018-12-09 10:24:28,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24717 states. [2018-12-09 10:24:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24717 states to 24717 states and 75708 transitions. [2018-12-09 10:24:28,687 INFO L78 Accepts]: Start accepts. Automaton has 24717 states and 75708 transitions. Word has length 55 [2018-12-09 10:24:28,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:28,687 INFO L480 AbstractCegarLoop]: Abstraction has 24717 states and 75708 transitions. [2018-12-09 10:24:28,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:24:28,687 INFO L276 IsEmpty]: Start isEmpty. Operand 24717 states and 75708 transitions. [2018-12-09 10:24:28,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 10:24:28,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:28,691 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:28,691 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:28,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:28,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1656702890, now seen corresponding path program 1 times [2018-12-09 10:24:28,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:28,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:28,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:28,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:28,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:28,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:28,726 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 10:24:28,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:28,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:24:28,727 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:28,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:24:28,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:24:28,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:24:28,727 INFO L87 Difference]: Start difference. First operand 24717 states and 75708 transitions. Second operand 4 states. [2018-12-09 10:24:28,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:28,839 INFO L93 Difference]: Finished difference Result 27155 states and 82977 transitions. [2018-12-09 10:24:28,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:24:28,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2018-12-09 10:24:28,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:28,872 INFO L225 Difference]: With dead ends: 27155 [2018-12-09 10:24:28,872 INFO L226 Difference]: Without dead ends: 27155 [2018-12-09 10:24:28,872 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 10:24:28,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27155 states. [2018-12-09 10:24:29,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27155 to 25562. [2018-12-09 10:24:29,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25562 states. [2018-12-09 10:24:29,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25562 states to 25562 states and 78203 transitions. [2018-12-09 10:24:29,161 INFO L78 Accepts]: Start accepts. Automaton has 25562 states and 78203 transitions. Word has length 62 [2018-12-09 10:24:29,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:29,161 INFO L480 AbstractCegarLoop]: Abstraction has 25562 states and 78203 transitions. [2018-12-09 10:24:29,161 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:24:29,161 INFO L276 IsEmpty]: Start isEmpty. Operand 25562 states and 78203 transitions. [2018-12-09 10:24:29,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-09 10:24:29,165 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:29,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] [2018-12-09 10:24:29,165 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:29,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:29,165 INFO L82 PathProgramCache]: Analyzing trace with hash -895454071, now seen corresponding path program 1 times [2018-12-09 10:24:29,165 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:29,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:29,166 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:29,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:29,166 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:29,195 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 10:24:29,195 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:29,195 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:24:29,195 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:29,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:24:29,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:24:29,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:24:29,196 INFO L87 Difference]: Start difference. First operand 25562 states and 78203 transitions. Second operand 6 states. [2018-12-09 10:24:29,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:29,653 INFO L93 Difference]: Finished difference Result 53444 states and 162274 transitions. [2018-12-09 10:24:29,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 10:24:29,654 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 62 [2018-12-09 10:24:29,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:29,721 INFO L225 Difference]: With dead ends: 53444 [2018-12-09 10:24:29,721 INFO L226 Difference]: Without dead ends: 53373 [2018-12-09 10:24:29,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:24:29,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53373 states. [2018-12-09 10:24:30,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53373 to 32726. [2018-12-09 10:24:30,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32726 states. [2018-12-09 10:24:30,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32726 states to 32726 states and 98221 transitions. [2018-12-09 10:24:30,194 INFO L78 Accepts]: Start accepts. Automaton has 32726 states and 98221 transitions. Word has length 62 [2018-12-09 10:24:30,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:30,194 INFO L480 AbstractCegarLoop]: Abstraction has 32726 states and 98221 transitions. [2018-12-09 10:24:30,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:24:30,194 INFO L276 IsEmpty]: Start isEmpty. Operand 32726 states and 98221 transitions. [2018-12-09 10:24:30,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-12-09 10:24:30,200 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:30,200 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:30,201 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:30,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:30,201 INFO L82 PathProgramCache]: Analyzing trace with hash -191697734, now seen corresponding path program 1 times [2018-12-09 10:24:30,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:30,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:30,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:30,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:30,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:30,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:30,220 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 10:24:30,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:30,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:24:30,220 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:30,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:24:30,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:24:30,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:24:30,221 INFO L87 Difference]: Start difference. First operand 32726 states and 98221 transitions. Second operand 3 states. [2018-12-09 10:24:30,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:30,334 INFO L93 Difference]: Finished difference Result 40875 states and 121466 transitions. [2018-12-09 10:24:30,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:24:30,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2018-12-09 10:24:30,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:30,380 INFO L225 Difference]: With dead ends: 40875 [2018-12-09 10:24:30,380 INFO L226 Difference]: Without dead ends: 40875 [2018-12-09 10:24:30,380 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 10:24:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40875 states. [2018-12-09 10:24:31,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40875 to 33483. [2018-12-09 10:24:31,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33483 states. [2018-12-09 10:24:31,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33483 states to 33483 states and 98578 transitions. [2018-12-09 10:24:31,421 INFO L78 Accepts]: Start accepts. Automaton has 33483 states and 98578 transitions. Word has length 68 [2018-12-09 10:24:31,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:31,421 INFO L480 AbstractCegarLoop]: Abstraction has 33483 states and 98578 transitions. [2018-12-09 10:24:31,421 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:24:31,421 INFO L276 IsEmpty]: Start isEmpty. Operand 33483 states and 98578 transitions. [2018-12-09 10:24:31,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 10:24:31,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:31,429 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 10:24:31,430 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:31,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:31,430 INFO L82 PathProgramCache]: Analyzing trace with hash -690040115, now seen corresponding path program 1 times [2018-12-09 10:24:31,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:31,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:31,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:31,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:31,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:31,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:31,471 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 10:24:31,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:31,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:24:31,471 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:31,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:24:31,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:24:31,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:24:31,471 INFO L87 Difference]: Start difference. First operand 33483 states and 98578 transitions. Second operand 5 states. [2018-12-09 10:24:31,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:31,725 INFO L93 Difference]: Finished difference Result 38508 states and 113005 transitions. [2018-12-09 10:24:31,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 10:24:31,725 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2018-12-09 10:24:31,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:31,767 INFO L225 Difference]: With dead ends: 38508 [2018-12-09 10:24:31,767 INFO L226 Difference]: Without dead ends: 38508 [2018-12-09 10:24:31,767 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:24:31,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38508 states. [2018-12-09 10:24:32,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38508 to 36833. [2018-12-09 10:24:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36833 states. [2018-12-09 10:24:32,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36833 states to 36833 states and 108189 transitions. [2018-12-09 10:24:32,159 INFO L78 Accepts]: Start accepts. Automaton has 36833 states and 108189 transitions. Word has length 74 [2018-12-09 10:24:32,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:32,159 INFO L480 AbstractCegarLoop]: Abstraction has 36833 states and 108189 transitions. [2018-12-09 10:24:32,159 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:24:32,159 INFO L276 IsEmpty]: Start isEmpty. Operand 36833 states and 108189 transitions. [2018-12-09 10:24:32,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 10:24:32,168 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:32,168 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 10:24:32,168 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:32,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:32,168 INFO L82 PathProgramCache]: Analyzing trace with hash 1052770220, now seen corresponding path program 1 times [2018-12-09 10:24:32,168 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:32,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:32,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:32,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:32,170 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:32,226 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 10:24:32,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:32,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:24:32,226 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:32,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:24:32,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:24:32,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:24:32,227 INFO L87 Difference]: Start difference. First operand 36833 states and 108189 transitions. Second operand 7 states. [2018-12-09 10:24:32,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:32,744 INFO L93 Difference]: Finished difference Result 44363 states and 130601 transitions. [2018-12-09 10:24:32,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 10:24:32,745 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-09 10:24:32,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:32,793 INFO L225 Difference]: With dead ends: 44363 [2018-12-09 10:24:32,793 INFO L226 Difference]: Without dead ends: 44276 [2018-12-09 10:24:32,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-09 10:24:32,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44276 states. [2018-12-09 10:24:33,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44276 to 33054. [2018-12-09 10:24:33,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33054 states. [2018-12-09 10:24:33,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33054 states to 33054 states and 98260 transitions. [2018-12-09 10:24:33,199 INFO L78 Accepts]: Start accepts. Automaton has 33054 states and 98260 transitions. Word has length 74 [2018-12-09 10:24:33,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:33,199 INFO L480 AbstractCegarLoop]: Abstraction has 33054 states and 98260 transitions. [2018-12-09 10:24:33,199 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:24:33,199 INFO L276 IsEmpty]: Start isEmpty. Operand 33054 states and 98260 transitions. [2018-12-09 10:24:33,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-09 10:24:33,207 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:33,207 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] [2018-12-09 10:24:33,208 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:33,208 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:33,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1736865076, now seen corresponding path program 1 times [2018-12-09 10:24:33,208 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:33,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:33,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:33,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:33,209 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:33,250 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 10:24:33,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:33,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:24:33,250 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:33,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:24:33,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:24:33,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:24:33,251 INFO L87 Difference]: Start difference. First operand 33054 states and 98260 transitions. Second operand 7 states. [2018-12-09 10:24:33,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:33,949 INFO L93 Difference]: Finished difference Result 73264 states and 216100 transitions. [2018-12-09 10:24:33,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-12-09 10:24:33,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2018-12-09 10:24:33,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:34,036 INFO L225 Difference]: With dead ends: 73264 [2018-12-09 10:24:34,037 INFO L226 Difference]: Without dead ends: 73200 [2018-12-09 10:24:34,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2018-12-09 10:24:34,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73200 states. [2018-12-09 10:24:34,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73200 to 42473. [2018-12-09 10:24:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42473 states. [2018-12-09 10:24:34,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42473 states to 42473 states and 124402 transitions. [2018-12-09 10:24:34,649 INFO L78 Accepts]: Start accepts. Automaton has 42473 states and 124402 transitions. Word has length 76 [2018-12-09 10:24:34,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:34,649 INFO L480 AbstractCegarLoop]: Abstraction has 42473 states and 124402 transitions. [2018-12-09 10:24:34,649 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:24:34,650 INFO L276 IsEmpty]: Start isEmpty. Operand 42473 states and 124402 transitions. [2018-12-09 10:24:34,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-12-09 10:24:34,665 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:34,666 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:34,666 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:34,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:34,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1584283171, now seen corresponding path program 1 times [2018-12-09 10:24:34,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:34,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:34,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:34,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:34,668 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:34,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:34,705 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 10:24:34,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:34,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:24:34,705 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:34,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:24:34,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:24:34,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:24:34,706 INFO L87 Difference]: Start difference. First operand 42473 states and 124402 transitions. Second operand 4 states. [2018-12-09 10:24:34,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:34,854 INFO L93 Difference]: Finished difference Result 47450 states and 136404 transitions. [2018-12-09 10:24:34,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:24:34,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2018-12-09 10:24:34,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:34,905 INFO L225 Difference]: With dead ends: 47450 [2018-12-09 10:24:34,905 INFO L226 Difference]: Without dead ends: 47450 [2018-12-09 10:24:34,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:24:34,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47450 states. [2018-12-09 10:24:35,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47450 to 43792. [2018-12-09 10:24:35,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43792 states. [2018-12-09 10:24:35,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43792 states to 43792 states and 125556 transitions. [2018-12-09 10:24:35,370 INFO L78 Accepts]: Start accepts. Automaton has 43792 states and 125556 transitions. Word has length 83 [2018-12-09 10:24:35,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:35,370 INFO L480 AbstractCegarLoop]: Abstraction has 43792 states and 125556 transitions. [2018-12-09 10:24:35,370 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:24:35,370 INFO L276 IsEmpty]: Start isEmpty. Operand 43792 states and 125556 transitions. [2018-12-09 10:24:35,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 10:24:35,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:35,386 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:35,386 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:35,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:35,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1366691952, now seen corresponding path program 1 times [2018-12-09 10:24:35,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:35,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:35,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:35,483 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:35,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:35,515 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 10:24:35,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:35,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:24:35,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:35,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:24:35,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:24:35,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:24:35,516 INFO L87 Difference]: Start difference. First operand 43792 states and 125556 transitions. Second operand 4 states. [2018-12-09 10:24:35,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:35,975 INFO L93 Difference]: Finished difference Result 51886 states and 146275 transitions. [2018-12-09 10:24:35,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 10:24:35,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 84 [2018-12-09 10:24:35,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:36,028 INFO L225 Difference]: With dead ends: 51886 [2018-12-09 10:24:36,028 INFO L226 Difference]: Without dead ends: 51886 [2018-12-09 10:24:36,028 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 10:24:36,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51886 states. [2018-12-09 10:24:36,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51886 to 49652. [2018-12-09 10:24:36,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49652 states. [2018-12-09 10:24:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49652 states to 49652 states and 140792 transitions. [2018-12-09 10:24:36,547 INFO L78 Accepts]: Start accepts. Automaton has 49652 states and 140792 transitions. Word has length 84 [2018-12-09 10:24:36,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:36,547 INFO L480 AbstractCegarLoop]: Abstraction has 49652 states and 140792 transitions. [2018-12-09 10:24:36,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:24:36,547 INFO L276 IsEmpty]: Start isEmpty. Operand 49652 states and 140792 transitions. [2018-12-09 10:24:36,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-12-09 10:24:36,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:36,563 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:36,563 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:36,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:36,563 INFO L82 PathProgramCache]: Analyzing trace with hash 851066001, now seen corresponding path program 1 times [2018-12-09 10:24:36,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:36,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:36,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:36,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:36,589 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 10:24:36,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:36,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:24:36,589 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:36,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:24:36,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:24:36,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:24:36,590 INFO L87 Difference]: Start difference. First operand 49652 states and 140792 transitions. Second operand 5 states. [2018-12-09 10:24:36,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:36,654 INFO L93 Difference]: Finished difference Result 22000 states and 53993 transitions. [2018-12-09 10:24:36,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 10:24:36,654 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2018-12-09 10:24:36,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:36,668 INFO L225 Difference]: With dead ends: 22000 [2018-12-09 10:24:36,668 INFO L226 Difference]: Without dead ends: 20041 [2018-12-09 10:24:36,669 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 10:24:36,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20041 states. [2018-12-09 10:24:36,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20041 to 16787. [2018-12-09 10:24:36,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16787 states. [2018-12-09 10:24:36,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16787 states to 16787 states and 41093 transitions. [2018-12-09 10:24:36,823 INFO L78 Accepts]: Start accepts. Automaton has 16787 states and 41093 transitions. Word has length 84 [2018-12-09 10:24:36,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:36,824 INFO L480 AbstractCegarLoop]: Abstraction has 16787 states and 41093 transitions. [2018-12-09 10:24:36,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:24:36,824 INFO L276 IsEmpty]: Start isEmpty. Operand 16787 states and 41093 transitions. [2018-12-09 10:24:36,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 10:24:36,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:36,835 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] [2018-12-09 10:24:36,835 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:36,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:36,835 INFO L82 PathProgramCache]: Analyzing trace with hash -143937600, now seen corresponding path program 1 times [2018-12-09 10:24:36,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:36,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,836 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:36,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:36,837 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:36,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:36,897 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 10:24:36,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:36,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:24:36,897 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:36,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:24:36,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:24:36,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:24:36,898 INFO L87 Difference]: Start difference. First operand 16787 states and 41093 transitions. Second operand 5 states. [2018-12-09 10:24:36,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:36,977 INFO L93 Difference]: Finished difference Result 19597 states and 47367 transitions. [2018-12-09 10:24:36,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:24:36,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2018-12-09 10:24:36,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:36,992 INFO L225 Difference]: With dead ends: 19597 [2018-12-09 10:24:36,992 INFO L226 Difference]: Without dead ends: 19597 [2018-12-09 10:24:36,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:24:37,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19597 states. [2018-12-09 10:24:37,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19597 to 15476. [2018-12-09 10:24:37,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15476 states. [2018-12-09 10:24:37,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15476 states to 15476 states and 37384 transitions. [2018-12-09 10:24:37,134 INFO L78 Accepts]: Start accepts. Automaton has 15476 states and 37384 transitions. Word has length 113 [2018-12-09 10:24:37,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:37,134 INFO L480 AbstractCegarLoop]: Abstraction has 15476 states and 37384 transitions. [2018-12-09 10:24:37,134 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:24:37,134 INFO L276 IsEmpty]: Start isEmpty. Operand 15476 states and 37384 transitions. [2018-12-09 10:24:37,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 10:24:37,145 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:37,146 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] [2018-12-09 10:24:37,146 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:37,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:37,146 INFO L82 PathProgramCache]: Analyzing trace with hash -123600225, now seen corresponding path program 1 times [2018-12-09 10:24:37,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:37,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:37,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:37,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:37,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:37,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:37,190 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 10:24:37,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:37,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 10:24:37,190 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:37,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 10:24:37,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 10:24:37,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 10:24:37,191 INFO L87 Difference]: Start difference. First operand 15476 states and 37384 transitions. Second operand 5 states. [2018-12-09 10:24:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:37,528 INFO L93 Difference]: Finished difference Result 18394 states and 44376 transitions. [2018-12-09 10:24:37,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:24:37,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2018-12-09 10:24:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:37,542 INFO L225 Difference]: With dead ends: 18394 [2018-12-09 10:24:37,542 INFO L226 Difference]: Without dead ends: 18380 [2018-12-09 10:24:37,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:24:37,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2018-12-09 10:24:37,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 16712. [2018-12-09 10:24:37,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16712 states. [2018-12-09 10:24:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16712 states to 16712 states and 40590 transitions. [2018-12-09 10:24:37,724 INFO L78 Accepts]: Start accepts. Automaton has 16712 states and 40590 transitions. Word has length 113 [2018-12-09 10:24:37,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:37,724 INFO L480 AbstractCegarLoop]: Abstraction has 16712 states and 40590 transitions. [2018-12-09 10:24:37,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 10:24:37,724 INFO L276 IsEmpty]: Start isEmpty. Operand 16712 states and 40590 transitions. [2018-12-09 10:24:37,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 10:24:37,734 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:37,734 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] [2018-12-09 10:24:37,734 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:37,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:37,735 INFO L82 PathProgramCache]: Analyzing trace with hash -172499590, now seen corresponding path program 1 times [2018-12-09 10:24:37,735 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:37,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:37,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:37,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:37,736 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:37,931 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 10:24:37,931 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:37,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 10:24:37,931 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:37,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 10:24:37,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 10:24:37,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2018-12-09 10:24:37,932 INFO L87 Difference]: Start difference. First operand 16712 states and 40590 transitions. Second operand 10 states. [2018-12-09 10:24:38,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:38,560 INFO L93 Difference]: Finished difference Result 25371 states and 59279 transitions. [2018-12-09 10:24:38,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 10:24:38,561 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-12-09 10:24:38,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:38,579 INFO L225 Difference]: With dead ends: 25371 [2018-12-09 10:24:38,579 INFO L226 Difference]: Without dead ends: 25371 [2018-12-09 10:24:38,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2018-12-09 10:24:38,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25371 states. [2018-12-09 10:24:38,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25371 to 21705. [2018-12-09 10:24:38,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21705 states. [2018-12-09 10:24:38,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21705 states to 21705 states and 51438 transitions. [2018-12-09 10:24:38,780 INFO L78 Accepts]: Start accepts. Automaton has 21705 states and 51438 transitions. Word has length 113 [2018-12-09 10:24:38,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:38,780 INFO L480 AbstractCegarLoop]: Abstraction has 21705 states and 51438 transitions. [2018-12-09 10:24:38,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 10:24:38,780 INFO L276 IsEmpty]: Start isEmpty. Operand 21705 states and 51438 transitions. [2018-12-09 10:24:38,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 10:24:38,796 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:38,796 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] [2018-12-09 10:24:38,797 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:38,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:38,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1009590368, now seen corresponding path program 1 times [2018-12-09 10:24:38,797 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:38,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:38,798 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:38,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:38,798 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:38,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:38,835 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 10:24:38,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:38,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 10:24:38,836 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:38,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 10:24:38,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 10:24:38,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 10:24:38,836 INFO L87 Difference]: Start difference. First operand 21705 states and 51438 transitions. Second operand 4 states. [2018-12-09 10:24:38,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:38,978 INFO L93 Difference]: Finished difference Result 23713 states and 55860 transitions. [2018-12-09 10:24:38,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 10:24:38,978 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-12-09 10:24:38,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:38,995 INFO L225 Difference]: With dead ends: 23713 [2018-12-09 10:24:38,995 INFO L226 Difference]: Without dead ends: 23693 [2018-12-09 10:24:38,995 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 10:24:39,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23693 states. [2018-12-09 10:24:39,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23693 to 22563. [2018-12-09 10:24:39,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22563 states. [2018-12-09 10:24:39,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22563 states to 22563 states and 53386 transitions. [2018-12-09 10:24:39,195 INFO L78 Accepts]: Start accepts. Automaton has 22563 states and 53386 transitions. Word has length 113 [2018-12-09 10:24:39,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:39,196 INFO L480 AbstractCegarLoop]: Abstraction has 22563 states and 53386 transitions. [2018-12-09 10:24:39,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 10:24:39,196 INFO L276 IsEmpty]: Start isEmpty. Operand 22563 states and 53386 transitions. [2018-12-09 10:24:39,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 10:24:39,213 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:39,213 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] [2018-12-09 10:24:39,214 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:39,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:39,214 INFO L82 PathProgramCache]: Analyzing trace with hash -2040612447, now seen corresponding path program 1 times [2018-12-09 10:24:39,214 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:39,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:39,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,215 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:39,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:39,296 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 10:24:39,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:39,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:24:39,296 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:39,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:24:39,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:24:39,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:24:39,297 INFO L87 Difference]: Start difference. First operand 22563 states and 53386 transitions. Second operand 7 states. [2018-12-09 10:24:39,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:39,582 INFO L93 Difference]: Finished difference Result 31735 states and 73323 transitions. [2018-12-09 10:24:39,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:24:39,582 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-09 10:24:39,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:39,606 INFO L225 Difference]: With dead ends: 31735 [2018-12-09 10:24:39,606 INFO L226 Difference]: Without dead ends: 31704 [2018-12-09 10:24:39,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 10:24:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31704 states. [2018-12-09 10:24:39,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31704 to 27494. [2018-12-09 10:24:39,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27494 states. [2018-12-09 10:24:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27494 states to 27494 states and 63776 transitions. [2018-12-09 10:24:39,881 INFO L78 Accepts]: Start accepts. Automaton has 27494 states and 63776 transitions. Word has length 113 [2018-12-09 10:24:39,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:39,881 INFO L480 AbstractCegarLoop]: Abstraction has 27494 states and 63776 transitions. [2018-12-09 10:24:39,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:24:39,881 INFO L276 IsEmpty]: Start isEmpty. Operand 27494 states and 63776 transitions. [2018-12-09 10:24:39,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 10:24:39,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:39,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 10:24:39,903 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:39,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:39,903 INFO L82 PathProgramCache]: Analyzing trace with hash 177145506, now seen corresponding path program 1 times [2018-12-09 10:24:39,903 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:39,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,904 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:39,904 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:39,904 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:39,974 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 10:24:39,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:39,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:24:39,974 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:39,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:24:39,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:24:39,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:24:39,975 INFO L87 Difference]: Start difference. First operand 27494 states and 63776 transitions. Second operand 8 states. [2018-12-09 10:24:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:40,836 INFO L93 Difference]: Finished difference Result 34345 states and 79026 transitions. [2018-12-09 10:24:40,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-12-09 10:24:40,836 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-09 10:24:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:40,858 INFO L225 Difference]: With dead ends: 34345 [2018-12-09 10:24:40,858 INFO L226 Difference]: Without dead ends: 34345 [2018-12-09 10:24:40,858 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2018-12-09 10:24:40,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34345 states. [2018-12-09 10:24:41,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34345 to 31008. [2018-12-09 10:24:41,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31008 states. [2018-12-09 10:24:41,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31008 states to 31008 states and 71866 transitions. [2018-12-09 10:24:41,150 INFO L78 Accepts]: Start accepts. Automaton has 31008 states and 71866 transitions. Word has length 113 [2018-12-09 10:24:41,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:41,151 INFO L480 AbstractCegarLoop]: Abstraction has 31008 states and 71866 transitions. [2018-12-09 10:24:41,151 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:24:41,151 INFO L276 IsEmpty]: Start isEmpty. Operand 31008 states and 71866 transitions. [2018-12-09 10:24:41,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 10:24:41,174 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:41,174 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] [2018-12-09 10:24:41,174 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:41,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:41,175 INFO L82 PathProgramCache]: Analyzing trace with hash 388496419, now seen corresponding path program 1 times [2018-12-09 10:24:41,175 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:41,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:41,176 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:41,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:41,176 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:41,205 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 10:24:41,205 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:41,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 10:24:41,205 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:41,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 10:24:41,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 10:24:41,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 10:24:41,206 INFO L87 Difference]: Start difference. First operand 31008 states and 71866 transitions. Second operand 3 states. [2018-12-09 10:24:41,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:41,290 INFO L93 Difference]: Finished difference Result 40201 states and 92482 transitions. [2018-12-09 10:24:41,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 10:24:41,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-12-09 10:24:41,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:41,324 INFO L225 Difference]: With dead ends: 40201 [2018-12-09 10:24:41,324 INFO L226 Difference]: Without dead ends: 40201 [2018-12-09 10:24:41,324 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 10:24:41,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40201 states. [2018-12-09 10:24:41,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40201 to 39802. [2018-12-09 10:24:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39802 states. [2018-12-09 10:24:41,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39802 states to 39802 states and 91600 transitions. [2018-12-09 10:24:41,657 INFO L78 Accepts]: Start accepts. Automaton has 39802 states and 91600 transitions. Word has length 113 [2018-12-09 10:24:41,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:41,657 INFO L480 AbstractCegarLoop]: Abstraction has 39802 states and 91600 transitions. [2018-12-09 10:24:41,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 10:24:41,657 INFO L276 IsEmpty]: Start isEmpty. Operand 39802 states and 91600 transitions. [2018-12-09 10:24:41,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 10:24:41,685 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:41,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:24:41,686 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:41,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:41,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2113977316, now seen corresponding path program 1 times [2018-12-09 10:24:41,686 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:41,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:41,687 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:41,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:41,687 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:41,769 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 10:24:41,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:41,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:24:41,769 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:41,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:24:41,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:24:41,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:24:41,770 INFO L87 Difference]: Start difference. First operand 39802 states and 91600 transitions. Second operand 7 states. [2018-12-09 10:24:41,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:41,936 INFO L93 Difference]: Finished difference Result 44479 states and 101392 transitions. [2018-12-09 10:24:41,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 10:24:41,937 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-09 10:24:41,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:41,971 INFO L225 Difference]: With dead ends: 44479 [2018-12-09 10:24:41,971 INFO L226 Difference]: Without dead ends: 44479 [2018-12-09 10:24:41,971 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 10:24:42,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44479 states. [2018-12-09 10:24:42,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44479 to 39582. [2018-12-09 10:24:42,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39582 states. [2018-12-09 10:24:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39582 states to 39582 states and 90900 transitions. [2018-12-09 10:24:42,330 INFO L78 Accepts]: Start accepts. Automaton has 39582 states and 90900 transitions. Word has length 113 [2018-12-09 10:24:42,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:42,331 INFO L480 AbstractCegarLoop]: Abstraction has 39582 states and 90900 transitions. [2018-12-09 10:24:42,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:24:42,331 INFO L276 IsEmpty]: Start isEmpty. Operand 39582 states and 90900 transitions. [2018-12-09 10:24:42,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 10:24:42,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:42,360 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] [2018-12-09 10:24:42,360 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:42,360 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:42,360 INFO L82 PathProgramCache]: Analyzing trace with hash 1913942530, now seen corresponding path program 1 times [2018-12-09 10:24:42,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:42,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:42,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:42,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:42,361 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:42,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:42,440 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 10:24:42,440 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:42,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:24:42,440 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:42,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:24:42,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:24:42,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:24:42,441 INFO L87 Difference]: Start difference. First operand 39582 states and 90900 transitions. Second operand 7 states. [2018-12-09 10:24:42,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:42,799 INFO L93 Difference]: Finished difference Result 49020 states and 110509 transitions. [2018-12-09 10:24:42,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 10:24:42,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-09 10:24:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:42,837 INFO L225 Difference]: With dead ends: 49020 [2018-12-09 10:24:42,837 INFO L226 Difference]: Without dead ends: 49020 [2018-12-09 10:24:42,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 10:24:42,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49020 states. [2018-12-09 10:24:43,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49020 to 41218. [2018-12-09 10:24:43,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41218 states. [2018-12-09 10:24:43,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41218 states to 41218 states and 93774 transitions. [2018-12-09 10:24:43,250 INFO L78 Accepts]: Start accepts. Automaton has 41218 states and 93774 transitions. Word has length 113 [2018-12-09 10:24:43,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:43,250 INFO L480 AbstractCegarLoop]: Abstraction has 41218 states and 93774 transitions. [2018-12-09 10:24:43,250 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:24:43,251 INFO L276 IsEmpty]: Start isEmpty. Operand 41218 states and 93774 transitions. [2018-12-09 10:24:43,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 10:24:43,280 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:43,280 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] [2018-12-09 10:24:43,280 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:43,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:43,280 INFO L82 PathProgramCache]: Analyzing trace with hash 2125293443, now seen corresponding path program 1 times [2018-12-09 10:24:43,280 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:43,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:43,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:43,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:43,281 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:43,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:43,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 10:24:43,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:43,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 10:24:43,368 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:43,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 10:24:43,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 10:24:43,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 10:24:43,369 INFO L87 Difference]: Start difference. First operand 41218 states and 93774 transitions. Second operand 7 states. [2018-12-09 10:24:43,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:43,578 INFO L93 Difference]: Finished difference Result 42748 states and 97010 transitions. [2018-12-09 10:24:43,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 10:24:43,579 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 113 [2018-12-09 10:24:43,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:43,611 INFO L225 Difference]: With dead ends: 42748 [2018-12-09 10:24:43,611 INFO L226 Difference]: Without dead ends: 42748 [2018-12-09 10:24:43,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-09 10:24:43,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42748 states. [2018-12-09 10:24:43,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42748 to 41656. [2018-12-09 10:24:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41656 states. [2018-12-09 10:24:43,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41656 states to 41656 states and 94781 transitions. [2018-12-09 10:24:43,974 INFO L78 Accepts]: Start accepts. Automaton has 41656 states and 94781 transitions. Word has length 113 [2018-12-09 10:24:43,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:43,974 INFO L480 AbstractCegarLoop]: Abstraction has 41656 states and 94781 transitions. [2018-12-09 10:24:43,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 10:24:43,975 INFO L276 IsEmpty]: Start isEmpty. Operand 41656 states and 94781 transitions. [2018-12-09 10:24:44,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 10:24:44,004 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:44,004 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] [2018-12-09 10:24:44,004 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:44,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:44,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1282170172, now seen corresponding path program 1 times [2018-12-09 10:24:44,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:44,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:44,005 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:44,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:44,006 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:44,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:44,087 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 10:24:44,088 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:44,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:24:44,088 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:44,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:24:44,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:24:44,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:24:44,088 INFO L87 Difference]: Start difference. First operand 41656 states and 94781 transitions. Second operand 8 states. [2018-12-09 10:24:44,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:44,496 INFO L93 Difference]: Finished difference Result 49333 states and 111431 transitions. [2018-12-09 10:24:44,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:24:44,497 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-09 10:24:44,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:44,538 INFO L225 Difference]: With dead ends: 49333 [2018-12-09 10:24:44,538 INFO L226 Difference]: Without dead ends: 49333 [2018-12-09 10:24:44,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2018-12-09 10:24:44,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49333 states. [2018-12-09 10:24:44,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49333 to 42948. [2018-12-09 10:24:44,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42948 states. [2018-12-09 10:24:44,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42948 states to 42948 states and 97552 transitions. [2018-12-09 10:24:44,936 INFO L78 Accepts]: Start accepts. Automaton has 42948 states and 97552 transitions. Word has length 113 [2018-12-09 10:24:44,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:44,936 INFO L480 AbstractCegarLoop]: Abstraction has 42948 states and 97552 transitions. [2018-12-09 10:24:44,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:24:44,936 INFO L276 IsEmpty]: Start isEmpty. Operand 42948 states and 97552 transitions. [2018-12-09 10:24:45,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 10:24:45,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:45,034 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] [2018-12-09 10:24:45,034 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:45,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:45,034 INFO L82 PathProgramCache]: Analyzing trace with hash -517283510, now seen corresponding path program 2 times [2018-12-09 10:24:45,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:45,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:45,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:45,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:45,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:45,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:45,116 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 10:24:45,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:45,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:24:45,116 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:45,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:24:45,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:24:45,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:24:45,117 INFO L87 Difference]: Start difference. First operand 42948 states and 97552 transitions. Second operand 8 states. [2018-12-09 10:24:45,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:45,520 INFO L93 Difference]: Finished difference Result 51746 states and 117038 transitions. [2018-12-09 10:24:45,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 10:24:45,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-09 10:24:45,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:45,563 INFO L225 Difference]: With dead ends: 51746 [2018-12-09 10:24:45,563 INFO L226 Difference]: Without dead ends: 51746 [2018-12-09 10:24:45,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2018-12-09 10:24:45,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51746 states. [2018-12-09 10:24:45,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51746 to 41173. [2018-12-09 10:24:45,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41173 states. [2018-12-09 10:24:45,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41173 states to 41173 states and 93573 transitions. [2018-12-09 10:24:45,963 INFO L78 Accepts]: Start accepts. Automaton has 41173 states and 93573 transitions. Word has length 113 [2018-12-09 10:24:45,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:45,963 INFO L480 AbstractCegarLoop]: Abstraction has 41173 states and 93573 transitions. [2018-12-09 10:24:45,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:24:45,963 INFO L276 IsEmpty]: Start isEmpty. Operand 41173 states and 93573 transitions. [2018-12-09 10:24:45,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 10:24:45,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:45,992 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] [2018-12-09 10:24:45,992 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:45,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:45,993 INFO L82 PathProgramCache]: Analyzing trace with hash -835478879, now seen corresponding path program 1 times [2018-12-09 10:24:45,993 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:45,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:45,994 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:45,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:45,994 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:46,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:46,067 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 10:24:46,067 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:46,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 10:24:46,067 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:46,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 10:24:46,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 10:24:46,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 10:24:46,068 INFO L87 Difference]: Start difference. First operand 41173 states and 93573 transitions. Second operand 8 states. [2018-12-09 10:24:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:46,671 INFO L93 Difference]: Finished difference Result 57102 states and 129961 transitions. [2018-12-09 10:24:46,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 10:24:46,671 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-09 10:24:46,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:46,718 INFO L225 Difference]: With dead ends: 57102 [2018-12-09 10:24:46,718 INFO L226 Difference]: Without dead ends: 57102 [2018-12-09 10:24:46,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=145, Unknown=0, NotChecked=0, Total=210 [2018-12-09 10:24:46,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57102 states. [2018-12-09 10:24:47,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57102 to 40788. [2018-12-09 10:24:47,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40788 states. [2018-12-09 10:24:47,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40788 states to 40788 states and 92755 transitions. [2018-12-09 10:24:47,156 INFO L78 Accepts]: Start accepts. Automaton has 40788 states and 92755 transitions. Word has length 113 [2018-12-09 10:24:47,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:47,156 INFO L480 AbstractCegarLoop]: Abstraction has 40788 states and 92755 transitions. [2018-12-09 10:24:47,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 10:24:47,156 INFO L276 IsEmpty]: Start isEmpty. Operand 40788 states and 92755 transitions. [2018-12-09 10:24:47,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 10:24:47,184 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:47,185 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] [2018-12-09 10:24:47,185 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:47,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:47,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1632202250, now seen corresponding path program 3 times [2018-12-09 10:24:47,185 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:47,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:47,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:47,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:47,186 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:47,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:47,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 10:24:47,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:47,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 10:24:47,228 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:47,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 10:24:47,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 10:24:47,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 10:24:47,228 INFO L87 Difference]: Start difference. First operand 40788 states and 92755 transitions. Second operand 6 states. [2018-12-09 10:24:47,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:47,534 INFO L93 Difference]: Finished difference Result 46201 states and 104047 transitions. [2018-12-09 10:24:47,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 10:24:47,535 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 113 [2018-12-09 10:24:47,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:47,570 INFO L225 Difference]: With dead ends: 46201 [2018-12-09 10:24:47,570 INFO L226 Difference]: Without dead ends: 46181 [2018-12-09 10:24:47,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-09 10:24:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46181 states. [2018-12-09 10:24:47,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46181 to 41301. [2018-12-09 10:24:47,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41301 states. [2018-12-09 10:24:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41301 states to 41301 states and 93806 transitions. [2018-12-09 10:24:47,963 INFO L78 Accepts]: Start accepts. Automaton has 41301 states and 93806 transitions. Word has length 113 [2018-12-09 10:24:47,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:47,963 INFO L480 AbstractCegarLoop]: Abstraction has 41301 states and 93806 transitions. [2018-12-09 10:24:47,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 10:24:47,963 INFO L276 IsEmpty]: Start isEmpty. Operand 41301 states and 93806 transitions. [2018-12-09 10:24:47,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 10:24:47,992 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:47,992 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] [2018-12-09 10:24:47,992 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:47,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:47,992 INFO L82 PathProgramCache]: Analyzing trace with hash 1618364905, now seen corresponding path program 1 times [2018-12-09 10:24:47,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:47,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:47,993 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:47,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:47,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:48,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:48,137 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 10:24:48,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:48,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 10:24:48,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:48,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 10:24:48,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 10:24:48,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-12-09 10:24:48,138 INFO L87 Difference]: Start difference. First operand 41301 states and 93806 transitions. Second operand 14 states. [2018-12-09 10:24:48,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:48,545 INFO L93 Difference]: Finished difference Result 69626 states and 158138 transitions. [2018-12-09 10:24:48,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 10:24:48,545 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 115 [2018-12-09 10:24:48,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:48,590 INFO L225 Difference]: With dead ends: 69626 [2018-12-09 10:24:48,590 INFO L226 Difference]: Without dead ends: 57326 [2018-12-09 10:24:48,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2018-12-09 10:24:48,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57326 states. [2018-12-09 10:24:48,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57326 to 46406. [2018-12-09 10:24:48,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46406 states. [2018-12-09 10:24:49,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46406 states to 46406 states and 104918 transitions. [2018-12-09 10:24:49,035 INFO L78 Accepts]: Start accepts. Automaton has 46406 states and 104918 transitions. Word has length 115 [2018-12-09 10:24:49,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:49,035 INFO L480 AbstractCegarLoop]: Abstraction has 46406 states and 104918 transitions. [2018-12-09 10:24:49,036 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 10:24:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 46406 states and 104918 transitions. [2018-12-09 10:24:49,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 10:24:49,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:49,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:24:49,068 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:49,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:49,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1652705303, now seen corresponding path program 2 times [2018-12-09 10:24:49,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:49,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:49,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:49,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:49,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:49,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:49,178 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 10:24:49,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:49,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-12-09 10:24:49,178 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:49,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-09 10:24:49,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-09 10:24:49,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2018-12-09 10:24:49,179 INFO L87 Difference]: Start difference. First operand 46406 states and 104918 transitions. Second operand 14 states. [2018-12-09 10:24:49,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:49,878 INFO L93 Difference]: Finished difference Result 98560 states and 224299 transitions. [2018-12-09 10:24:49,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-09 10:24:49,879 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 115 [2018-12-09 10:24:49,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:49,944 INFO L225 Difference]: With dead ends: 98560 [2018-12-09 10:24:49,944 INFO L226 Difference]: Without dead ends: 75334 [2018-12-09 10:24:49,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2018-12-09 10:24:50,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75334 states. [2018-12-09 10:24:50,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75334 to 53252. [2018-12-09 10:24:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53252 states. [2018-12-09 10:24:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53252 states to 53252 states and 118965 transitions. [2018-12-09 10:24:50,610 INFO L78 Accepts]: Start accepts. Automaton has 53252 states and 118965 transitions. Word has length 115 [2018-12-09 10:24:50,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:50,610 INFO L480 AbstractCegarLoop]: Abstraction has 53252 states and 118965 transitions. [2018-12-09 10:24:50,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-09 10:24:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 53252 states and 118965 transitions. [2018-12-09 10:24:50,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 10:24:50,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:50,650 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] [2018-12-09 10:24:50,651 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:50,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:50,651 INFO L82 PathProgramCache]: Analyzing trace with hash -670244275, now seen corresponding path program 3 times [2018-12-09 10:24:50,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:50,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:50,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:50,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:50,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:50,777 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 10:24:50,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:50,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-12-09 10:24:50,778 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:50,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-12-09 10:24:50,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-12-09 10:24:50,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-12-09 10:24:50,778 INFO L87 Difference]: Start difference. First operand 53252 states and 118965 transitions. Second operand 16 states. [2018-12-09 10:24:51,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:51,444 INFO L93 Difference]: Finished difference Result 76098 states and 170994 transitions. [2018-12-09 10:24:51,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-12-09 10:24:51,444 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 115 [2018-12-09 10:24:51,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:51,496 INFO L225 Difference]: With dead ends: 76098 [2018-12-09 10:24:51,496 INFO L226 Difference]: Without dead ends: 65763 [2018-12-09 10:24:51,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=267, Invalid=1539, Unknown=0, NotChecked=0, Total=1806 [2018-12-09 10:24:51,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65763 states. [2018-12-09 10:24:51,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65763 to 53977. [2018-12-09 10:24:51,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53977 states. [2018-12-09 10:24:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53977 states to 53977 states and 120641 transitions. [2018-12-09 10:24:52,063 INFO L78 Accepts]: Start accepts. Automaton has 53977 states and 120641 transitions. Word has length 115 [2018-12-09 10:24:52,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:52,063 INFO L480 AbstractCegarLoop]: Abstraction has 53977 states and 120641 transitions. [2018-12-09 10:24:52,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-12-09 10:24:52,064 INFO L276 IsEmpty]: Start isEmpty. Operand 53977 states and 120641 transitions. [2018-12-09 10:24:52,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 10:24:52,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:52,106 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:24:52,106 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:52,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:52,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1418655316, now seen corresponding path program 1 times [2018-12-09 10:24:52,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:52,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:52,107 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 10:24:52,107 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:52,107 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:52,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:52,247 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 10:24:52,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:52,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2018-12-09 10:24:52,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:52,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-12-09 10:24:52,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 10:24:52,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-12-09 10:24:52,248 INFO L87 Difference]: Start difference. First operand 53977 states and 120641 transitions. Second operand 17 states. [2018-12-09 10:24:52,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:52,993 INFO L93 Difference]: Finished difference Result 77212 states and 173975 transitions. [2018-12-09 10:24:52,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-12-09 10:24:52,993 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 115 [2018-12-09 10:24:52,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:53,046 INFO L225 Difference]: With dead ends: 77212 [2018-12-09 10:24:53,046 INFO L226 Difference]: Without dead ends: 65847 [2018-12-09 10:24:53,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=233, Invalid=1489, Unknown=0, NotChecked=0, Total=1722 [2018-12-09 10:24:53,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65847 states. [2018-12-09 10:24:53,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65847 to 51808. [2018-12-09 10:24:53,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51808 states. [2018-12-09 10:24:53,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51808 states to 51808 states and 115966 transitions. [2018-12-09 10:24:53,665 INFO L78 Accepts]: Start accepts. Automaton has 51808 states and 115966 transitions. Word has length 115 [2018-12-09 10:24:53,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:53,666 INFO L480 AbstractCegarLoop]: Abstraction has 51808 states and 115966 transitions. [2018-12-09 10:24:53,666 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-12-09 10:24:53,666 INFO L276 IsEmpty]: Start isEmpty. Operand 51808 states and 115966 transitions. [2018-12-09 10:24:53,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 10:24:53,709 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:53,709 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] [2018-12-09 10:24:53,709 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:53,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:53,710 INFO L82 PathProgramCache]: Analyzing trace with hash 415062155, now seen corresponding path program 4 times [2018-12-09 10:24:53,710 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:53,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:53,711 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:53,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:53,711 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 10:24:53,797 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 10:24:53,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 10:24:53,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 10:24:53,797 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 10:24:53,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 10:24:53,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 10:24:53,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 10:24:53,798 INFO L87 Difference]: Start difference. First operand 51808 states and 115966 transitions. Second operand 10 states. [2018-12-09 10:24:54,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 10:24:54,216 INFO L93 Difference]: Finished difference Result 60244 states and 134882 transitions. [2018-12-09 10:24:54,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 10:24:54,216 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 115 [2018-12-09 10:24:54,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 10:24:54,222 INFO L225 Difference]: With dead ends: 60244 [2018-12-09 10:24:54,222 INFO L226 Difference]: Without dead ends: 7529 [2018-12-09 10:24:54,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-09 10:24:54,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7529 states. [2018-12-09 10:24:54,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7529 to 7529. [2018-12-09 10:24:54,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7529 states. [2018-12-09 10:24:54,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7529 states to 7529 states and 17643 transitions. [2018-12-09 10:24:54,274 INFO L78 Accepts]: Start accepts. Automaton has 7529 states and 17643 transitions. Word has length 115 [2018-12-09 10:24:54,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 10:24:54,274 INFO L480 AbstractCegarLoop]: Abstraction has 7529 states and 17643 transitions. [2018-12-09 10:24:54,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 10:24:54,274 INFO L276 IsEmpty]: Start isEmpty. Operand 7529 states and 17643 transitions. [2018-12-09 10:24:54,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-12-09 10:24:54,279 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 10:24:54,279 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] [2018-12-09 10:24:54,279 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 10:24:54,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 10:24:54,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1850450446, now seen corresponding path program 1 times [2018-12-09 10:24:54,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 10:24:54,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:54,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 10:24:54,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 10:24:54,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 10:24:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:54,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 10:24:54,319 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 10:24:54,391 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 10:24:54,392 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 10:24:54 BasicIcfg [2018-12-09 10:24:54,392 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 10:24:54,392 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 10:24:54,392 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 10:24:54,393 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 10:24:54,393 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 10:23:25" (3/4) ... [2018-12-09 10:24:54,395 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 10:24:54,472 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6525336c-84cf-4fb9-9ca9-342eded348f7/bin-2019/utaipan/witness.graphml [2018-12-09 10:24:54,473 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 10:24:54,473 INFO L168 Benchmark]: Toolchain (without parser) took 89623.22 ms. Allocated memory was 1.0 GB in the beginning and 6.4 GB in the end (delta: 5.3 GB). Free memory was 947.0 MB in the beginning and 5.1 GB in the end (delta: -4.1 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2018-12-09 10:24:54,474 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 10:24:54,474 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -124.6 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. [2018-12-09 10:24:54,474 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.58 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 10:24:54,475 INFO L168 Benchmark]: Boogie Preprocessor took 29.51 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 10:24:54,475 INFO L168 Benchmark]: RCFGBuilder took 424.88 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: 62.3 MB). Peak memory consumption was 62.3 MB. Max. memory is 11.5 GB. [2018-12-09 10:24:54,475 INFO L168 Benchmark]: TraceAbstraction took 88712.19 ms. Allocated memory was 1.1 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 1.0 GB in the beginning and 5.2 GB in the end (delta: -4.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. [2018-12-09 10:24:54,475 INFO L168 Benchmark]: Witness Printer took 80.27 ms. Allocated memory is still 6.4 GB. Free memory was 5.2 GB in the beginning and 5.1 GB in the end (delta: 72.5 MB). Peak memory consumption was 72.5 MB. Max. memory is 11.5 GB. [2018-12-09 10:24:54,476 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 338.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 93.8 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -124.6 MB). Peak memory consumption was 37.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 29.51 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 424.88 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: 62.3 MB). Peak memory consumption was 62.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 88712.19 ms. Allocated memory was 1.1 GB in the beginning and 6.4 GB in the end (delta: 5.2 GB). Free memory was 1.0 GB in the beginning and 5.2 GB in the end (delta: -4.1 GB). Peak memory consumption was 1.1 GB. Max. memory is 11.5 GB. * Witness Printer took 80.27 ms. Allocated memory is still 6.4 GB. Free memory was 5.2 GB in the beginning and 5.1 GB in the end (delta: 72.5 MB). Peak memory consumption was 72.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L686] -1 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L687] -1 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L688] -1 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L689] -1 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L690] -1 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L691] -1 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L692] -1 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L693] -1 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L694] -1 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L695] -1 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L696] -1 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L697] -1 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L698] -1 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L700] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L701] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L702] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L794] -1 pthread_t t1723; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L795] FCALL, FORK -1 pthread_create(&t1723, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L796] -1 pthread_t t1724; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L797] FCALL, FORK -1 pthread_create(&t1724, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L706] 0 x$w_buff1 = x$w_buff0 [L707] 0 x$w_buff0 = 1 [L708] 0 x$w_buff1_used = x$w_buff0_used [L709] 0 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L711] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L712] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L713] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L714] 0 x$r_buff0_thd1 = (_Bool)1 [L717] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L718] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L719] 0 x$flush_delayed = weak$$choice2 [L720] 0 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L721] 0 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L722] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L722] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L723] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L723] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L724] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L725] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L725] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L726] EXPR 0 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L726] 0 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L727] EXPR 0 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L727] 0 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L728] 0 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 0 x = x$flush_delayed ? x$mem_tmp : x [L730] 0 x$flush_delayed = (_Bool)0 [L733] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L750] 1 y = 1 [L753] 1 __unbuffered_p1_EAX = y [L756] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L757] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L758] 1 x$flush_delayed = weak$$choice2 [L759] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L760] 1 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L761] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L761] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L736] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L762] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L763] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L763] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L764] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L764] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L765] EXPR 1 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L765] 1 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L766] EXPR 1 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L766] 1 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] 1 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] 1 x = x$flush_delayed ? x$mem_tmp : x [L769] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L772] EXPR 1 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=1] [L772] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=1] [L772] 1 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L773] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L773] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L774] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L774] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L775] 1 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L776] EXPR 1 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 1 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L779] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L736] 0 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L737] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L737] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L738] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L739] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L739] 0 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L740] EXPR 0 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L740] 0 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L743] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L803] -1 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L804] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L804] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L805] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L805] -1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L806] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L806] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L807] EXPR -1 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L807] -1 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L810] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L5] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 308 locations, 3 error locations. UNSAFE Result, 88.6s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 26.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17101 SDtfs, 21496 SDslu, 65347 SDs, 0 SdLazy, 14671 SolverSat, 878 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 507 GetRequests, 105 SyntacticMatches, 30 SemanticMatches, 372 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1223 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=256642occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 50.7s AutomataMinimizationTime, 36 MinimizatonAttempts, 752563 StatesRemovedByMinimization, 35 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 3336 NumberOfCodeBlocks, 3336 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3185 ConstructedInterpolants, 0 QuantifiedInterpolants, 888899 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...