./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix045_tso.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_a96b9b4c-1b81-4f38-b31d-3f02fc3f1d16/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a96b9b4c-1b81-4f38-b31d-3f02fc3f1d16/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a96b9b4c-1b81-4f38-b31d-3f02fc3f1d16/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a96b9b4c-1b81-4f38-b31d-3f02fc3f1d16/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix045_tso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a96b9b4c-1b81-4f38-b31d-3f02fc3f1d16/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a96b9b4c-1b81-4f38-b31d-3f02fc3f1d16/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 681e0475f78a5efa68ae10892d48464d4d57efbf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 22:08:42,935 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 22:08:42,937 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 22:08:42,945 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 22:08:42,945 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 22:08:42,945 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 22:08:42,946 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 22:08:42,948 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 22:08:42,949 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 22:08:42,949 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 22:08:42,950 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 22:08:42,950 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 22:08:42,951 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 22:08:42,952 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 22:08:42,952 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 22:08:42,953 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 22:08:42,954 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 22:08:42,955 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 22:08:42,956 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 22:08:42,957 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 22:08:42,958 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 22:08:42,959 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 22:08:42,960 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 22:08:42,960 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 22:08:42,961 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 22:08:42,961 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 22:08:42,962 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 22:08:42,962 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 22:08:42,963 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 22:08:42,963 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 22:08:42,963 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 22:08:42,963 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 22:08:42,964 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 22:08:42,964 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 22:08:42,964 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 22:08:42,964 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 22:08:42,965 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a96b9b4c-1b81-4f38-b31d-3f02fc3f1d16/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 22:08:42,972 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 22:08:42,972 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 22:08:42,972 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 22:08:42,972 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 22:08:42,972 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 22:08:42,972 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 22:08:42,973 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 22:08:42,973 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 22:08:42,973 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 22:08:42,973 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 22:08:42,973 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 22:08:42,973 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 22:08:42,973 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 22:08:42,973 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 22:08:42,974 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 22:08:42,974 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 22:08:42,974 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 22:08:42,974 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 22:08:42,974 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 22:08:42,974 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 22:08:42,974 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 22:08:42,974 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 22:08:42,974 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 22:08:42,974 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 22:08:42,974 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 22:08:42,975 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 22:08:42,975 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 22:08:42,975 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 22:08:42,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 22:08:42,975 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 22:08:42,975 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 22:08:42,975 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 22:08:42,975 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 22:08:42,975 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 22:08:42,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 22:08:42,975 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 22:08:42,976 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_a96b9b4c-1b81-4f38-b31d-3f02fc3f1d16/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 -> 681e0475f78a5efa68ae10892d48464d4d57efbf [2018-12-08 22:08:42,992 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 22:08:42,999 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 22:08:43,001 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 22:08:43,002 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 22:08:43,002 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 22:08:43,002 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a96b9b4c-1b81-4f38-b31d-3f02fc3f1d16/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix045_tso.opt_false-unreach-call.i [2018-12-08 22:08:43,038 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a96b9b4c-1b81-4f38-b31d-3f02fc3f1d16/bin-2019/utaipan/data/dd21285d9/2f3b6d5d4e7140b2aba780a5359f2989/FLAG35e3b0566 [2018-12-08 22:08:43,421 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 22:08:43,421 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a96b9b4c-1b81-4f38-b31d-3f02fc3f1d16/sv-benchmarks/c/pthread-wmm/mix045_tso.opt_false-unreach-call.i [2018-12-08 22:08:43,428 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a96b9b4c-1b81-4f38-b31d-3f02fc3f1d16/bin-2019/utaipan/data/dd21285d9/2f3b6d5d4e7140b2aba780a5359f2989/FLAG35e3b0566 [2018-12-08 22:08:43,436 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a96b9b4c-1b81-4f38-b31d-3f02fc3f1d16/bin-2019/utaipan/data/dd21285d9/2f3b6d5d4e7140b2aba780a5359f2989 [2018-12-08 22:08:43,438 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 22:08:43,439 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 22:08:43,439 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 22:08:43,439 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 22:08:43,441 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 22:08:43,442 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:08:43" (1/1) ... [2018-12-08 22:08:43,443 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:43, skipping insertion in model container [2018-12-08 22:08:43,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:08:43" (1/1) ... [2018-12-08 22:08:43,448 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 22:08:43,468 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 22:08:43,643 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:08:43,650 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 22:08:43,719 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:08:43,748 INFO L195 MainTranslator]: Completed translation [2018-12-08 22:08:43,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:43 WrapperNode [2018-12-08 22:08:43,748 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 22:08:43,749 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 22:08:43,749 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 22:08:43,749 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 22:08:43,754 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:43" (1/1) ... [2018-12-08 22:08:43,764 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:43" (1/1) ... [2018-12-08 22:08:43,783 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 22:08:43,783 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 22:08:43,783 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 22:08:43,783 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 22:08:43,789 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:43" (1/1) ... [2018-12-08 22:08:43,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:43" (1/1) ... [2018-12-08 22:08:43,792 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:43" (1/1) ... [2018-12-08 22:08:43,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:43" (1/1) ... [2018-12-08 22:08:43,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:43" (1/1) ... [2018-12-08 22:08:43,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:43" (1/1) ... [2018-12-08 22:08:43,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:43" (1/1) ... [2018-12-08 22:08:43,804 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 22:08:43,804 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 22:08:43,805 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 22:08:43,805 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 22:08:43,805 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a96b9b4c-1b81-4f38-b31d-3f02fc3f1d16/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 22:08:43,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 22:08:43,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 22:08:43,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-08 22:08:43,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 22:08:43,839 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-08 22:08:43,839 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-08 22:08:43,839 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-08 22:08:43,839 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-08 22:08:43,839 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-08 22:08:43,839 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-08 22:08:43,839 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-08 22:08:43,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 22:08:43,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 22:08:43,840 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 22:08:44,154 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 22:08:44,154 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 22:08:44,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:08:44 BoogieIcfgContainer [2018-12-08 22:08:44,154 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 22:08:44,155 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 22:08:44,155 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 22:08:44,157 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 22:08:44,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 10:08:43" (1/3) ... [2018-12-08 22:08:44,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0f3e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:08:44, skipping insertion in model container [2018-12-08 22:08:44,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:08:43" (2/3) ... [2018-12-08 22:08:44,158 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0f3e8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 10:08:44, skipping insertion in model container [2018-12-08 22:08:44,158 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:08:44" (3/3) ... [2018-12-08 22:08:44,159 INFO L112 eAbstractionObserver]: Analyzing ICFG mix045_tso.opt_false-unreach-call.i [2018-12-08 22:08:44,181 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,181 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,181 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,181 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,182 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,182 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,182 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,182 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,182 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,182 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,182 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,182 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,182 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,183 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,183 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,184 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,185 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,186 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,186 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,186 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,186 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,186 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,186 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,187 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,188 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,189 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-08 22:08:44,199 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-08 22:08:44,199 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 22:08:44,205 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-08 22:08:44,215 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-08 22:08:44,232 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 22:08:44,232 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 22:08:44,232 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 22:08:44,232 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 22:08:44,232 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 22:08:44,232 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 22:08:44,233 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 22:08:44,233 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 22:08:44,242 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 157places, 194 transitions [2018-12-08 22:08:58,338 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128914 states. [2018-12-08 22:08:58,340 INFO L276 IsEmpty]: Start isEmpty. Operand 128914 states. [2018-12-08 22:08:58,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 22:08:58,348 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:08:58,348 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:08:58,350 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:08:58,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:08:58,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1531198028, now seen corresponding path program 1 times [2018-12-08 22:08:58,355 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:08:58,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:58,390 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:08:58,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:08:58,390 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:08:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:08:58,497 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 22:08:58,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:08:58,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:08:58,499 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:08:58,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 22:08:58,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 22:08:58,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 22:08:58,511 INFO L87 Difference]: Start difference. First operand 128914 states. Second operand 4 states. [2018-12-08 22:08:59,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:08:59,808 INFO L93 Difference]: Finished difference Result 233474 states and 1098326 transitions. [2018-12-08 22:08:59,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 22:08:59,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-08 22:08:59,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:00,600 INFO L225 Difference]: With dead ends: 233474 [2018-12-08 22:09:00,601 INFO L226 Difference]: Without dead ends: 203724 [2018-12-08 22:09:00,602 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 22:09:03,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203724 states. [2018-12-08 22:09:05,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203724 to 118894. [2018-12-08 22:09:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-12-08 22:09:05,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 559777 transitions. [2018-12-08 22:09:05,759 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 559777 transitions. Word has length 45 [2018-12-08 22:09:05,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:05,760 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 559777 transitions. [2018-12-08 22:09:05,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 22:09:05,760 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 559777 transitions. [2018-12-08 22:09:05,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 22:09:05,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:05,765 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] [2018-12-08 22:09:05,765 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:05,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:05,766 INFO L82 PathProgramCache]: Analyzing trace with hash -834891017, now seen corresponding path program 1 times [2018-12-08 22:09:05,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:05,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:05,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:05,769 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:05,769 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:05,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:05,805 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 22:09:05,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:05,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 22:09:05,805 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:05,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 22:09:05,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 22:09:05,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 22:09:05,807 INFO L87 Difference]: Start difference. First operand 118894 states and 559777 transitions. Second operand 3 states. [2018-12-08 22:09:06,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:06,412 INFO L93 Difference]: Finished difference Result 118894 states and 557817 transitions. [2018-12-08 22:09:06,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 22:09:06,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2018-12-08 22:09:06,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:06,761 INFO L225 Difference]: With dead ends: 118894 [2018-12-08 22:09:06,761 INFO L226 Difference]: Without dead ends: 118894 [2018-12-08 22:09:06,761 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 22:09:07,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118894 states. [2018-12-08 22:09:09,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118894 to 118894. [2018-12-08 22:09:09,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118894 states. [2018-12-08 22:09:11,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118894 states to 118894 states and 557817 transitions. [2018-12-08 22:09:11,658 INFO L78 Accepts]: Start accepts. Automaton has 118894 states and 557817 transitions. Word has length 52 [2018-12-08 22:09:11,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:11,659 INFO L480 AbstractCegarLoop]: Abstraction has 118894 states and 557817 transitions. [2018-12-08 22:09:11,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 22:09:11,659 INFO L276 IsEmpty]: Start isEmpty. Operand 118894 states and 557817 transitions. [2018-12-08 22:09:11,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-08 22:09:11,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:11,662 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] [2018-12-08 22:09:11,662 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:11,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:11,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1663124920, now seen corresponding path program 1 times [2018-12-08 22:09:11,662 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:11,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:11,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:11,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:11,664 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:11,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:11,714 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 22:09:11,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:11,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 22:09:11,714 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:11,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:09:11,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:09:11,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:09:11,715 INFO L87 Difference]: Start difference. First operand 118894 states and 557817 transitions. Second operand 5 states. [2018-12-08 22:09:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:13,380 INFO L93 Difference]: Finished difference Result 325274 states and 1468251 transitions. [2018-12-08 22:09:13,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:09:13,380 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-08 22:09:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:14,275 INFO L225 Difference]: With dead ends: 325274 [2018-12-08 22:09:14,275 INFO L226 Difference]: Without dead ends: 324274 [2018-12-08 22:09:14,276 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 22:09:15,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324274 states. [2018-12-08 22:09:18,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324274 to 186424. [2018-12-08 22:09:18,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186424 states. [2018-12-08 22:09:19,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186424 states to 186424 states and 840916 transitions. [2018-12-08 22:09:19,478 INFO L78 Accepts]: Start accepts. Automaton has 186424 states and 840916 transitions. Word has length 52 [2018-12-08 22:09:19,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:19,479 INFO L480 AbstractCegarLoop]: Abstraction has 186424 states and 840916 transitions. [2018-12-08 22:09:19,479 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:09:19,479 INFO L276 IsEmpty]: Start isEmpty. Operand 186424 states and 840916 transitions. [2018-12-08 22:09:19,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-08 22:09:19,484 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:19,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:09:19,485 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:19,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:19,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1719302045, now seen corresponding path program 1 times [2018-12-08 22:09:19,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:19,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:19,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:19,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:19,488 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:19,527 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 22:09:19,527 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:19,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:09:19,527 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:19,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 22:09:19,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 22:09:19,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 22:09:19,528 INFO L87 Difference]: Start difference. First operand 186424 states and 840916 transitions. Second operand 4 states. [2018-12-08 22:09:20,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:20,240 INFO L93 Difference]: Finished difference Result 163600 states and 725474 transitions. [2018-12-08 22:09:20,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:09:20,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2018-12-08 22:09:20,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:20,626 INFO L225 Difference]: With dead ends: 163600 [2018-12-08 22:09:20,626 INFO L226 Difference]: Without dead ends: 160995 [2018-12-08 22:09:20,626 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 22:09:21,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160995 states. [2018-12-08 22:09:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160995 to 160995. [2018-12-08 22:09:25,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160995 states. [2018-12-08 22:09:25,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160995 states to 160995 states and 716802 transitions. [2018-12-08 22:09:25,787 INFO L78 Accepts]: Start accepts. Automaton has 160995 states and 716802 transitions. Word has length 53 [2018-12-08 22:09:25,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:25,787 INFO L480 AbstractCegarLoop]: Abstraction has 160995 states and 716802 transitions. [2018-12-08 22:09:25,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 22:09:25,788 INFO L276 IsEmpty]: Start isEmpty. Operand 160995 states and 716802 transitions. [2018-12-08 22:09:25,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 22:09:25,792 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:25,793 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 22:09:25,793 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:25,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:25,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1135621285, now seen corresponding path program 1 times [2018-12-08 22:09:25,793 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:25,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:25,795 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:25,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:25,795 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:25,819 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 22:09:25,820 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:25,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 22:09:25,820 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:25,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 22:09:25,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 22:09:25,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 22:09:25,820 INFO L87 Difference]: Start difference. First operand 160995 states and 716802 transitions. Second operand 3 states. [2018-12-08 22:09:26,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:26,910 INFO L93 Difference]: Finished difference Result 160995 states and 716766 transitions. [2018-12-08 22:09:26,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 22:09:26,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2018-12-08 22:09:26,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:27,288 INFO L225 Difference]: With dead ends: 160995 [2018-12-08 22:09:27,288 INFO L226 Difference]: Without dead ends: 160995 [2018-12-08 22:09:27,289 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 22:09:28,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160995 states. [2018-12-08 22:09:30,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160995 to 160995. [2018-12-08 22:09:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160995 states. [2018-12-08 22:09:30,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160995 states to 160995 states and 716766 transitions. [2018-12-08 22:09:30,454 INFO L78 Accepts]: Start accepts. Automaton has 160995 states and 716766 transitions. Word has length 54 [2018-12-08 22:09:30,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:30,454 INFO L480 AbstractCegarLoop]: Abstraction has 160995 states and 716766 transitions. [2018-12-08 22:09:30,454 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 22:09:30,454 INFO L276 IsEmpty]: Start isEmpty. Operand 160995 states and 716766 transitions. [2018-12-08 22:09:30,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-08 22:09:30,458 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:30,458 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 22:09:30,458 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:30,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:30,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1416535676, now seen corresponding path program 1 times [2018-12-08 22:09:30,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:30,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:30,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:30,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:30,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:30,501 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 22:09:30,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:30,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 22:09:30,501 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:30,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:09:30,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:09:30,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:09:30,502 INFO L87 Difference]: Start difference. First operand 160995 states and 716766 transitions. Second operand 5 states. [2018-12-08 22:09:32,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:32,105 INFO L93 Difference]: Finished difference Result 289851 states and 1285659 transitions. [2018-12-08 22:09:32,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:09:32,105 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-08 22:09:32,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:32,845 INFO L225 Difference]: With dead ends: 289851 [2018-12-08 22:09:32,845 INFO L226 Difference]: Without dead ends: 289011 [2018-12-08 22:09:32,845 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 22:09:36,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289011 states. [2018-12-08 22:09:38,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289011 to 169615. [2018-12-08 22:09:38,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169615 states. [2018-12-08 22:09:39,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169615 states to 169615 states and 752619 transitions. [2018-12-08 22:09:39,611 INFO L78 Accepts]: Start accepts. Automaton has 169615 states and 752619 transitions. Word has length 54 [2018-12-08 22:09:39,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:39,611 INFO L480 AbstractCegarLoop]: Abstraction has 169615 states and 752619 transitions. [2018-12-08 22:09:39,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:09:39,612 INFO L276 IsEmpty]: Start isEmpty. Operand 169615 states and 752619 transitions. [2018-12-08 22:09:39,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-08 22:09:39,629 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:39,629 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:09:39,629 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:39,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:39,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1663856536, now seen corresponding path program 1 times [2018-12-08 22:09:39,629 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:39,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:39,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:39,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:39,631 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:39,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:39,659 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 22:09:39,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:39,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 22:09:39,659 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:39,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:09:39,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:09:39,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:09:39,660 INFO L87 Difference]: Start difference. First operand 169615 states and 752619 transitions. Second operand 5 states. [2018-12-08 22:09:39,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:39,886 INFO L93 Difference]: Finished difference Result 59119 states and 239395 transitions. [2018-12-08 22:09:39,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 22:09:39,887 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2018-12-08 22:09:39,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:40,003 INFO L225 Difference]: With dead ends: 59119 [2018-12-08 22:09:40,003 INFO L226 Difference]: Without dead ends: 56807 [2018-12-08 22:09:40,004 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 22:09:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56807 states. [2018-12-08 22:09:40,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56807 to 56807. [2018-12-08 22:09:40,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56807 states. [2018-12-08 22:09:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56807 states to 56807 states and 230741 transitions. [2018-12-08 22:09:40,827 INFO L78 Accepts]: Start accepts. Automaton has 56807 states and 230741 transitions. Word has length 61 [2018-12-08 22:09:40,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:40,828 INFO L480 AbstractCegarLoop]: Abstraction has 56807 states and 230741 transitions. [2018-12-08 22:09:40,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:09:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand 56807 states and 230741 transitions. [2018-12-08 22:09:40,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 22:09:40,836 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:40,836 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:09:40,836 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:40,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:40,836 INFO L82 PathProgramCache]: Analyzing trace with hash -106888934, now seen corresponding path program 1 times [2018-12-08 22:09:40,836 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:40,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:40,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:40,837 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:40,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:40,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:40,891 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 22:09:40,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:40,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:09:40,891 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:40,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 22:09:40,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 22:09:40,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 22:09:40,892 INFO L87 Difference]: Start difference. First operand 56807 states and 230741 transitions. Second operand 4 states. [2018-12-08 22:09:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:41,246 INFO L93 Difference]: Finished difference Result 78971 states and 316066 transitions. [2018-12-08 22:09:41,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:09:41,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-08 22:09:41,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:41,742 INFO L225 Difference]: With dead ends: 78971 [2018-12-08 22:09:41,743 INFO L226 Difference]: Without dead ends: 78971 [2018-12-08 22:09:41,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:09:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78971 states. [2018-12-08 22:09:42,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78971 to 61563. [2018-12-08 22:09:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61563 states. [2018-12-08 22:09:42,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61563 states to 61563 states and 248434 transitions. [2018-12-08 22:09:42,657 INFO L78 Accepts]: Start accepts. Automaton has 61563 states and 248434 transitions. Word has length 67 [2018-12-08 22:09:42,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:42,657 INFO L480 AbstractCegarLoop]: Abstraction has 61563 states and 248434 transitions. [2018-12-08 22:09:42,657 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 22:09:42,657 INFO L276 IsEmpty]: Start isEmpty. Operand 61563 states and 248434 transitions. [2018-12-08 22:09:42,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-08 22:09:42,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:42,668 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:09:42,668 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:42,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:42,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1635921401, now seen corresponding path program 1 times [2018-12-08 22:09:42,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:42,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:42,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:42,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:42,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:42,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:42,722 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 22:09:42,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:42,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 22:09:42,722 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:42,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 22:09:42,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 22:09:42,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:09:42,723 INFO L87 Difference]: Start difference. First operand 61563 states and 248434 transitions. Second operand 6 states. [2018-12-08 22:09:42,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:42,783 INFO L93 Difference]: Finished difference Result 12219 states and 41890 transitions. [2018-12-08 22:09:42,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 22:09:42,784 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2018-12-08 22:09:42,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:42,797 INFO L225 Difference]: With dead ends: 12219 [2018-12-08 22:09:42,797 INFO L226 Difference]: Without dead ends: 10507 [2018-12-08 22:09:42,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-08 22:09:42,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10507 states. [2018-12-08 22:09:42,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10507 to 9992. [2018-12-08 22:09:42,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9992 states. [2018-12-08 22:09:42,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9992 states to 9992 states and 34194 transitions. [2018-12-08 22:09:42,899 INFO L78 Accepts]: Start accepts. Automaton has 9992 states and 34194 transitions. Word has length 67 [2018-12-08 22:09:42,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:42,899 INFO L480 AbstractCegarLoop]: Abstraction has 9992 states and 34194 transitions. [2018-12-08 22:09:42,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 22:09:42,899 INFO L276 IsEmpty]: Start isEmpty. Operand 9992 states and 34194 transitions. [2018-12-08 22:09:42,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 22:09:42,910 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:42,910 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] [2018-12-08 22:09:42,911 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:42,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:42,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2144628424, now seen corresponding path program 1 times [2018-12-08 22:09:42,911 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:42,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:42,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:42,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:42,912 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:42,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:42,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:09:42,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:42,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 22:09:42,962 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:42,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:09:42,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:09:42,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:09:42,962 INFO L87 Difference]: Start difference. First operand 9992 states and 34194 transitions. Second operand 5 states. [2018-12-08 22:09:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:43,108 INFO L93 Difference]: Finished difference Result 11722 states and 39578 transitions. [2018-12-08 22:09:43,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 22:09:43,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-08 22:09:43,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:43,121 INFO L225 Difference]: With dead ends: 11722 [2018-12-08 22:09:43,121 INFO L226 Difference]: Without dead ends: 11722 [2018-12-08 22:09:43,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:09:43,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11722 states. [2018-12-08 22:09:43,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11722 to 10677. [2018-12-08 22:09:43,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10677 states. [2018-12-08 22:09:43,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10677 states to 10677 states and 36362 transitions. [2018-12-08 22:09:43,234 INFO L78 Accepts]: Start accepts. Automaton has 10677 states and 36362 transitions. Word has length 100 [2018-12-08 22:09:43,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:43,234 INFO L480 AbstractCegarLoop]: Abstraction has 10677 states and 36362 transitions. [2018-12-08 22:09:43,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:09:43,234 INFO L276 IsEmpty]: Start isEmpty. Operand 10677 states and 36362 transitions. [2018-12-08 22:09:43,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 22:09:43,246 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:43,246 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] [2018-12-08 22:09:43,246 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:43,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:43,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1838316113, now seen corresponding path program 1 times [2018-12-08 22:09:43,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:43,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:43,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:43,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:43,247 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:43,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:43,297 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 22:09:43,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:43,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:09:43,298 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:43,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 22:09:43,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 22:09:43,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 22:09:43,298 INFO L87 Difference]: Start difference. First operand 10677 states and 36362 transitions. Second operand 4 states. [2018-12-08 22:09:43,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:43,398 INFO L93 Difference]: Finished difference Result 12847 states and 43198 transitions. [2018-12-08 22:09:43,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 22:09:43,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-08 22:09:43,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:43,413 INFO L225 Difference]: With dead ends: 12847 [2018-12-08 22:09:43,413 INFO L226 Difference]: Without dead ends: 12847 [2018-12-08 22:09:43,414 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 22:09:43,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12847 states. [2018-12-08 22:09:43,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12847 to 11177. [2018-12-08 22:09:43,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11177 states. [2018-12-08 22:09:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11177 states to 11177 states and 37897 transitions. [2018-12-08 22:09:43,767 INFO L78 Accepts]: Start accepts. Automaton has 11177 states and 37897 transitions. Word has length 100 [2018-12-08 22:09:43,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:43,768 INFO L480 AbstractCegarLoop]: Abstraction has 11177 states and 37897 transitions. [2018-12-08 22:09:43,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 22:09:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 11177 states and 37897 transitions. [2018-12-08 22:09:43,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 22:09:43,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:43,779 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] [2018-12-08 22:09:43,780 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:43,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:43,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1487070160, now seen corresponding path program 1 times [2018-12-08 22:09:43,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:43,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:43,782 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:43,782 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:43,782 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:43,818 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 22:09:43,818 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:43,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:09:43,818 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:43,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 22:09:43,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 22:09:43,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 22:09:43,819 INFO L87 Difference]: Start difference. First operand 11177 states and 37897 transitions. Second operand 4 states. [2018-12-08 22:09:43,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:43,999 INFO L93 Difference]: Finished difference Result 15057 states and 51129 transitions. [2018-12-08 22:09:44,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 22:09:44,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-08 22:09:44,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:44,017 INFO L225 Difference]: With dead ends: 15057 [2018-12-08 22:09:44,017 INFO L226 Difference]: Without dead ends: 15057 [2018-12-08 22:09:44,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 22:09:44,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15057 states. [2018-12-08 22:09:44,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15057 to 10812. [2018-12-08 22:09:44,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10812 states. [2018-12-08 22:09:44,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10812 states to 10812 states and 36420 transitions. [2018-12-08 22:09:44,138 INFO L78 Accepts]: Start accepts. Automaton has 10812 states and 36420 transitions. Word has length 100 [2018-12-08 22:09:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:44,138 INFO L480 AbstractCegarLoop]: Abstraction has 10812 states and 36420 transitions. [2018-12-08 22:09:44,138 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 22:09:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 10812 states and 36420 transitions. [2018-12-08 22:09:44,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-08 22:09:44,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:44,148 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] [2018-12-08 22:09:44,148 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:44,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:44,148 INFO L82 PathProgramCache]: Analyzing trace with hash 2072054210, now seen corresponding path program 2 times [2018-12-08 22:09:44,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:44,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:44,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:44,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:44,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:44,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:44,200 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 22:09:44,201 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:44,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 22:09:44,201 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:44,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:09:44,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:09:44,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:09:44,201 INFO L87 Difference]: Start difference. First operand 10812 states and 36420 transitions. Second operand 5 states. [2018-12-08 22:09:44,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:44,348 INFO L93 Difference]: Finished difference Result 12267 states and 41039 transitions. [2018-12-08 22:09:44,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:09:44,348 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-08 22:09:44,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:44,363 INFO L225 Difference]: With dead ends: 12267 [2018-12-08 22:09:44,363 INFO L226 Difference]: Without dead ends: 12267 [2018-12-08 22:09:44,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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 22:09:44,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12267 states. [2018-12-08 22:09:44,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12267 to 10302. [2018-12-08 22:09:44,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10302 states. [2018-12-08 22:09:44,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10302 states to 10302 states and 34832 transitions. [2018-12-08 22:09:44,470 INFO L78 Accepts]: Start accepts. Automaton has 10302 states and 34832 transitions. Word has length 100 [2018-12-08 22:09:44,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:44,470 INFO L480 AbstractCegarLoop]: Abstraction has 10302 states and 34832 transitions. [2018-12-08 22:09:44,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:09:44,471 INFO L276 IsEmpty]: Start isEmpty. Operand 10302 states and 34832 transitions. [2018-12-08 22:09:44,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 22:09:44,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:44,480 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] [2018-12-08 22:09:44,480 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:44,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:44,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1807291188, now seen corresponding path program 1 times [2018-12-08 22:09:44,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:44,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:44,481 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 22:09:44,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:44,481 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:44,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:44,537 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 22:09:44,537 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:44,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 22:09:44,537 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:44,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 22:09:44,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 22:09:44,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:09:44,538 INFO L87 Difference]: Start difference. First operand 10302 states and 34832 transitions. Second operand 6 states. [2018-12-08 22:09:44,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:44,737 INFO L93 Difference]: Finished difference Result 11702 states and 38802 transitions. [2018-12-08 22:09:44,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 22:09:44,738 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-08 22:09:44,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:44,750 INFO L225 Difference]: With dead ends: 11702 [2018-12-08 22:09:44,750 INFO L226 Difference]: Without dead ends: 11352 [2018-12-08 22:09:44,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 22:09:44,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11352 states. [2018-12-08 22:09:44,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11352 to 11027. [2018-12-08 22:09:44,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11027 states. [2018-12-08 22:09:44,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11027 states to 11027 states and 36927 transitions. [2018-12-08 22:09:44,861 INFO L78 Accepts]: Start accepts. Automaton has 11027 states and 36927 transitions. Word has length 102 [2018-12-08 22:09:44,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:44,861 INFO L480 AbstractCegarLoop]: Abstraction has 11027 states and 36927 transitions. [2018-12-08 22:09:44,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 22:09:44,861 INFO L276 IsEmpty]: Start isEmpty. Operand 11027 states and 36927 transitions. [2018-12-08 22:09:44,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 22:09:44,871 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:44,871 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] [2018-12-08 22:09:44,872 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:44,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:44,872 INFO L82 PathProgramCache]: Analyzing trace with hash -786935629, now seen corresponding path program 1 times [2018-12-08 22:09:44,872 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:44,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:44,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:44,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:44,873 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:44,937 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 22:09:44,937 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:44,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 22:09:44,937 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:44,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 22:09:44,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 22:09:44,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 22:09:44,938 INFO L87 Difference]: Start difference. First operand 11027 states and 36927 transitions. Second operand 7 states. [2018-12-08 22:09:45,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:45,120 INFO L93 Difference]: Finished difference Result 12230 states and 40760 transitions. [2018-12-08 22:09:45,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 22:09:45,120 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-08 22:09:45,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:45,133 INFO L225 Difference]: With dead ends: 12230 [2018-12-08 22:09:45,133 INFO L226 Difference]: Without dead ends: 12230 [2018-12-08 22:09:45,133 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-08 22:09:45,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12230 states. [2018-12-08 22:09:45,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12230 to 11002. [2018-12-08 22:09:45,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11002 states. [2018-12-08 22:09:45,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11002 states to 11002 states and 36867 transitions. [2018-12-08 22:09:45,247 INFO L78 Accepts]: Start accepts. Automaton has 11002 states and 36867 transitions. Word has length 102 [2018-12-08 22:09:45,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:45,247 INFO L480 AbstractCegarLoop]: Abstraction has 11002 states and 36867 transitions. [2018-12-08 22:09:45,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 22:09:45,247 INFO L276 IsEmpty]: Start isEmpty. Operand 11002 states and 36867 transitions. [2018-12-08 22:09:45,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 22:09:45,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:45,258 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 22:09:45,258 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:45,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:45,259 INFO L82 PathProgramCache]: Analyzing trace with hash 623943891, now seen corresponding path program 1 times [2018-12-08 22:09:45,259 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:45,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:45,260 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:45,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:45,260 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:45,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:45,329 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 22:09:45,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:45,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 22:09:45,329 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:45,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:09:45,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:09:45,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:09:45,330 INFO L87 Difference]: Start difference. First operand 11002 states and 36867 transitions. Second operand 5 states. [2018-12-08 22:09:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:45,414 INFO L93 Difference]: Finished difference Result 9795 states and 32513 transitions. [2018-12-08 22:09:45,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 22:09:45,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-08 22:09:45,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:45,425 INFO L225 Difference]: With dead ends: 9795 [2018-12-08 22:09:45,425 INFO L226 Difference]: Without dead ends: 9795 [2018-12-08 22:09:45,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:09:45,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9795 states. [2018-12-08 22:09:45,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9795 to 9760. [2018-12-08 22:09:45,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9760 states. [2018-12-08 22:09:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9760 states to 9760 states and 32415 transitions. [2018-12-08 22:09:45,517 INFO L78 Accepts]: Start accepts. Automaton has 9760 states and 32415 transitions. Word has length 102 [2018-12-08 22:09:45,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:45,517 INFO L480 AbstractCegarLoop]: Abstraction has 9760 states and 32415 transitions. [2018-12-08 22:09:45,517 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:09:45,517 INFO L276 IsEmpty]: Start isEmpty. Operand 9760 states and 32415 transitions. [2018-12-08 22:09:45,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-08 22:09:45,526 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:45,526 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] [2018-12-08 22:09:45,526 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:45,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:45,526 INFO L82 PathProgramCache]: Analyzing trace with hash 175247252, now seen corresponding path program 1 times [2018-12-08 22:09:45,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:45,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:45,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:45,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:45,527 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:45,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:45,613 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 22:09:45,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:45,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 22:09:45,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:45,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 22:09:45,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 22:09:45,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:09:45,614 INFO L87 Difference]: Start difference. First operand 9760 states and 32415 transitions. Second operand 6 states. [2018-12-08 22:09:45,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:45,698 INFO L93 Difference]: Finished difference Result 8608 states and 27967 transitions. [2018-12-08 22:09:45,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 22:09:45,699 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-08 22:09:45,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:45,708 INFO L225 Difference]: With dead ends: 8608 [2018-12-08 22:09:45,708 INFO L226 Difference]: Without dead ends: 8608 [2018-12-08 22:09:45,708 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-08 22:09:45,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8608 states. [2018-12-08 22:09:45,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8608 to 7183. [2018-12-08 22:09:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7183 states. [2018-12-08 22:09:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7183 states to 7183 states and 23561 transitions. [2018-12-08 22:09:45,784 INFO L78 Accepts]: Start accepts. Automaton has 7183 states and 23561 transitions. Word has length 102 [2018-12-08 22:09:45,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:45,784 INFO L480 AbstractCegarLoop]: Abstraction has 7183 states and 23561 transitions. [2018-12-08 22:09:45,784 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 22:09:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 7183 states and 23561 transitions. [2018-12-08 22:09:45,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 22:09:45,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:45,790 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:09:45,790 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:45,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:45,791 INFO L82 PathProgramCache]: Analyzing trace with hash -427821553, now seen corresponding path program 1 times [2018-12-08 22:09:45,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:45,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:45,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:45,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:45,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:45,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:45,868 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 22:09:45,869 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:45,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 22:09:45,869 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:45,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 22:09:45,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 22:09:45,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 22:09:45,869 INFO L87 Difference]: Start difference. First operand 7183 states and 23561 transitions. Second operand 7 states. [2018-12-08 22:09:46,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:46,189 INFO L93 Difference]: Finished difference Result 13310 states and 43019 transitions. [2018-12-08 22:09:46,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 22:09:46,190 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-12-08 22:09:46,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:46,204 INFO L225 Difference]: With dead ends: 13310 [2018-12-08 22:09:46,204 INFO L226 Difference]: Without dead ends: 13310 [2018-12-08 22:09:46,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-08 22:09:46,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13310 states. [2018-12-08 22:09:46,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13310 to 10245. [2018-12-08 22:09:46,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10245 states. [2018-12-08 22:09:46,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 33633 transitions. [2018-12-08 22:09:46,323 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 33633 transitions. Word has length 104 [2018-12-08 22:09:46,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:46,323 INFO L480 AbstractCegarLoop]: Abstraction has 10245 states and 33633 transitions. [2018-12-08 22:09:46,323 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 22:09:46,323 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 33633 transitions. [2018-12-08 22:09:46,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 22:09:46,332 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:46,332 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:09:46,332 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:46,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:46,333 INFO L82 PathProgramCache]: Analyzing trace with hash 816942928, now seen corresponding path program 1 times [2018-12-08 22:09:46,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:46,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:46,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:46,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:46,334 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:46,396 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 22:09:46,396 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:46,396 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 22:09:46,396 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:46,396 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 22:09:46,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 22:09:46,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:09:46,397 INFO L87 Difference]: Start difference. First operand 10245 states and 33633 transitions. Second operand 6 states. [2018-12-08 22:09:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:46,490 INFO L93 Difference]: Finished difference Result 10435 states and 33930 transitions. [2018-12-08 22:09:46,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 22:09:46,490 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-08 22:09:46,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:46,501 INFO L225 Difference]: With dead ends: 10435 [2018-12-08 22:09:46,501 INFO L226 Difference]: Without dead ends: 10435 [2018-12-08 22:09:46,501 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-08 22:09:46,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10435 states. [2018-12-08 22:09:46,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10435 to 10170. [2018-12-08 22:09:46,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10170 states. [2018-12-08 22:09:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10170 states to 10170 states and 33203 transitions. [2018-12-08 22:09:46,599 INFO L78 Accepts]: Start accepts. Automaton has 10170 states and 33203 transitions. Word has length 104 [2018-12-08 22:09:46,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:46,600 INFO L480 AbstractCegarLoop]: Abstraction has 10170 states and 33203 transitions. [2018-12-08 22:09:46,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 22:09:46,600 INFO L276 IsEmpty]: Start isEmpty. Operand 10170 states and 33203 transitions. [2018-12-08 22:09:46,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 22:09:46,608 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:46,609 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:09:46,609 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:46,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:46,609 INFO L82 PathProgramCache]: Analyzing trace with hash -98055792, now seen corresponding path program 1 times [2018-12-08 22:09:46,609 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:46,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:46,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:46,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:46,610 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:46,651 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 22:09:46,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:46,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 22:09:46,652 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:46,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:09:46,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:09:46,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:09:46,652 INFO L87 Difference]: Start difference. First operand 10170 states and 33203 transitions. Second operand 5 states. [2018-12-08 22:09:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:46,777 INFO L93 Difference]: Finished difference Result 11450 states and 37363 transitions. [2018-12-08 22:09:46,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 22:09:46,777 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-08 22:09:46,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:46,789 INFO L225 Difference]: With dead ends: 11450 [2018-12-08 22:09:46,789 INFO L226 Difference]: Without dead ends: 11450 [2018-12-08 22:09:46,789 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 22:09:46,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11450 states. [2018-12-08 22:09:46,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11450 to 9027. [2018-12-08 22:09:46,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9027 states. [2018-12-08 22:09:46,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9027 states to 9027 states and 29584 transitions. [2018-12-08 22:09:46,885 INFO L78 Accepts]: Start accepts. Automaton has 9027 states and 29584 transitions. Word has length 104 [2018-12-08 22:09:46,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:46,885 INFO L480 AbstractCegarLoop]: Abstraction has 9027 states and 29584 transitions. [2018-12-08 22:09:46,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:09:46,885 INFO L276 IsEmpty]: Start isEmpty. Operand 9027 states and 29584 transitions. [2018-12-08 22:09:46,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 22:09:46,893 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:46,893 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:09:46,893 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:46,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:46,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1146708689, now seen corresponding path program 1 times [2018-12-08 22:09:46,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:46,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:46,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:46,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:46,894 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:46,954 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 22:09:46,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:46,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 22:09:46,954 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:46,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 22:09:46,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 22:09:46,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 22:09:46,955 INFO L87 Difference]: Start difference. First operand 9027 states and 29584 transitions. Second operand 5 states. [2018-12-08 22:09:46,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:46,997 INFO L93 Difference]: Finished difference Result 9027 states and 29549 transitions. [2018-12-08 22:09:46,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 22:09:46,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2018-12-08 22:09:46,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:47,007 INFO L225 Difference]: With dead ends: 9027 [2018-12-08 22:09:47,007 INFO L226 Difference]: Without dead ends: 9027 [2018-12-08 22:09:47,007 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:09:47,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9027 states. [2018-12-08 22:09:47,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9027 to 9027. [2018-12-08 22:09:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9027 states. [2018-12-08 22:09:47,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9027 states to 9027 states and 29549 transitions. [2018-12-08 22:09:47,091 INFO L78 Accepts]: Start accepts. Automaton has 9027 states and 29549 transitions. Word has length 104 [2018-12-08 22:09:47,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:47,091 INFO L480 AbstractCegarLoop]: Abstraction has 9027 states and 29549 transitions. [2018-12-08 22:09:47,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 22:09:47,091 INFO L276 IsEmpty]: Start isEmpty. Operand 9027 states and 29549 transitions. [2018-12-08 22:09:47,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 22:09:47,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:47,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:09:47,099 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:47,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:47,099 INFO L82 PathProgramCache]: Analyzing trace with hash -778824622, now seen corresponding path program 1 times [2018-12-08 22:09:47,099 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:47,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:47,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:47,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:47,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:47,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:47,197 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 22:09:47,197 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:47,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-08 22:09:47,197 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:47,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-08 22:09:47,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 22:09:47,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-08 22:09:47,198 INFO L87 Difference]: Start difference. First operand 9027 states and 29549 transitions. Second operand 10 states. [2018-12-08 22:09:47,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:47,502 INFO L93 Difference]: Finished difference Result 16915 states and 55801 transitions. [2018-12-08 22:09:47,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 22:09:47,502 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 104 [2018-12-08 22:09:47,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:47,511 INFO L225 Difference]: With dead ends: 16915 [2018-12-08 22:09:47,512 INFO L226 Difference]: Without dead ends: 8303 [2018-12-08 22:09:47,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-08 22:09:47,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8303 states. [2018-12-08 22:09:47,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8303 to 8303. [2018-12-08 22:09:47,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8303 states. [2018-12-08 22:09:47,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8303 states to 8303 states and 27421 transitions. [2018-12-08 22:09:47,586 INFO L78 Accepts]: Start accepts. Automaton has 8303 states and 27421 transitions. Word has length 104 [2018-12-08 22:09:47,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:47,586 INFO L480 AbstractCegarLoop]: Abstraction has 8303 states and 27421 transitions. [2018-12-08 22:09:47,586 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-08 22:09:47,586 INFO L276 IsEmpty]: Start isEmpty. Operand 8303 states and 27421 transitions. [2018-12-08 22:09:47,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 22:09:47,592 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:47,592 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:09:47,593 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:47,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:47,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1989616522, now seen corresponding path program 2 times [2018-12-08 22:09:47,593 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:47,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:47,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:47,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:47,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:09:47,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:47,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 22:09:47,651 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:47,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 22:09:47,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 22:09:47,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-08 22:09:47,651 INFO L87 Difference]: Start difference. First operand 8303 states and 27421 transitions. Second operand 7 states. [2018-12-08 22:09:47,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:47,849 INFO L93 Difference]: Finished difference Result 15253 states and 51102 transitions. [2018-12-08 22:09:47,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:09:47,850 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 104 [2018-12-08 22:09:47,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:47,858 INFO L225 Difference]: With dead ends: 15253 [2018-12-08 22:09:47,858 INFO L226 Difference]: Without dead ends: 7183 [2018-12-08 22:09:47,859 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-08 22:09:47,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7183 states. [2018-12-08 22:09:47,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7183 to 7183. [2018-12-08 22:09:47,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7183 states. [2018-12-08 22:09:47,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7183 states to 7183 states and 24291 transitions. [2018-12-08 22:09:47,930 INFO L78 Accepts]: Start accepts. Automaton has 7183 states and 24291 transitions. Word has length 104 [2018-12-08 22:09:47,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:47,930 INFO L480 AbstractCegarLoop]: Abstraction has 7183 states and 24291 transitions. [2018-12-08 22:09:47,930 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 22:09:47,930 INFO L276 IsEmpty]: Start isEmpty. Operand 7183 states and 24291 transitions. [2018-12-08 22:09:47,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 22:09:47,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:47,936 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:09:47,936 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:47,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:47,937 INFO L82 PathProgramCache]: Analyzing trace with hash -2012827780, now seen corresponding path program 1 times [2018-12-08 22:09:47,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:47,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:47,937 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 22:09:47,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:47,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:47,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:47,992 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 22:09:47,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:47,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 22:09:47,992 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:47,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 22:09:47,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 22:09:47,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:09:47,993 INFO L87 Difference]: Start difference. First operand 7183 states and 24291 transitions. Second operand 6 states. [2018-12-08 22:09:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:48,203 INFO L93 Difference]: Finished difference Result 8103 states and 26833 transitions. [2018-12-08 22:09:48,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:09:48,203 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-08 22:09:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:48,212 INFO L225 Difference]: With dead ends: 8103 [2018-12-08 22:09:48,212 INFO L226 Difference]: Without dead ends: 8103 [2018-12-08 22:09:48,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-08 22:09:48,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8103 states. [2018-12-08 22:09:48,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8103 to 7363. [2018-12-08 22:09:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7363 states. [2018-12-08 22:09:48,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7363 states to 7363 states and 24774 transitions. [2018-12-08 22:09:48,302 INFO L78 Accepts]: Start accepts. Automaton has 7363 states and 24774 transitions. Word has length 104 [2018-12-08 22:09:48,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:48,302 INFO L480 AbstractCegarLoop]: Abstraction has 7363 states and 24774 transitions. [2018-12-08 22:09:48,302 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 22:09:48,302 INFO L276 IsEmpty]: Start isEmpty. Operand 7363 states and 24774 transitions. [2018-12-08 22:09:48,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 22:09:48,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:48,308 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:09:48,308 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:48,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:48,308 INFO L82 PathProgramCache]: Analyzing trace with hash -380023781, now seen corresponding path program 1 times [2018-12-08 22:09:48,309 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:48,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:48,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:48,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:48,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:48,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:48,350 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 22:09:48,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:48,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 22:09:48,351 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:48,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 22:09:48,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 22:09:48,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:09:48,351 INFO L87 Difference]: Start difference. First operand 7363 states and 24774 transitions. Second operand 6 states. [2018-12-08 22:09:48,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:48,478 INFO L93 Difference]: Finished difference Result 7423 states and 24911 transitions. [2018-12-08 22:09:48,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 22:09:48,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-08 22:09:48,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:48,487 INFO L225 Difference]: With dead ends: 7423 [2018-12-08 22:09:48,487 INFO L226 Difference]: Without dead ends: 7343 [2018-12-08 22:09:48,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-08 22:09:48,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7343 states. [2018-12-08 22:09:48,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7343 to 7151. [2018-12-08 22:09:48,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7151 states. [2018-12-08 22:09:48,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7151 states to 7151 states and 24187 transitions. [2018-12-08 22:09:48,554 INFO L78 Accepts]: Start accepts. Automaton has 7151 states and 24187 transitions. Word has length 104 [2018-12-08 22:09:48,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:48,554 INFO L480 AbstractCegarLoop]: Abstraction has 7151 states and 24187 transitions. [2018-12-08 22:09:48,554 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 22:09:48,554 INFO L276 IsEmpty]: Start isEmpty. Operand 7151 states and 24187 transitions. [2018-12-08 22:09:48,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 22:09:48,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:48,560 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:09:48,560 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:48,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:48,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1098792219, now seen corresponding path program 2 times [2018-12-08 22:09:48,561 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:48,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:48,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:09:48,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:48,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:48,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:09:48,615 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 22:09:48,615 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:09:48,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 22:09:48,615 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 22:09:48,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 22:09:48,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 22:09:48,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 22:09:48,616 INFO L87 Difference]: Start difference. First operand 7151 states and 24187 transitions. Second operand 6 states. [2018-12-08 22:09:48,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:09:48,740 INFO L93 Difference]: Finished difference Result 7319 states and 24597 transitions. [2018-12-08 22:09:48,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 22:09:48,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2018-12-08 22:09:48,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 22:09:48,748 INFO L225 Difference]: With dead ends: 7319 [2018-12-08 22:09:48,748 INFO L226 Difference]: Without dead ends: 7319 [2018-12-08 22:09:48,748 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2018-12-08 22:09:48,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7319 states. [2018-12-08 22:09:48,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7319 to 7291. [2018-12-08 22:09:48,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7291 states. [2018-12-08 22:09:48,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7291 states to 7291 states and 24524 transitions. [2018-12-08 22:09:48,815 INFO L78 Accepts]: Start accepts. Automaton has 7291 states and 24524 transitions. Word has length 104 [2018-12-08 22:09:48,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 22:09:48,815 INFO L480 AbstractCegarLoop]: Abstraction has 7291 states and 24524 transitions. [2018-12-08 22:09:48,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 22:09:48,816 INFO L276 IsEmpty]: Start isEmpty. Operand 7291 states and 24524 transitions. [2018-12-08 22:09:48,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-08 22:09:48,822 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 22:09:48,822 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:09:48,822 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 22:09:48,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:09:48,822 INFO L82 PathProgramCache]: Analyzing trace with hash -1563371078, now seen corresponding path program 3 times [2018-12-08 22:09:48,822 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 22:09:48,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:48,823 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 22:09:48,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:09:48,823 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 22:09:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:09:48,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:09:48,861 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-08 22:09:48,934 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-08 22:09:48,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 10:09:48 BasicIcfg [2018-12-08 22:09:48,935 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 22:09:48,936 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 22:09:48,936 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 22:09:48,936 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 22:09:48,936 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:08:44" (3/4) ... [2018-12-08 22:09:48,938 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-08 22:09:49,024 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a96b9b4c-1b81-4f38-b31d-3f02fc3f1d16/bin-2019/utaipan/witness.graphml [2018-12-08 22:09:49,024 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 22:09:49,025 INFO L168 Benchmark]: Toolchain (without parser) took 65586.42 ms. Allocated memory was 1.0 GB in the beginning and 7.6 GB in the end (delta: 6.5 GB). Free memory was 949.6 MB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-12-08 22:09:49,026 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 22:09:49,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 309.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -118.0 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. [2018-12-08 22:09:49,026 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 22:09:49,026 INFO L168 Benchmark]: Boogie Preprocessor took 21.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 22:09:49,027 INFO L168 Benchmark]: RCFGBuilder took 349.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2018-12-08 22:09:49,027 INFO L168 Benchmark]: TraceAbstraction took 64780.74 ms. Allocated memory was 1.1 GB in the beginning and 7.6 GB in the end (delta: 6.5 GB). Free memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. [2018-12-08 22:09:49,027 INFO L168 Benchmark]: Witness Printer took 88.15 ms. Allocated memory is still 7.6 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2018-12-08 22:09:49,029 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 309.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -118.0 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 34.10 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 349.90 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 64780.74 ms. Allocated memory was 1.1 GB in the beginning and 7.6 GB in the end (delta: 6.5 GB). Free memory was 1.0 GB in the beginning and 4.4 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.1 GB. Max. memory is 11.5 GB. * Witness Printer took 88.15 ms. Allocated memory is still 7.6 GB. Free memory was 4.4 GB in the beginning and 4.4 GB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L676] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L678] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L679] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L680] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L682] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L684] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L685] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L686] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L687] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L688] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L689] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L690] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L691] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L692] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L693] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L694] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L695] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L696] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L697] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L698] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L699] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L700] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L702] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L703] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L704] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] -1 pthread_t t1216; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L787] FCALL, FORK -1 pthread_create(&t1216, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] -1 pthread_t t1217; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L789] FCALL, FORK -1 pthread_create(&t1217, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L790] -1 pthread_t t1218; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] FCALL, FORK -1 pthread_create(&t1218, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L743] 0 y$w_buff1 = y$w_buff0 [L744] 0 y$w_buff0 = 2 [L745] 0 y$w_buff1_used = y$w_buff0_used [L746] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L748] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L749] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L750] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L751] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L752] 0 y$r_buff0_thd3 = (_Bool)1 [L755] 0 z = 1 [L758] 0 __unbuffered_p2_EAX = z [L761] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L708] 1 a = 1 [L711] 1 x = 1 [L716] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L723] 2 x = 2 [L726] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L729] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L730] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L731] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L764] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L765] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L767] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L768] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L731] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L732] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L733] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L736] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L771] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L793] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L797] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L798] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L800] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L804] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L805] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L806] -1 y$flush_delayed = weak$$choice2 [L807] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L809] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L810] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L811] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L812] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L814] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L815] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L816] -1 y = y$flush_delayed ? y$mem_tmp : y [L817] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 200 locations, 3 error locations. UNSAFE Result, 64.7s OverallTime, 27 OverallIterations, 1 TraceHistogramMax, 14.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5737 SDtfs, 5610 SDslu, 11109 SDs, 0 SdLazy, 3788 SolverSat, 294 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 224 GetRequests, 70 SyntacticMatches, 15 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186424occurred in iteration=3, 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: 34.0s AutomataMinimizationTime, 26 MinimizatonAttempts, 378650 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2353 NumberOfCodeBlocks, 2353 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2223 ConstructedInterpolants, 0 QuantifiedInterpolants, 501126 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...