./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix000_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2a98d8ef-7757-4e71-abac-982ad2d3a2ef/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2a98d8ef-7757-4e71-abac-982ad2d3a2ef/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2a98d8ef-7757-4e71-abac-982ad2d3a2ef/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2a98d8ef-7757-4e71-abac-982ad2d3a2ef/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix000_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_2a98d8ef-7757-4e71-abac-982ad2d3a2ef/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2a98d8ef-7757-4e71-abac-982ad2d3a2ef/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 e7c439df793427977bd458e6ff02653e28ab85ea .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-08 19:28:04,976 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 19:28:04,977 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 19:28:04,983 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 19:28:04,984 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 19:28:04,984 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 19:28:04,985 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 19:28:04,985 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 19:28:04,986 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 19:28:04,987 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 19:28:04,987 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 19:28:04,987 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 19:28:04,988 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 19:28:04,988 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 19:28:04,989 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 19:28:04,989 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 19:28:04,990 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 19:28:04,990 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 19:28:04,991 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 19:28:04,992 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 19:28:04,993 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 19:28:04,993 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 19:28:04,994 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 19:28:04,994 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 19:28:04,995 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 19:28:04,995 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 19:28:04,995 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 19:28:04,996 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 19:28:04,996 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 19:28:04,997 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 19:28:04,997 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 19:28:04,997 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 19:28:04,997 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 19:28:04,997 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 19:28:04,998 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 19:28:04,998 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 19:28:04,998 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2a98d8ef-7757-4e71-abac-982ad2d3a2ef/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 19:28:05,006 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 19:28:05,006 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 19:28:05,006 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 19:28:05,006 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 19:28:05,006 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 19:28:05,007 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 19:28:05,007 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 19:28:05,007 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 19:28:05,007 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 19:28:05,007 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 19:28:05,007 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 19:28:05,007 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 19:28:05,007 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 19:28:05,007 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 19:28:05,008 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 19:28:05,008 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 19:28:05,008 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 19:28:05,008 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 19:28:05,008 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 19:28:05,008 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 19:28:05,008 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 19:28:05,008 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 19:28:05,008 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 19:28:05,008 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 19:28:05,008 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 19:28:05,009 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 19:28:05,009 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 19:28:05,009 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 19:28:05,009 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 19:28:05,009 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 19:28:05,009 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 19:28:05,009 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 19:28:05,009 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 19:28:05,009 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 19:28:05,009 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 19:28:05,009 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 19:28:05,009 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_2a98d8ef-7757-4e71-abac-982ad2d3a2ef/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 -> e7c439df793427977bd458e6ff02653e28ab85ea [2018-12-08 19:28:05,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 19:28:05,033 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 19:28:05,035 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 19:28:05,036 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 19:28:05,036 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 19:28:05,036 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2a98d8ef-7757-4e71-abac-982ad2d3a2ef/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix000_power.opt_false-unreach-call.i [2018-12-08 19:28:05,074 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2a98d8ef-7757-4e71-abac-982ad2d3a2ef/bin-2019/utaipan/data/1fcc8c6c6/f2b4ab1f7d4c4ec3bc8728af14a3a053/FLAG97ea8a085 [2018-12-08 19:28:05,536 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 19:28:05,536 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2a98d8ef-7757-4e71-abac-982ad2d3a2ef/sv-benchmarks/c/pthread-wmm/mix000_power.opt_false-unreach-call.i [2018-12-08 19:28:05,543 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2a98d8ef-7757-4e71-abac-982ad2d3a2ef/bin-2019/utaipan/data/1fcc8c6c6/f2b4ab1f7d4c4ec3bc8728af14a3a053/FLAG97ea8a085 [2018-12-08 19:28:05,552 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2a98d8ef-7757-4e71-abac-982ad2d3a2ef/bin-2019/utaipan/data/1fcc8c6c6/f2b4ab1f7d4c4ec3bc8728af14a3a053 [2018-12-08 19:28:05,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 19:28:05,555 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 19:28:05,555 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 19:28:05,555 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 19:28:05,557 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 19:28:05,558 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:28:05" (1/1) ... [2018-12-08 19:28:05,559 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628262cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:28:05, skipping insertion in model container [2018-12-08 19:28:05,559 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 07:28:05" (1/1) ... [2018-12-08 19:28:05,564 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 19:28:05,584 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 19:28:05,798 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:28:05,808 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 19:28:05,896 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 19:28:05,940 INFO L195 MainTranslator]: Completed translation [2018-12-08 19:28:05,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:28:05 WrapperNode [2018-12-08 19:28:05,941 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 19:28:05,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 19:28:05,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 19:28:05,941 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 19:28:05,947 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:28:05" (1/1) ... [2018-12-08 19:28:05,961 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:28:05" (1/1) ... [2018-12-08 19:28:05,982 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 19:28:05,982 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 19:28:05,982 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 19:28:05,982 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 19:28:05,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:28:05" (1/1) ... [2018-12-08 19:28:05,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:28:05" (1/1) ... [2018-12-08 19:28:05,991 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:28:05" (1/1) ... [2018-12-08 19:28:05,991 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:28:05" (1/1) ... [2018-12-08 19:28:05,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:28:05" (1/1) ... [2018-12-08 19:28:05,999 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:28:05" (1/1) ... [2018-12-08 19:28:06,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:28:05" (1/1) ... [2018-12-08 19:28:06,002 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 19:28:06,003 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 19:28:06,003 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 19:28:06,003 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 19:28:06,003 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:28:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a98d8ef-7757-4e71-abac-982ad2d3a2ef/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-08 19:28:06,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 19:28:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 19:28:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 19:28:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 19:28:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 19:28:06,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 19:28:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 19:28:06,037 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 19:28:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 19:28:06,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 19:28:06,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 19:28:06,038 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-08 19:28:06,385 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 19:28:06,385 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 19:28:06,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:28:06 BoogieIcfgContainer [2018-12-08 19:28:06,385 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 19:28:06,386 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 19:28:06,386 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 19:28:06,388 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 19:28:06,388 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 07:28:05" (1/3) ... [2018-12-08 19:28:06,388 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a3bf72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:28:06, skipping insertion in model container [2018-12-08 19:28:06,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 07:28:05" (2/3) ... [2018-12-08 19:28:06,389 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19a3bf72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 07:28:06, skipping insertion in model container [2018-12-08 19:28:06,389 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:28:06" (3/3) ... [2018-12-08 19:28:06,390 INFO L112 eAbstractionObserver]: Analyzing ICFG mix000_power.opt_false-unreach-call.i [2018-12-08 19:28:06,414 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,415 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,415 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,415 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,416 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,417 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,418 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,419 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,420 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,421 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,422 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,423 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,424 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,424 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,425 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,425 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,425 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,425 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,426 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,426 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,426 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,427 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,428 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,429 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,430 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,431 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,432 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,433 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,434 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,435 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,436 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet56.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 19:28:06,441 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 19:28:06,441 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 19:28:06,448 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 19:28:06,460 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 19:28:06,475 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 19:28:06,476 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 19:28:06,476 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 19:28:06,476 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 19:28:06,476 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 19:28:06,476 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 19:28:06,476 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 19:28:06,476 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 19:28:06,484 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 174places, 227 transitions [2018-12-08 19:28:12,372 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83128 states. [2018-12-08 19:28:12,373 INFO L276 IsEmpty]: Start isEmpty. Operand 83128 states. [2018-12-08 19:28:12,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-08 19:28:12,379 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:12,379 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:28:12,381 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:12,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:12,384 INFO L82 PathProgramCache]: Analyzing trace with hash 164866570, now seen corresponding path program 1 times [2018-12-08 19:28:12,385 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:12,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:12,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:12,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:12,420 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:12,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:28:12,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:12,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:28:12,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:12,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:28:12,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:28:12,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:28:12,544 INFO L87 Difference]: Start difference. First operand 83128 states. Second operand 4 states. [2018-12-08 19:28:13,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:13,310 INFO L93 Difference]: Finished difference Result 150584 states and 603161 transitions. [2018-12-08 19:28:13,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 19:28:13,312 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2018-12-08 19:28:13,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:13,849 INFO L225 Difference]: With dead ends: 150584 [2018-12-08 19:28:13,849 INFO L226 Difference]: Without dead ends: 105840 [2018-12-08 19:28:13,850 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-08 19:28:14,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105840 states. [2018-12-08 19:28:15,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105840 to 61236. [2018-12-08 19:28:15,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61236 states. [2018-12-08 19:28:15,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61236 states to 61236 states and 248291 transitions. [2018-12-08 19:28:15,932 INFO L78 Accepts]: Start accepts. Automaton has 61236 states and 248291 transitions. Word has length 39 [2018-12-08 19:28:15,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:15,933 INFO L480 AbstractCegarLoop]: Abstraction has 61236 states and 248291 transitions. [2018-12-08 19:28:15,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:28:15,933 INFO L276 IsEmpty]: Start isEmpty. Operand 61236 states and 248291 transitions. [2018-12-08 19:28:15,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-12-08 19:28:15,938 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:15,938 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-08 19:28:15,938 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:15,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:15,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1121119524, now seen corresponding path program 1 times [2018-12-08 19:28:15,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:15,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:15,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:15,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:15,942 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:15,983 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-08 19:28:15,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:15,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:28:15,983 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:15,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:28:15,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:28:15,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:28:15,984 INFO L87 Difference]: Start difference. First operand 61236 states and 248291 transitions. Second operand 4 states. [2018-12-08 19:28:16,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:16,075 INFO L93 Difference]: Finished difference Result 14310 states and 48364 transitions. [2018-12-08 19:28:16,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:28:16,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2018-12-08 19:28:16,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:16,098 INFO L225 Difference]: With dead ends: 14310 [2018-12-08 19:28:16,098 INFO L226 Difference]: Without dead ends: 11490 [2018-12-08 19:28:16,098 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-08 19:28:16,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11490 states. [2018-12-08 19:28:16,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11490 to 11490. [2018-12-08 19:28:16,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11490 states. [2018-12-08 19:28:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11490 states to 11490 states and 37855 transitions. [2018-12-08 19:28:16,228 INFO L78 Accepts]: Start accepts. Automaton has 11490 states and 37855 transitions. Word has length 47 [2018-12-08 19:28:16,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:16,228 INFO L480 AbstractCegarLoop]: Abstraction has 11490 states and 37855 transitions. [2018-12-08 19:28:16,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:28:16,229 INFO L276 IsEmpty]: Start isEmpty. Operand 11490 states and 37855 transitions. [2018-12-08 19:28:16,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-08 19:28:16,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:16,230 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-08 19:28:16,230 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:16,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:16,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1818908275, now seen corresponding path program 1 times [2018-12-08 19:28:16,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:16,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:16,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:16,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:16,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:16,277 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-08 19:28:16,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:16,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:28:16,278 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:16,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:28:16,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:28:16,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:28:16,278 INFO L87 Difference]: Start difference. First operand 11490 states and 37855 transitions. Second operand 5 states. [2018-12-08 19:28:16,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:16,583 INFO L93 Difference]: Finished difference Result 23360 states and 75856 transitions. [2018-12-08 19:28:16,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:28:16,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-12-08 19:28:16,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:16,623 INFO L225 Difference]: With dead ends: 23360 [2018-12-08 19:28:16,623 INFO L226 Difference]: Without dead ends: 23285 [2018-12-08 19:28:16,623 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-08 19:28:16,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23285 states. [2018-12-08 19:28:16,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23285 to 15417. [2018-12-08 19:28:16,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15417 states. [2018-12-08 19:28:16,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15417 states to 15417 states and 49310 transitions. [2018-12-08 19:28:16,936 INFO L78 Accepts]: Start accepts. Automaton has 15417 states and 49310 transitions. Word has length 48 [2018-12-08 19:28:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:16,937 INFO L480 AbstractCegarLoop]: Abstraction has 15417 states and 49310 transitions. [2018-12-08 19:28:16,937 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:28:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 15417 states and 49310 transitions. [2018-12-08 19:28:16,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 19:28:16,939 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:16,939 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-08 19:28:16,939 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:16,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:16,939 INFO L82 PathProgramCache]: Analyzing trace with hash 963416755, now seen corresponding path program 1 times [2018-12-08 19:28:16,939 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:16,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:16,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:16,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:16,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:16,964 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-08 19:28:16,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:16,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:28:16,964 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:16,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:28:16,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:28:16,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:28:16,965 INFO L87 Difference]: Start difference. First operand 15417 states and 49310 transitions. Second operand 3 states. [2018-12-08 19:28:17,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:17,084 INFO L93 Difference]: Finished difference Result 28677 states and 90548 transitions. [2018-12-08 19:28:17,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:28:17,084 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-08 19:28:17,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:17,125 INFO L225 Difference]: With dead ends: 28677 [2018-12-08 19:28:17,126 INFO L226 Difference]: Without dead ends: 28673 [2018-12-08 19:28:17,126 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-08 19:28:17,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28673 states. [2018-12-08 19:28:17,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28673 to 24152. [2018-12-08 19:28:17,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24152 states. [2018-12-08 19:28:17,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24152 states to 24152 states and 76316 transitions. [2018-12-08 19:28:17,415 INFO L78 Accepts]: Start accepts. Automaton has 24152 states and 76316 transitions. Word has length 50 [2018-12-08 19:28:17,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:17,415 INFO L480 AbstractCegarLoop]: Abstraction has 24152 states and 76316 transitions. [2018-12-08 19:28:17,415 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:28:17,415 INFO L276 IsEmpty]: Start isEmpty. Operand 24152 states and 76316 transitions. [2018-12-08 19:28:17,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 19:28:17,417 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:17,417 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-08 19:28:17,417 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:17,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:17,418 INFO L82 PathProgramCache]: Analyzing trace with hash 1320542462, now seen corresponding path program 1 times [2018-12-08 19:28:17,418 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:17,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:17,419 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:17,419 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:17,419 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:17,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:17,460 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-08 19:28:17,460 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:17,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:28:17,460 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:17,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:28:17,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:28:17,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:28:17,460 INFO L87 Difference]: Start difference. First operand 24152 states and 76316 transitions. Second operand 6 states. [2018-12-08 19:28:17,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:17,875 INFO L93 Difference]: Finished difference Result 33838 states and 105314 transitions. [2018-12-08 19:28:17,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 19:28:17,875 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2018-12-08 19:28:17,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:17,923 INFO L225 Difference]: With dead ends: 33838 [2018-12-08 19:28:17,923 INFO L226 Difference]: Without dead ends: 33741 [2018-12-08 19:28:17,924 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-08 19:28:17,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33741 states. [2018-12-08 19:28:18,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33741 to 23973. [2018-12-08 19:28:18,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23973 states. [2018-12-08 19:28:18,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23973 states to 23973 states and 75822 transitions. [2018-12-08 19:28:18,224 INFO L78 Accepts]: Start accepts. Automaton has 23973 states and 75822 transitions. Word has length 54 [2018-12-08 19:28:18,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:18,225 INFO L480 AbstractCegarLoop]: Abstraction has 23973 states and 75822 transitions. [2018-12-08 19:28:18,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:28:18,225 INFO L276 IsEmpty]: Start isEmpty. Operand 23973 states and 75822 transitions. [2018-12-08 19:28:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 19:28:18,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:18,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:28:18,230 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:18,230 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:18,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1943714605, now seen corresponding path program 1 times [2018-12-08 19:28:18,230 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:18,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:18,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:18,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:18,231 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:18,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:18,272 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-08 19:28:18,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:18,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:28:18,272 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:18,272 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:28:18,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:28:18,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:28:18,273 INFO L87 Difference]: Start difference. First operand 23973 states and 75822 transitions. Second operand 4 states. [2018-12-08 19:28:18,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:18,477 INFO L93 Difference]: Finished difference Result 30737 states and 97932 transitions. [2018-12-08 19:28:18,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 19:28:18,478 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2018-12-08 19:28:18,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:18,522 INFO L225 Difference]: With dead ends: 30737 [2018-12-08 19:28:18,523 INFO L226 Difference]: Without dead ends: 30737 [2018-12-08 19:28:18,523 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-08 19:28:18,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30737 states. [2018-12-08 19:28:18,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30737 to 27609. [2018-12-08 19:28:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27609 states. [2018-12-08 19:28:18,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27609 states to 27609 states and 87450 transitions. [2018-12-08 19:28:18,922 INFO L78 Accepts]: Start accepts. Automaton has 27609 states and 87450 transitions. Word has length 64 [2018-12-08 19:28:18,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:18,922 INFO L480 AbstractCegarLoop]: Abstraction has 27609 states and 87450 transitions. [2018-12-08 19:28:18,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:28:18,922 INFO L276 IsEmpty]: Start isEmpty. Operand 27609 states and 87450 transitions. [2018-12-08 19:28:18,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-08 19:28:18,927 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:18,928 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:28:18,928 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:18,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:18,928 INFO L82 PathProgramCache]: Analyzing trace with hash -200904270, now seen corresponding path program 1 times [2018-12-08 19:28:18,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:18,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:18,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:18,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:18,929 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:18,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:18,965 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-08 19:28:18,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:18,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:28:18,966 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:18,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:28:18,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:28:18,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:28:18,966 INFO L87 Difference]: Start difference. First operand 27609 states and 87450 transitions. Second operand 6 states. [2018-12-08 19:28:19,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:19,607 INFO L93 Difference]: Finished difference Result 65702 states and 204771 transitions. [2018-12-08 19:28:19,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 19:28:19,608 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-08 19:28:19,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:19,697 INFO L225 Difference]: With dead ends: 65702 [2018-12-08 19:28:19,697 INFO L226 Difference]: Without dead ends: 65638 [2018-12-08 19:28:19,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-08 19:28:19,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65638 states. [2018-12-08 19:28:20,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65638 to 39277. [2018-12-08 19:28:20,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39277 states. [2018-12-08 19:28:20,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39277 states to 39277 states and 121531 transitions. [2018-12-08 19:28:20,274 INFO L78 Accepts]: Start accepts. Automaton has 39277 states and 121531 transitions. Word has length 64 [2018-12-08 19:28:20,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:20,274 INFO L480 AbstractCegarLoop]: Abstraction has 39277 states and 121531 transitions. [2018-12-08 19:28:20,274 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:28:20,274 INFO L276 IsEmpty]: Start isEmpty. Operand 39277 states and 121531 transitions. [2018-12-08 19:28:20,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-12-08 19:28:20,284 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:20,284 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] [2018-12-08 19:28:20,285 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:20,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:20,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1999395037, now seen corresponding path program 1 times [2018-12-08 19:28:20,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:20,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:20,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:20,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:20,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:20,312 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-08 19:28:20,313 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:20,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:28:20,313 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:20,313 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:28:20,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:28:20,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:28:20,313 INFO L87 Difference]: Start difference. First operand 39277 states and 121531 transitions. Second operand 3 states. [2018-12-08 19:28:20,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:20,471 INFO L93 Difference]: Finished difference Result 44930 states and 137016 transitions. [2018-12-08 19:28:20,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:28:20,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2018-12-08 19:28:20,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:20,526 INFO L225 Difference]: With dead ends: 44930 [2018-12-08 19:28:20,526 INFO L226 Difference]: Without dead ends: 44930 [2018-12-08 19:28:20,527 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-08 19:28:20,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44930 states. [2018-12-08 19:28:21,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44930 to 38917. [2018-12-08 19:28:21,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38917 states. [2018-12-08 19:28:21,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38917 states to 38917 states and 117881 transitions. [2018-12-08 19:28:21,085 INFO L78 Accepts]: Start accepts. Automaton has 38917 states and 117881 transitions. Word has length 70 [2018-12-08 19:28:21,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:21,085 INFO L480 AbstractCegarLoop]: Abstraction has 38917 states and 117881 transitions. [2018-12-08 19:28:21,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:28:21,085 INFO L276 IsEmpty]: Start isEmpty. Operand 38917 states and 117881 transitions. [2018-12-08 19:28:21,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 19:28:21,096 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:21,096 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] [2018-12-08 19:28:21,096 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:21,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:21,096 INFO L82 PathProgramCache]: Analyzing trace with hash -627497849, now seen corresponding path program 1 times [2018-12-08 19:28:21,097 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:21,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:21,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:21,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:21,098 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:21,154 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-08 19:28:21,154 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:21,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:28:21,154 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:21,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:28:21,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:28:21,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:28:21,155 INFO L87 Difference]: Start difference. First operand 38917 states and 117881 transitions. Second operand 6 states. [2018-12-08 19:28:21,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:21,775 INFO L93 Difference]: Finished difference Result 49917 states and 151387 transitions. [2018-12-08 19:28:21,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 19:28:21,776 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2018-12-08 19:28:21,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:21,841 INFO L225 Difference]: With dead ends: 49917 [2018-12-08 19:28:21,841 INFO L226 Difference]: Without dead ends: 49613 [2018-12-08 19:28:21,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-12-08 19:28:21,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49613 states. [2018-12-08 19:28:22,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49613 to 45421. [2018-12-08 19:28:22,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45421 states. [2018-12-08 19:28:22,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45421 states to 45421 states and 138099 transitions. [2018-12-08 19:28:22,371 INFO L78 Accepts]: Start accepts. Automaton has 45421 states and 138099 transitions. Word has length 71 [2018-12-08 19:28:22,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:22,372 INFO L480 AbstractCegarLoop]: Abstraction has 45421 states and 138099 transitions. [2018-12-08 19:28:22,372 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:28:22,372 INFO L276 IsEmpty]: Start isEmpty. Operand 45421 states and 138099 transitions. [2018-12-08 19:28:22,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-08 19:28:22,385 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:22,385 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:28:22,386 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:22,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:22,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1870518088, now seen corresponding path program 1 times [2018-12-08 19:28:22,386 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:22,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:22,388 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:22,388 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:22,388 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:22,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:28:22,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:22,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:28:22,422 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:22,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:28:22,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:28:22,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:28:22,423 INFO L87 Difference]: Start difference. First operand 45421 states and 138099 transitions. Second operand 5 states. [2018-12-08 19:28:22,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:22,466 INFO L93 Difference]: Finished difference Result 12413 states and 31271 transitions. [2018-12-08 19:28:22,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 19:28:22,467 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2018-12-08 19:28:22,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:22,479 INFO L225 Difference]: With dead ends: 12413 [2018-12-08 19:28:22,479 INFO L226 Difference]: Without dead ends: 10477 [2018-12-08 19:28:22,479 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-08 19:28:22,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10477 states. [2018-12-08 19:28:22,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10477 to 8356. [2018-12-08 19:28:22,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8356 states. [2018-12-08 19:28:22,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8356 states to 8356 states and 20870 transitions. [2018-12-08 19:28:22,567 INFO L78 Accepts]: Start accepts. Automaton has 8356 states and 20870 transitions. Word has length 71 [2018-12-08 19:28:22,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:22,567 INFO L480 AbstractCegarLoop]: Abstraction has 8356 states and 20870 transitions. [2018-12-08 19:28:22,567 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:28:22,567 INFO L276 IsEmpty]: Start isEmpty. Operand 8356 states and 20870 transitions. [2018-12-08 19:28:22,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 19:28:22,574 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:22,574 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] [2018-12-08 19:28:22,574 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:22,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:22,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1285837177, now seen corresponding path program 1 times [2018-12-08 19:28:22,574 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:22,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:22,575 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:22,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:22,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:22,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:22,634 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-08 19:28:22,635 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:22,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 19:28:22,635 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:22,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 19:28:22,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 19:28:22,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 19:28:22,635 INFO L87 Difference]: Start difference. First operand 8356 states and 20870 transitions. Second operand 4 states. [2018-12-08 19:28:22,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:22,770 INFO L93 Difference]: Finished difference Result 9771 states and 23994 transitions. [2018-12-08 19:28:22,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 19:28:22,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2018-12-08 19:28:22,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:22,776 INFO L225 Difference]: With dead ends: 9771 [2018-12-08 19:28:22,777 INFO L226 Difference]: Without dead ends: 9771 [2018-12-08 19:28:22,777 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-08 19:28:22,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9771 states. [2018-12-08 19:28:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9771 to 9252. [2018-12-08 19:28:22,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9252 states. [2018-12-08 19:28:22,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9252 states to 9252 states and 22837 transitions. [2018-12-08 19:28:22,850 INFO L78 Accepts]: Start accepts. Automaton has 9252 states and 22837 transitions. Word has length 99 [2018-12-08 19:28:22,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:22,850 INFO L480 AbstractCegarLoop]: Abstraction has 9252 states and 22837 transitions. [2018-12-08 19:28:22,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 19:28:22,850 INFO L276 IsEmpty]: Start isEmpty. Operand 9252 states and 22837 transitions. [2018-12-08 19:28:22,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 19:28:22,858 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:22,858 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] [2018-12-08 19:28:22,859 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:22,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:22,859 INFO L82 PathProgramCache]: Analyzing trace with hash -724266664, now seen corresponding path program 1 times [2018-12-08 19:28:22,859 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:22,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:22,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:22,861 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:22,861 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:22,901 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-08 19:28:22,901 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:22,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:28:22,902 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:22,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:28:22,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:28:22,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:28:22,902 INFO L87 Difference]: Start difference. First operand 9252 states and 22837 transitions. Second operand 3 states. [2018-12-08 19:28:23,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:23,055 INFO L93 Difference]: Finished difference Result 12503 states and 30346 transitions. [2018-12-08 19:28:23,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:28:23,055 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2018-12-08 19:28:23,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:23,063 INFO L225 Difference]: With dead ends: 12503 [2018-12-08 19:28:23,063 INFO L226 Difference]: Without dead ends: 12503 [2018-12-08 19:28:23,064 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-08 19:28:23,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12503 states. [2018-12-08 19:28:23,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12503 to 11332. [2018-12-08 19:28:23,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11332 states. [2018-12-08 19:28:23,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11332 states to 11332 states and 27737 transitions. [2018-12-08 19:28:23,158 INFO L78 Accepts]: Start accepts. Automaton has 11332 states and 27737 transitions. Word has length 99 [2018-12-08 19:28:23,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:23,158 INFO L480 AbstractCegarLoop]: Abstraction has 11332 states and 27737 transitions. [2018-12-08 19:28:23,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:28:23,158 INFO L276 IsEmpty]: Start isEmpty. Operand 11332 states and 27737 transitions. [2018-12-08 19:28:23,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 19:28:23,166 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:23,166 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] [2018-12-08 19:28:23,166 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:23,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:23,166 INFO L82 PathProgramCache]: Analyzing trace with hash 288099007, now seen corresponding path program 1 times [2018-12-08 19:28:23,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:23,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:23,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:23,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:23,168 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:23,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:23,227 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-08 19:28:23,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:23,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:28:23,227 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:23,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:28:23,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:28:23,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:28:23,228 INFO L87 Difference]: Start difference. First operand 11332 states and 27737 transitions. Second operand 5 states. [2018-12-08 19:28:23,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:23,520 INFO L93 Difference]: Finished difference Result 13415 states and 32203 transitions. [2018-12-08 19:28:23,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:28:23,520 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2018-12-08 19:28:23,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:23,528 INFO L225 Difference]: With dead ends: 13415 [2018-12-08 19:28:23,528 INFO L226 Difference]: Without dead ends: 13415 [2018-12-08 19:28:23,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 19:28:23,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13415 states. [2018-12-08 19:28:23,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13415 to 11959. [2018-12-08 19:28:23,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11959 states. [2018-12-08 19:28:23,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11959 states to 11959 states and 29037 transitions. [2018-12-08 19:28:23,625 INFO L78 Accepts]: Start accepts. Automaton has 11959 states and 29037 transitions. Word has length 99 [2018-12-08 19:28:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:23,625 INFO L480 AbstractCegarLoop]: Abstraction has 11959 states and 29037 transitions. [2018-12-08 19:28:23,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:28:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand 11959 states and 29037 transitions. [2018-12-08 19:28:23,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-12-08 19:28:23,634 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:23,635 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] [2018-12-08 19:28:23,635 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:23,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:23,635 INFO L82 PathProgramCache]: Analyzing trace with hash -607675101, now seen corresponding path program 2 times [2018-12-08 19:28:23,635 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:23,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:23,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:23,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:23,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:23,691 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-08 19:28:23,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:23,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:28:23,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:23,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:28:23,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:28:23,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:28:23,693 INFO L87 Difference]: Start difference. First operand 11959 states and 29037 transitions. Second operand 6 states. [2018-12-08 19:28:24,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:24,036 INFO L93 Difference]: Finished difference Result 14604 states and 34854 transitions. [2018-12-08 19:28:24,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:28:24,037 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2018-12-08 19:28:24,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:24,046 INFO L225 Difference]: With dead ends: 14604 [2018-12-08 19:28:24,047 INFO L226 Difference]: Without dead ends: 14604 [2018-12-08 19:28:24,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 19:28:24,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14604 states. [2018-12-08 19:28:24,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14604 to 11757. [2018-12-08 19:28:24,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11757 states. [2018-12-08 19:28:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11757 states to 11757 states and 28093 transitions. [2018-12-08 19:28:24,148 INFO L78 Accepts]: Start accepts. Automaton has 11757 states and 28093 transitions. Word has length 99 [2018-12-08 19:28:24,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:24,148 INFO L480 AbstractCegarLoop]: Abstraction has 11757 states and 28093 transitions. [2018-12-08 19:28:24,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:28:24,148 INFO L276 IsEmpty]: Start isEmpty. Operand 11757 states and 28093 transitions. [2018-12-08 19:28:24,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 19:28:24,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:24,156 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] [2018-12-08 19:28:24,156 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:24,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:24,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1051239132, now seen corresponding path program 1 times [2018-12-08 19:28:24,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:24,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:24,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:28:24,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:24,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:24,191 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-08 19:28:24,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:24,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:28:24,192 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:24,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:28:24,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:28:24,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:28:24,192 INFO L87 Difference]: Start difference. First operand 11757 states and 28093 transitions. Second operand 5 states. [2018-12-08 19:28:24,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:24,375 INFO L93 Difference]: Finished difference Result 12580 states and 29794 transitions. [2018-12-08 19:28:24,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 19:28:24,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-08 19:28:24,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:24,384 INFO L225 Difference]: With dead ends: 12580 [2018-12-08 19:28:24,384 INFO L226 Difference]: Without dead ends: 12580 [2018-12-08 19:28:24,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:28:24,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12580 states. [2018-12-08 19:28:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12580 to 11924. [2018-12-08 19:28:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11924 states. [2018-12-08 19:28:24,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11924 states to 11924 states and 28450 transitions. [2018-12-08 19:28:24,484 INFO L78 Accepts]: Start accepts. Automaton has 11924 states and 28450 transitions. Word has length 101 [2018-12-08 19:28:24,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:24,484 INFO L480 AbstractCegarLoop]: Abstraction has 11924 states and 28450 transitions. [2018-12-08 19:28:24,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:28:24,484 INFO L276 IsEmpty]: Start isEmpty. Operand 11924 states and 28450 transitions. [2018-12-08 19:28:24,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 19:28:24,494 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:24,494 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] [2018-12-08 19:28:24,494 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:24,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:24,494 INFO L82 PathProgramCache]: Analyzing trace with hash 23777846, now seen corresponding path program 1 times [2018-12-08 19:28:24,494 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:24,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:24,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:24,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:24,495 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:24,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 19:28:24,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:24,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 19:28:24,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:24,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 19:28:24,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 19:28:24,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 19:28:24,531 INFO L87 Difference]: Start difference. First operand 11924 states and 28450 transitions. Second operand 5 states. [2018-12-08 19:28:24,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:24,711 INFO L93 Difference]: Finished difference Result 14484 states and 34837 transitions. [2018-12-08 19:28:24,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 19:28:24,712 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 101 [2018-12-08 19:28:24,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:24,722 INFO L225 Difference]: With dead ends: 14484 [2018-12-08 19:28:24,722 INFO L226 Difference]: Without dead ends: 14484 [2018-12-08 19:28:24,722 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-08 19:28:24,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14484 states. [2018-12-08 19:28:24,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14484 to 12981. [2018-12-08 19:28:24,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12981 states. [2018-12-08 19:28:24,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12981 states to 12981 states and 31114 transitions. [2018-12-08 19:28:24,830 INFO L78 Accepts]: Start accepts. Automaton has 12981 states and 31114 transitions. Word has length 101 [2018-12-08 19:28:24,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:24,830 INFO L480 AbstractCegarLoop]: Abstraction has 12981 states and 31114 transitions. [2018-12-08 19:28:24,830 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 19:28:24,831 INFO L276 IsEmpty]: Start isEmpty. Operand 12981 states and 31114 transitions. [2018-12-08 19:28:24,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 19:28:24,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:24,840 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] [2018-12-08 19:28:24,840 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:24,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:24,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1749258743, now seen corresponding path program 1 times [2018-12-08 19:28:24,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:24,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:24,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:24,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:24,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:24,907 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-08 19:28:24,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:24,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:28:24,907 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:24,908 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:28:24,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:28:24,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:28:24,908 INFO L87 Difference]: Start difference. First operand 12981 states and 31114 transitions. Second operand 6 states. [2018-12-08 19:28:25,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:25,131 INFO L93 Difference]: Finished difference Result 14407 states and 34218 transitions. [2018-12-08 19:28:25,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 19:28:25,131 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-12-08 19:28:25,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:25,141 INFO L225 Difference]: With dead ends: 14407 [2018-12-08 19:28:25,141 INFO L226 Difference]: Without dead ends: 14407 [2018-12-08 19:28:25,142 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-12-08 19:28:25,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14407 states. [2018-12-08 19:28:25,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14407 to 12981. [2018-12-08 19:28:25,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12981 states. [2018-12-08 19:28:25,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12981 states to 12981 states and 31114 transitions. [2018-12-08 19:28:25,260 INFO L78 Accepts]: Start accepts. Automaton has 12981 states and 31114 transitions. Word has length 101 [2018-12-08 19:28:25,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:25,260 INFO L480 AbstractCegarLoop]: Abstraction has 12981 states and 31114 transitions. [2018-12-08 19:28:25,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:28:25,260 INFO L276 IsEmpty]: Start isEmpty. Operand 12981 states and 31114 transitions. [2018-12-08 19:28:25,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 19:28:25,270 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:25,270 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] [2018-12-08 19:28:25,270 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:25,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:25,270 INFO L82 PathProgramCache]: Analyzing trace with hash 584894463, now seen corresponding path program 1 times [2018-12-08 19:28:25,270 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:25,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:25,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:25,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:25,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:25,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:25,363 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-08 19:28:25,363 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:25,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 19:28:25,363 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:25,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 19:28:25,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 19:28:25,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-08 19:28:25,364 INFO L87 Difference]: Start difference. First operand 12981 states and 31114 transitions. Second operand 8 states. [2018-12-08 19:28:25,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:25,766 INFO L93 Difference]: Finished difference Result 16736 states and 40038 transitions. [2018-12-08 19:28:25,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-08 19:28:25,767 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 101 [2018-12-08 19:28:25,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:25,778 INFO L225 Difference]: With dead ends: 16736 [2018-12-08 19:28:25,778 INFO L226 Difference]: Without dead ends: 16704 [2018-12-08 19:28:25,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-12-08 19:28:25,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16704 states. [2018-12-08 19:28:25,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16704 to 13492. [2018-12-08 19:28:25,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13492 states. [2018-12-08 19:28:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13492 states to 13492 states and 32328 transitions. [2018-12-08 19:28:25,903 INFO L78 Accepts]: Start accepts. Automaton has 13492 states and 32328 transitions. Word has length 101 [2018-12-08 19:28:25,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:25,903 INFO L480 AbstractCegarLoop]: Abstraction has 13492 states and 32328 transitions. [2018-12-08 19:28:25,903 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 19:28:25,903 INFO L276 IsEmpty]: Start isEmpty. Operand 13492 states and 32328 transitions. [2018-12-08 19:28:25,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 19:28:25,913 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:25,913 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] [2018-12-08 19:28:25,914 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:25,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:25,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1212056896, now seen corresponding path program 1 times [2018-12-08 19:28:25,914 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:25,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:25,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:25,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:25,915 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:25,956 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-08 19:28:25,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:25,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 19:28:25,956 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:25,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 19:28:25,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 19:28:25,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:28:25,957 INFO L87 Difference]: Start difference. First operand 13492 states and 32328 transitions. Second operand 6 states. [2018-12-08 19:28:26,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:26,192 INFO L93 Difference]: Finished difference Result 16820 states and 39975 transitions. [2018-12-08 19:28:26,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 19:28:26,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2018-12-08 19:28:26,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:26,205 INFO L225 Difference]: With dead ends: 16820 [2018-12-08 19:28:26,205 INFO L226 Difference]: Without dead ends: 16820 [2018-12-08 19:28:26,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 19:28:26,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16820 states. [2018-12-08 19:28:26,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16820 to 14800. [2018-12-08 19:28:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14800 states. [2018-12-08 19:28:26,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14800 states to 14800 states and 35353 transitions. [2018-12-08 19:28:26,339 INFO L78 Accepts]: Start accepts. Automaton has 14800 states and 35353 transitions. Word has length 101 [2018-12-08 19:28:26,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:26,339 INFO L480 AbstractCegarLoop]: Abstraction has 14800 states and 35353 transitions. [2018-12-08 19:28:26,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 19:28:26,339 INFO L276 IsEmpty]: Start isEmpty. Operand 14800 states and 35353 transitions. [2018-12-08 19:28:26,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-12-08 19:28:26,349 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:26,349 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] [2018-12-08 19:28:26,349 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:26,349 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:26,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1181037089, now seen corresponding path program 1 times [2018-12-08 19:28:26,350 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:26,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:26,350 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:26,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:26,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:26,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:26,377 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-08 19:28:26,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:26,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:28:26,377 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:26,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:28:26,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:28:26,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:28:26,377 INFO L87 Difference]: Start difference. First operand 14800 states and 35353 transitions. Second operand 3 states. [2018-12-08 19:28:26,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:26,409 INFO L93 Difference]: Finished difference Result 14736 states and 35081 transitions. [2018-12-08 19:28:26,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:28:26,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2018-12-08 19:28:26,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:26,423 INFO L225 Difference]: With dead ends: 14736 [2018-12-08 19:28:26,424 INFO L226 Difference]: Without dead ends: 14704 [2018-12-08 19:28:26,424 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-08 19:28:26,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14704 states. [2018-12-08 19:28:26,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14704 to 13192. [2018-12-08 19:28:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13192 states. [2018-12-08 19:28:26,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13192 states to 13192 states and 31514 transitions. [2018-12-08 19:28:26,569 INFO L78 Accepts]: Start accepts. Automaton has 13192 states and 31514 transitions. Word has length 101 [2018-12-08 19:28:26,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:26,569 INFO L480 AbstractCegarLoop]: Abstraction has 13192 states and 31514 transitions. [2018-12-08 19:28:26,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:28:26,569 INFO L276 IsEmpty]: Start isEmpty. Operand 13192 states and 31514 transitions. [2018-12-08 19:28:26,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 19:28:26,578 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:26,578 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] [2018-12-08 19:28:26,578 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:26,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:26,578 INFO L82 PathProgramCache]: Analyzing trace with hash -855852100, now seen corresponding path program 1 times [2018-12-08 19:28:26,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:26,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:26,579 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:26,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:26,579 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:26,646 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-08 19:28:26,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:26,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:28:26,646 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:26,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:28:26,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:28:26,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:28:26,647 INFO L87 Difference]: Start difference. First operand 13192 states and 31514 transitions. Second operand 7 states. [2018-12-08 19:28:26,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:26,953 INFO L93 Difference]: Finished difference Result 18412 states and 42960 transitions. [2018-12-08 19:28:26,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:28:26,954 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-08 19:28:26,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:26,967 INFO L225 Difference]: With dead ends: 18412 [2018-12-08 19:28:26,967 INFO L226 Difference]: Without dead ends: 18308 [2018-12-08 19:28:26,967 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-08 19:28:26,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18308 states. [2018-12-08 19:28:27,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18308 to 13636. [2018-12-08 19:28:27,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13636 states. [2018-12-08 19:28:27,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13636 states to 13636 states and 32317 transitions. [2018-12-08 19:28:27,101 INFO L78 Accepts]: Start accepts. Automaton has 13636 states and 32317 transitions. Word has length 103 [2018-12-08 19:28:27,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:27,101 INFO L480 AbstractCegarLoop]: Abstraction has 13636 states and 32317 transitions. [2018-12-08 19:28:27,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:28:27,101 INFO L276 IsEmpty]: Start isEmpty. Operand 13636 states and 32317 transitions. [2018-12-08 19:28:27,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 19:28:27,112 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:27,112 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] [2018-12-08 19:28:27,112 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:27,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:27,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1429011355, now seen corresponding path program 1 times [2018-12-08 19:28:27,113 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:27,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:27,114 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:27,114 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:27,114 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:27,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:27,174 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-08 19:28:27,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:27,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:28:27,174 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:27,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:28:27,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:28:27,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:28:27,175 INFO L87 Difference]: Start difference. First operand 13636 states and 32317 transitions. Second operand 7 states. [2018-12-08 19:28:27,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:27,476 INFO L93 Difference]: Finished difference Result 17742 states and 40788 transitions. [2018-12-08 19:28:27,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 19:28:27,477 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-08 19:28:27,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:27,489 INFO L225 Difference]: With dead ends: 17742 [2018-12-08 19:28:27,489 INFO L226 Difference]: Without dead ends: 17742 [2018-12-08 19:28:27,489 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-08 19:28:27,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17742 states. [2018-12-08 19:28:27,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17742 to 14943. [2018-12-08 19:28:27,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14943 states. [2018-12-08 19:28:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14943 states to 14943 states and 34814 transitions. [2018-12-08 19:28:27,625 INFO L78 Accepts]: Start accepts. Automaton has 14943 states and 34814 transitions. Word has length 103 [2018-12-08 19:28:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:27,625 INFO L480 AbstractCegarLoop]: Abstraction has 14943 states and 34814 transitions. [2018-12-08 19:28:27,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:28:27,625 INFO L276 IsEmpty]: Start isEmpty. Operand 14943 states and 34814 transitions. [2018-12-08 19:28:27,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 19:28:27,636 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:27,636 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 19:28:27,636 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:27,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:27,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1174274810, now seen corresponding path program 1 times [2018-12-08 19:28:27,636 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:27,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:27,637 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:27,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:27,637 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:27,657 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-08 19:28:27,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:27,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 19:28:27,658 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:27,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 19:28:27,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 19:28:27,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 19:28:27,658 INFO L87 Difference]: Start difference. First operand 14943 states and 34814 transitions. Second operand 3 states. [2018-12-08 19:28:27,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:27,697 INFO L93 Difference]: Finished difference Result 18562 states and 43166 transitions. [2018-12-08 19:28:27,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 19:28:27,697 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2018-12-08 19:28:27,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:27,711 INFO L225 Difference]: With dead ends: 18562 [2018-12-08 19:28:27,711 INFO L226 Difference]: Without dead ends: 18562 [2018-12-08 19:28:27,711 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-08 19:28:27,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18562 states. [2018-12-08 19:28:27,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18562 to 18468. [2018-12-08 19:28:27,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18468 states. [2018-12-08 19:28:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18468 states to 18468 states and 42966 transitions. [2018-12-08 19:28:27,865 INFO L78 Accepts]: Start accepts. Automaton has 18468 states and 42966 transitions. Word has length 103 [2018-12-08 19:28:27,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:27,865 INFO L480 AbstractCegarLoop]: Abstraction has 18468 states and 42966 transitions. [2018-12-08 19:28:27,865 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 19:28:27,865 INFO L276 IsEmpty]: Start isEmpty. Operand 18468 states and 42966 transitions. [2018-12-08 19:28:27,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 19:28:27,878 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:27,878 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] [2018-12-08 19:28:27,878 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:27,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:27,878 INFO L82 PathProgramCache]: Analyzing trace with hash 1385625723, now seen corresponding path program 1 times [2018-12-08 19:28:27,878 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:27,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:27,879 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:27,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:27,879 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:27,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:27,964 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-08 19:28:27,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:27,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 19:28:27,964 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:27,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 19:28:27,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 19:28:27,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-08 19:28:27,965 INFO L87 Difference]: Start difference. First operand 18468 states and 42966 transitions. Second operand 10 states. [2018-12-08 19:28:28,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:28,336 INFO L93 Difference]: Finished difference Result 21062 states and 48972 transitions. [2018-12-08 19:28:28,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 19:28:28,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 103 [2018-12-08 19:28:28,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:28,339 INFO L225 Difference]: With dead ends: 21062 [2018-12-08 19:28:28,340 INFO L226 Difference]: Without dead ends: 4191 [2018-12-08 19:28:28,340 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-08 19:28:28,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4191 states. [2018-12-08 19:28:28,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4191 to 4189. [2018-12-08 19:28:28,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4189 states. [2018-12-08 19:28:28,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4189 states to 4189 states and 9904 transitions. [2018-12-08 19:28:28,369 INFO L78 Accepts]: Start accepts. Automaton has 4189 states and 9904 transitions. Word has length 103 [2018-12-08 19:28:28,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:28,369 INFO L480 AbstractCegarLoop]: Abstraction has 4189 states and 9904 transitions. [2018-12-08 19:28:28,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 19:28:28,369 INFO L276 IsEmpty]: Start isEmpty. Operand 4189 states and 9904 transitions. [2018-12-08 19:28:28,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 19:28:28,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:28,372 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] [2018-12-08 19:28:28,372 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:28,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:28,372 INFO L82 PathProgramCache]: Analyzing trace with hash 613678253, now seen corresponding path program 1 times [2018-12-08 19:28:28,372 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:28,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:28,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:28,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:28,373 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:28,437 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-08 19:28:28,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:28,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 19:28:28,437 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:28,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 19:28:28,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 19:28:28,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 19:28:28,438 INFO L87 Difference]: Start difference. First operand 4189 states and 9904 transitions. Second operand 7 states. [2018-12-08 19:28:28,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:28,578 INFO L93 Difference]: Finished difference Result 4681 states and 11107 transitions. [2018-12-08 19:28:28,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 19:28:28,578 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 103 [2018-12-08 19:28:28,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:28,581 INFO L225 Difference]: With dead ends: 4681 [2018-12-08 19:28:28,581 INFO L226 Difference]: Without dead ends: 4681 [2018-12-08 19:28:28,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2018-12-08 19:28:28,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4681 states. [2018-12-08 19:28:28,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4681 to 4109. [2018-12-08 19:28:28,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4109 states. [2018-12-08 19:28:28,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 9742 transitions. [2018-12-08 19:28:28,609 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 9742 transitions. Word has length 103 [2018-12-08 19:28:28,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:28,609 INFO L480 AbstractCegarLoop]: Abstraction has 4109 states and 9742 transitions. [2018-12-08 19:28:28,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 19:28:28,609 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 9742 transitions. [2018-12-08 19:28:28,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 19:28:28,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:28,612 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] [2018-12-08 19:28:28,612 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:28,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:28,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2075258252, now seen corresponding path program 2 times [2018-12-08 19:28:28,612 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:28,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:28,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 19:28:28,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:28,613 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:28,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 19:28:28,711 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-08 19:28:28,711 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 19:28:28,711 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-08 19:28:28,711 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 19:28:28,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-08 19:28:28,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 19:28:28,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-08 19:28:28,712 INFO L87 Difference]: Start difference. First operand 4109 states and 9742 transitions. Second operand 13 states. [2018-12-08 19:28:29,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 19:28:29,125 INFO L93 Difference]: Finished difference Result 6479 states and 15133 transitions. [2018-12-08 19:28:29,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 19:28:29,125 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 103 [2018-12-08 19:28:29,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 19:28:29,128 INFO L225 Difference]: With dead ends: 6479 [2018-12-08 19:28:29,128 INFO L226 Difference]: Without dead ends: 4657 [2018-12-08 19:28:29,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-08 19:28:29,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4657 states. [2018-12-08 19:28:29,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4657 to 4160. [2018-12-08 19:28:29,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4160 states. [2018-12-08 19:28:29,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4160 states to 4160 states and 9797 transitions. [2018-12-08 19:28:29,156 INFO L78 Accepts]: Start accepts. Automaton has 4160 states and 9797 transitions. Word has length 103 [2018-12-08 19:28:29,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 19:28:29,156 INFO L480 AbstractCegarLoop]: Abstraction has 4160 states and 9797 transitions. [2018-12-08 19:28:29,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-08 19:28:29,156 INFO L276 IsEmpty]: Start isEmpty. Operand 4160 states and 9797 transitions. [2018-12-08 19:28:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-12-08 19:28:29,159 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 19:28:29,159 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] [2018-12-08 19:28:29,159 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 19:28:29,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 19:28:29,159 INFO L82 PathProgramCache]: Analyzing trace with hash -932371670, now seen corresponding path program 3 times [2018-12-08 19:28:29,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 19:28:29,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:29,160 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 19:28:29,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 19:28:29,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 19:28:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:28:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 19:28:29,209 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 19:28:29,275 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 19:28:29,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 07:28:29 BasicIcfg [2018-12-08 19:28:29,276 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 19:28:29,277 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 19:28:29,277 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 19:28:29,277 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 19:28:29,277 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 07:28:06" (3/4) ... [2018-12-08 19:28:29,279 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 19:28:29,350 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2a98d8ef-7757-4e71-abac-982ad2d3a2ef/bin-2019/utaipan/witness.graphml [2018-12-08 19:28:29,351 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 19:28:29,351 INFO L168 Benchmark]: Toolchain (without parser) took 23796.93 ms. Allocated memory was 1.0 GB in the beginning and 3.4 GB in the end (delta: 2.4 GB). Free memory was 953.5 MB in the beginning and 1.3 GB in the end (delta: -390.3 MB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2018-12-08 19:28:29,352 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 19:28:29,352 INFO L168 Benchmark]: CACSL2BoogieTranslator took 385.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-12-08 19:28:29,352 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-08 19:28:29,352 INFO L168 Benchmark]: Boogie Preprocessor took 20.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-08 19:28:29,353 INFO L168 Benchmark]: RCFGBuilder took 382.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. [2018-12-08 19:28:29,353 INFO L168 Benchmark]: TraceAbstraction took 22890.77 ms. Allocated memory was 1.2 GB in the beginning and 3.4 GB in the end (delta: 2.2 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -337.0 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2018-12-08 19:28:29,353 INFO L168 Benchmark]: Witness Printer took 73.97 ms. Allocated memory is still 3.4 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 MB. Max. memory is 11.5 GB. [2018-12-08 19:28:29,354 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 981.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 385.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -165.5 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 382.77 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.8 MB). Peak memory consumption was 58.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22890.77 ms. Allocated memory was 1.2 GB in the beginning and 3.4 GB in the end (delta: 2.2 GB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -337.0 MB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 73.97 ms. Allocated memory is still 3.4 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 46.4 MB). Peak memory consumption was 46.4 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] [L789] -1 pthread_t t2; 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] [L790] FCALL, FORK -1 pthread_create(&t2, ((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, 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] [L791] -1 pthread_t t3; 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] [L792] FCALL, FORK -1 pthread_create(&t3, ((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] [L737] 0 x$w_buff1 = x$w_buff0 [L738] 0 x$w_buff0 = 1 [L739] 0 x$w_buff1_used = x$w_buff0_used [L740] 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] [L742] 0 x$r_buff1_thd0 = x$r_buff0_thd0 [L743] 0 x$r_buff1_thd1 = x$r_buff0_thd1 [L744] 0 x$r_buff1_thd2 = x$r_buff0_thd2 [L745] 0 x$r_buff0_thd2 = (_Bool)1 [L748] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L749] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L750] 0 x$flush_delayed = weak$$choice2 [L751] 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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] EXPR 0 !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 [__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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? 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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] EXPR 0 !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 [__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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 0 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) [L753] EXPR 0 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=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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 0 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)) [L754] EXPR 0 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=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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L754] 0 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)) [L755] EXPR 0 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=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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L755] 0 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)) [L756] EXPR 0 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=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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L756] 0 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)) [L757] EXPR 0 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=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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L757] 0 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)) [L758] EXPR 0 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=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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L758] 0 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)) [L759] 0 __unbuffered_p1_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L760] 0 x = x$flush_delayed ? x$mem_tmp : x [L761] 0 x$flush_delayed = (_Bool)0 [L764] 0 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L767] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L706] 1 y = 1 [L709] 1 __unbuffered_p0_EAX = y [L712] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L713] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L714] 1 x$flush_delayed = weak$$choice2 [L715] 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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L716] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L767] 0 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L768] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L716] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L717] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L717] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L718] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L718] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L719] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L719] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L720] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L769] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L770] EXPR 0 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$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L770] 0 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L771] EXPR 0 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L771] 0 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L774] 0 __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, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L721] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L721] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L722] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L722] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L723] 1 __unbuffered_p0_EBX = x 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=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L724] EXPR 1 x$flush_delayed ? x$mem_tmp : x 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=1, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L724] 1 x = x$flush_delayed ? x$mem_tmp : x [L725] 1 x$flush_delayed = (_Bool)0 [L730] 1 __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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L794] -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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L798] -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) [L799] 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L799] -1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L800] -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 [L801] 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L801] -1 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L802] 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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L802] -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 [L805] -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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 284 locations, 3 error locations. UNSAFE Result, 22.8s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 8.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9462 SDtfs, 9133 SDslu, 22358 SDs, 0 SdLazy, 7559 SolverSat, 424 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 63 SyntacticMatches, 23 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83128occurred in iteration=0, 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: 6.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 133534 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 2301 NumberOfCodeBlocks, 2301 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2172 ConstructedInterpolants, 0 QuantifiedInterpolants, 431200 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...