./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix038_rmo.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_584107c6-2617-43c6-bcc8-c0d0197c4178/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_584107c6-2617-43c6-bcc8-c0d0197c4178/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_584107c6-2617-43c6-bcc8-c0d0197c4178/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_584107c6-2617-43c6-bcc8-c0d0197c4178/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix038_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_584107c6-2617-43c6-bcc8-c0d0197c4178/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_584107c6-2617-43c6-bcc8-c0d0197c4178/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 1f852d15d7d2ea9e29c85a3a318a3b9cf4a94835 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-02 14:35:09,039 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:35:09,040 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:35:09,048 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:35:09,048 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:35:09,049 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:35:09,050 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:35:09,051 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:35:09,052 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:35:09,053 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:35:09,053 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:35:09,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:35:09,054 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:35:09,055 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:35:09,056 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:35:09,056 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:35:09,057 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:35:09,058 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:35:09,059 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:35:09,060 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:35:09,061 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:35:09,062 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:35:09,063 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:35:09,064 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:35:09,064 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:35:09,065 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:35:09,065 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:35:09,066 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:35:09,066 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:35:09,067 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:35:09,067 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:35:09,068 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:35:09,068 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:35:09,068 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:35:09,069 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:35:09,069 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:35:09,069 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_584107c6-2617-43c6-bcc8-c0d0197c4178/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 14:35:09,079 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:35:09,080 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:35:09,080 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:35:09,080 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 14:35:09,081 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 14:35:09,081 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 14:35:09,081 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 14:35:09,081 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 14:35:09,081 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 14:35:09,081 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 14:35:09,081 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 14:35:09,082 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 14:35:09,082 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 14:35:09,082 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:35:09,082 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 14:35:09,082 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:35:09,083 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 14:35:09,083 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:35:09,083 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 14:35:09,083 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:35:09,083 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 14:35:09,083 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 14:35:09,083 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:35:09,084 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 14:35:09,084 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:35:09,084 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:35:09,084 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:35:09,084 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 14:35:09,084 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:35:09,084 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:35:09,084 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:35:09,084 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 14:35:09,084 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 14:35:09,084 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:35:09,085 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 14:35:09,085 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 14:35:09,085 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_584107c6-2617-43c6-bcc8-c0d0197c4178/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 -> 1f852d15d7d2ea9e29c85a3a318a3b9cf4a94835 [2018-12-02 14:35:09,108 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:35:09,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:35:09,120 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:35:09,121 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:35:09,121 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:35:09,121 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_584107c6-2617-43c6-bcc8-c0d0197c4178/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix038_rmo.opt_false-unreach-call.i [2018-12-02 14:35:09,160 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_584107c6-2617-43c6-bcc8-c0d0197c4178/bin-2019/utaipan/data/2c460ae48/7bb15326f7b84dc6aae5c2f1b6bde241/FLAG6b1d150c1 [2018-12-02 14:35:09,613 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:35:09,614 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_584107c6-2617-43c6-bcc8-c0d0197c4178/sv-benchmarks/c/pthread-wmm/mix038_rmo.opt_false-unreach-call.i [2018-12-02 14:35:09,623 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_584107c6-2617-43c6-bcc8-c0d0197c4178/bin-2019/utaipan/data/2c460ae48/7bb15326f7b84dc6aae5c2f1b6bde241/FLAG6b1d150c1 [2018-12-02 14:35:09,633 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_584107c6-2617-43c6-bcc8-c0d0197c4178/bin-2019/utaipan/data/2c460ae48/7bb15326f7b84dc6aae5c2f1b6bde241 [2018-12-02 14:35:09,635 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:35:09,636 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:35:09,636 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:35:09,636 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:35:09,639 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:35:09,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:35:09" (1/1) ... [2018-12-02 14:35:09,641 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ab2707f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:09, skipping insertion in model container [2018-12-02 14:35:09,641 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:35:09" (1/1) ... [2018-12-02 14:35:09,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:35:09,669 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:35:09,861 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:35:09,869 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:35:09,940 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:35:09,986 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:35:09,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:09 WrapperNode [2018-12-02 14:35:09,986 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:35:09,987 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:35:09,987 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:35:09,987 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:35:09,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:09" (1/1) ... [2018-12-02 14:35:10,003 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:09" (1/1) ... [2018-12-02 14:35:10,019 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:35:10,019 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:35:10,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:35:10,020 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:35:10,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:09" (1/1) ... [2018-12-02 14:35:10,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:09" (1/1) ... [2018-12-02 14:35:10,028 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:09" (1/1) ... [2018-12-02 14:35:10,029 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:09" (1/1) ... [2018-12-02 14:35:10,034 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:09" (1/1) ... [2018-12-02 14:35:10,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:09" (1/1) ... [2018-12-02 14:35:10,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:09" (1/1) ... [2018-12-02 14:35:10,040 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:35:10,040 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:35:10,040 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:35:10,041 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:35:10,041 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_584107c6-2617-43c6-bcc8-c0d0197c4178/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-02 14:35:10,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 14:35:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 14:35:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 14:35:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 14:35:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 14:35:10,074 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 14:35:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 14:35:10,074 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 14:35:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-02 14:35:10,074 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-02 14:35:10,074 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 14:35:10,075 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:35:10,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:35:10,076 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 14:35:10,354 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:35:10,354 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 14:35:10,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:35:10 BoogieIcfgContainer [2018-12-02 14:35:10,354 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:35:10,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 14:35:10,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 14:35:10,358 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 14:35:10,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:35:09" (1/3) ... [2018-12-02 14:35:10,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aca063c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:35:10, skipping insertion in model container [2018-12-02 14:35:10,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:35:09" (2/3) ... [2018-12-02 14:35:10,359 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6aca063c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:35:10, skipping insertion in model container [2018-12-02 14:35:10,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:35:10" (3/3) ... [2018-12-02 14:35:10,361 INFO L112 eAbstractionObserver]: Analyzing ICFG mix038_rmo.opt_false-unreach-call.i [2018-12-02 14:35:10,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,394 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,394 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,394 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,395 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,396 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,396 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,397 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,397 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,398 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,399 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,400 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,401 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,402 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,403 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,404 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,405 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,406 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,407 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,408 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,409 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,409 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,409 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,410 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,410 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,410 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,410 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,410 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,410 WARN L317 ript$VariableManager]: TermVariabe Thread2_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,410 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,411 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,411 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,411 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,411 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,411 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,411 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,411 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,412 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,412 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,412 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,412 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,412 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,412 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,412 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,412 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,413 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,413 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,413 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,413 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,413 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,413 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,413 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,413 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,414 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P2_#t~nondet34.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 14:35:10,420 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 14:35:10,420 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 14:35:10,427 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 14:35:10,440 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 14:35:10,460 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 14:35:10,460 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 14:35:10,460 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 14:35:10,460 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:35:10,460 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:35:10,460 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 14:35:10,461 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:35:10,461 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 14:35:10,468 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146places, 177 transitions [2018-12-02 14:35:30,083 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 149045 states. [2018-12-02 14:35:30,084 INFO L276 IsEmpty]: Start isEmpty. Operand 149045 states. [2018-12-02 14:35:30,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 14:35:30,092 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:35:30,092 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] [2018-12-02 14:35:30,094 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:35:30,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:35:30,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1389776375, now seen corresponding path program 1 times [2018-12-02 14:35:30,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:35:30,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:30,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:35:30,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:30,133 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:35:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:35:30,242 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-02 14:35:30,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:35:30,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:35:30,244 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:35:30,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:35:30,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:35:30,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:35:30,256 INFO L87 Difference]: Start difference. First operand 149045 states. Second operand 4 states. [2018-12-02 14:35:31,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:35:31,488 INFO L93 Difference]: Finished difference Result 257065 states and 1188604 transitions. [2018-12-02 14:35:31,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:35:31,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2018-12-02 14:35:31,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:35:34,006 INFO L225 Difference]: With dead ends: 257065 [2018-12-02 14:35:34,006 INFO L226 Difference]: Without dead ends: 174815 [2018-12-02 14:35:34,007 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-02 14:35:34,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174815 states. [2018-12-02 14:35:36,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174815 to 110555. [2018-12-02 14:35:36,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110555 states. [2018-12-02 14:35:37,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110555 states to 110555 states and 511486 transitions. [2018-12-02 14:35:37,061 INFO L78 Accepts]: Start accepts. Automaton has 110555 states and 511486 transitions. Word has length 46 [2018-12-02 14:35:37,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:35:37,062 INFO L480 AbstractCegarLoop]: Abstraction has 110555 states and 511486 transitions. [2018-12-02 14:35:37,062 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:35:37,063 INFO L276 IsEmpty]: Start isEmpty. Operand 110555 states and 511486 transitions. [2018-12-02 14:35:37,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-12-02 14:35:37,073 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:35:37,073 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-02 14:35:37,073 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:35:37,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:35:37,073 INFO L82 PathProgramCache]: Analyzing trace with hash -1733656626, now seen corresponding path program 1 times [2018-12-02 14:35:37,073 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:35:37,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:37,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:35:37,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:37,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:35:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:35:37,124 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-02 14:35:37,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:35:37,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:35:37,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:35:37,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:35:37,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:35:37,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:35:37,126 INFO L87 Difference]: Start difference. First operand 110555 states and 511486 transitions. Second operand 5 states. [2018-12-02 14:35:38,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:35:38,718 INFO L93 Difference]: Finished difference Result 240605 states and 1068741 transitions. [2018-12-02 14:35:38,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:35:38,719 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 54 [2018-12-02 14:35:38,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:35:39,346 INFO L225 Difference]: With dead ends: 240605 [2018-12-02 14:35:39,346 INFO L226 Difference]: Without dead ends: 237055 [2018-12-02 14:35:39,347 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-02 14:35:40,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237055 states. [2018-12-02 14:35:42,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237055 to 160435. [2018-12-02 14:35:42,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160435 states. [2018-12-02 14:35:43,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160435 states to 160435 states and 716930 transitions. [2018-12-02 14:35:43,663 INFO L78 Accepts]: Start accepts. Automaton has 160435 states and 716930 transitions. Word has length 54 [2018-12-02 14:35:43,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:35:43,664 INFO L480 AbstractCegarLoop]: Abstraction has 160435 states and 716930 transitions. [2018-12-02 14:35:43,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:35:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 160435 states and 716930 transitions. [2018-12-02 14:35:43,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 14:35:43,673 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:35:43,673 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:35:43,674 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:35:43,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:35:43,674 INFO L82 PathProgramCache]: Analyzing trace with hash 901134090, now seen corresponding path program 1 times [2018-12-02 14:35:43,674 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:35:43,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:43,676 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:35:43,676 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:43,676 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:35:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:35:43,735 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-02 14:35:43,735 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:35:43,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:35:43,736 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:35:43,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:35:43,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:35:43,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:35:43,736 INFO L87 Difference]: Start difference. First operand 160435 states and 716930 transitions. Second operand 5 states. [2018-12-02 14:35:45,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:35:45,338 INFO L93 Difference]: Finished difference Result 317175 states and 1405287 transitions. [2018-12-02 14:35:45,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:35:45,339 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2018-12-02 14:35:45,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:35:46,679 INFO L225 Difference]: With dead ends: 317175 [2018-12-02 14:35:46,679 INFO L226 Difference]: Without dead ends: 314275 [2018-12-02 14:35:46,679 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-02 14:35:47,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314275 states. [2018-12-02 14:35:53,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314275 to 178275. [2018-12-02 14:35:53,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178275 states. [2018-12-02 14:35:54,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178275 states to 178275 states and 791492 transitions. [2018-12-02 14:35:54,295 INFO L78 Accepts]: Start accepts. Automaton has 178275 states and 791492 transitions. Word has length 55 [2018-12-02 14:35:54,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:35:54,295 INFO L480 AbstractCegarLoop]: Abstraction has 178275 states and 791492 transitions. [2018-12-02 14:35:54,295 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:35:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 178275 states and 791492 transitions. [2018-12-02 14:35:54,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-02 14:35:54,308 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:35:54,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] [2018-12-02 14:35:54,308 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:35:54,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:35:54,308 INFO L82 PathProgramCache]: Analyzing trace with hash -710959504, now seen corresponding path program 1 times [2018-12-02 14:35:54,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:35:54,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:54,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:35:54,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:35:54,310 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:35:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:35:54,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:35:54,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:35:54,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 14:35:54,341 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:35:54,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:35:54,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:35:54,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:35:54,342 INFO L87 Difference]: Start difference. First operand 178275 states and 791492 transitions. Second operand 3 states. [2018-12-02 14:35:55,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:35:55,794 INFO L93 Difference]: Finished difference Result 231655 states and 1011276 transitions. [2018-12-02 14:35:55,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:35:55,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-12-02 14:35:55,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:35:56,392 INFO L225 Difference]: With dead ends: 231655 [2018-12-02 14:35:56,392 INFO L226 Difference]: Without dead ends: 231655 [2018-12-02 14:35:56,392 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-02 14:35:57,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231655 states. [2018-12-02 14:36:02,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231655 to 202940. [2018-12-02 14:36:02,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202940 states. [2018-12-02 14:36:03,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202940 states to 202940 states and 893564 transitions. [2018-12-02 14:36:03,241 INFO L78 Accepts]: Start accepts. Automaton has 202940 states and 893564 transitions. Word has length 57 [2018-12-02 14:36:03,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:03,241 INFO L480 AbstractCegarLoop]: Abstraction has 202940 states and 893564 transitions. [2018-12-02 14:36:03,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:36:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 202940 states and 893564 transitions. [2018-12-02 14:36:03,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 14:36:03,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:03,272 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-02 14:36:03,272 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:03,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:03,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1048459579, now seen corresponding path program 1 times [2018-12-02 14:36:03,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:03,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:03,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:03,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:03,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:03,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:03,319 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-02 14:36:03,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:36:03,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:36:03,320 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:03,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:36:03,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:36:03,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:36:03,320 INFO L87 Difference]: Start difference. First operand 202940 states and 893564 transitions. Second operand 6 states. [2018-12-02 14:36:05,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:05,487 INFO L93 Difference]: Finished difference Result 356175 states and 1552272 transitions. [2018-12-02 14:36:05,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 14:36:05,488 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-12-02 14:36:05,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:06,375 INFO L225 Difference]: With dead ends: 356175 [2018-12-02 14:36:06,375 INFO L226 Difference]: Without dead ends: 352825 [2018-12-02 14:36:06,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:36:10,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352825 states. [2018-12-02 14:36:13,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352825 to 205745. [2018-12-02 14:36:13,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205745 states. [2018-12-02 14:36:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205745 states to 205745 states and 906783 transitions. [2018-12-02 14:36:14,668 INFO L78 Accepts]: Start accepts. Automaton has 205745 states and 906783 transitions. Word has length 61 [2018-12-02 14:36:14,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:14,668 INFO L480 AbstractCegarLoop]: Abstraction has 205745 states and 906783 transitions. [2018-12-02 14:36:14,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:36:14,668 INFO L276 IsEmpty]: Start isEmpty. Operand 205745 states and 906783 transitions. [2018-12-02 14:36:14,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 14:36:14,699 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:14,699 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-02 14:36:14,700 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:14,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:14,700 INFO L82 PathProgramCache]: Analyzing trace with hash -639670917, now seen corresponding path program 1 times [2018-12-02 14:36:14,700 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:14,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:14,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:14,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:14,701 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:14,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:14,758 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-02 14:36:14,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:36:14,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:36:14,758 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:14,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:36:14,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:36:14,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:36:14,759 INFO L87 Difference]: Start difference. First operand 205745 states and 906783 transitions. Second operand 7 states. [2018-12-02 14:36:17,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:17,098 INFO L93 Difference]: Finished difference Result 363445 states and 1539808 transitions. [2018-12-02 14:36:17,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 14:36:17,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 61 [2018-12-02 14:36:17,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:17,985 INFO L225 Difference]: With dead ends: 363445 [2018-12-02 14:36:17,985 INFO L226 Difference]: Without dead ends: 363445 [2018-12-02 14:36:17,986 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:36:19,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363445 states. [2018-12-02 14:36:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363445 to 273285. [2018-12-02 14:36:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273285 states. [2018-12-02 14:36:27,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273285 states to 273285 states and 1180560 transitions. [2018-12-02 14:36:27,304 INFO L78 Accepts]: Start accepts. Automaton has 273285 states and 1180560 transitions. Word has length 61 [2018-12-02 14:36:27,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:27,304 INFO L480 AbstractCegarLoop]: Abstraction has 273285 states and 1180560 transitions. [2018-12-02 14:36:27,304 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:36:27,304 INFO L276 IsEmpty]: Start isEmpty. Operand 273285 states and 1180560 transitions. [2018-12-02 14:36:27,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 14:36:27,344 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:27,344 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-02 14:36:27,344 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:27,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:27,345 INFO L82 PathProgramCache]: Analyzing trace with hash 247832764, now seen corresponding path program 1 times [2018-12-02 14:36:27,345 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:27,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:27,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:27,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:27,347 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:27,390 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-02 14:36:27,390 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:36:27,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:36:27,390 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:27,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:36:27,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:36:27,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:36:27,391 INFO L87 Difference]: Start difference. First operand 273285 states and 1180560 transitions. Second operand 4 states. [2018-12-02 14:36:28,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:28,819 INFO L93 Difference]: Finished difference Result 238293 states and 1009124 transitions. [2018-12-02 14:36:28,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:36:28,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2018-12-02 14:36:28,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:29,403 INFO L225 Difference]: With dead ends: 238293 [2018-12-02 14:36:29,404 INFO L226 Difference]: Without dead ends: 230208 [2018-12-02 14:36:29,404 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-02 14:36:30,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230208 states. [2018-12-02 14:36:33,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230208 to 230208. [2018-12-02 14:36:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230208 states. [2018-12-02 14:36:34,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230208 states to 230208 states and 981402 transitions. [2018-12-02 14:36:34,202 INFO L78 Accepts]: Start accepts. Automaton has 230208 states and 981402 transitions. Word has length 61 [2018-12-02 14:36:34,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:34,202 INFO L480 AbstractCegarLoop]: Abstraction has 230208 states and 981402 transitions. [2018-12-02 14:36:34,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:36:34,202 INFO L276 IsEmpty]: Start isEmpty. Operand 230208 states and 981402 transitions. [2018-12-02 14:36:34,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-02 14:36:34,237 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:34,237 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:36:34,237 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:34,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:34,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1622064650, now seen corresponding path program 1 times [2018-12-02 14:36:34,238 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:34,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:34,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:34,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:34,239 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:34,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-02 14:36:34,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:36:34,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:36:34,297 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:34,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:36:34,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:36:34,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:36:34,297 INFO L87 Difference]: Start difference. First operand 230208 states and 981402 transitions. Second operand 5 states. [2018-12-02 14:36:34,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:34,900 INFO L93 Difference]: Finished difference Result 55500 states and 215291 transitions. [2018-12-02 14:36:34,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:36:34,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 62 [2018-12-02 14:36:34,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:34,985 INFO L225 Difference]: With dead ends: 55500 [2018-12-02 14:36:34,985 INFO L226 Difference]: Without dead ends: 48584 [2018-12-02 14:36:34,985 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-02 14:36:35,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48584 states. [2018-12-02 14:36:35,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48584 to 48344. [2018-12-02 14:36:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48344 states. [2018-12-02 14:36:35,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48344 states to 48344 states and 187078 transitions. [2018-12-02 14:36:35,607 INFO L78 Accepts]: Start accepts. Automaton has 48344 states and 187078 transitions. Word has length 62 [2018-12-02 14:36:35,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:35,607 INFO L480 AbstractCegarLoop]: Abstraction has 48344 states and 187078 transitions. [2018-12-02 14:36:35,607 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:36:35,607 INFO L276 IsEmpty]: Start isEmpty. Operand 48344 states and 187078 transitions. [2018-12-02 14:36:35,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 14:36:35,621 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:35,622 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:36:35,622 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:35,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:35,622 INFO L82 PathProgramCache]: Analyzing trace with hash -34559289, now seen corresponding path program 1 times [2018-12-02 14:36:35,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:35,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:35,623 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:35,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:35,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:35,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:35,656 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-02 14:36:35,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:36:35,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:36:35,656 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:35,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:36:35,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:36:35,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:36:35,657 INFO L87 Difference]: Start difference. First operand 48344 states and 187078 transitions. Second operand 4 states. [2018-12-02 14:36:35,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:35,901 INFO L93 Difference]: Finished difference Result 56631 states and 218625 transitions. [2018-12-02 14:36:35,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:36:35,901 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 72 [2018-12-02 14:36:35,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:36,007 INFO L225 Difference]: With dead ends: 56631 [2018-12-02 14:36:36,008 INFO L226 Difference]: Without dead ends: 56631 [2018-12-02 14:36:36,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:36:36,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56631 states. [2018-12-02 14:36:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56631 to 51431. [2018-12-02 14:36:37,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51431 states. [2018-12-02 14:36:37,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51431 states to 51431 states and 198665 transitions. [2018-12-02 14:36:37,927 INFO L78 Accepts]: Start accepts. Automaton has 51431 states and 198665 transitions. Word has length 72 [2018-12-02 14:36:37,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:37,928 INFO L480 AbstractCegarLoop]: Abstraction has 51431 states and 198665 transitions. [2018-12-02 14:36:37,928 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:36:37,928 INFO L276 IsEmpty]: Start isEmpty. Operand 51431 states and 198665 transitions. [2018-12-02 14:36:37,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-02 14:36:37,945 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:37,945 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:36:37,945 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:37,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:37,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1708251046, now seen corresponding path program 1 times [2018-12-02 14:36:37,946 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:37,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:37,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:37,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:37,947 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:37,997 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-02 14:36:37,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:36:37,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:36:37,998 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:37,998 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:36:37,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:36:37,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:36:37,999 INFO L87 Difference]: Start difference. First operand 51431 states and 198665 transitions. Second operand 6 states. [2018-12-02 14:36:38,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:38,065 INFO L93 Difference]: Finished difference Result 14279 states and 47593 transitions. [2018-12-02 14:36:38,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:36:38,065 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2018-12-02 14:36:38,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:38,079 INFO L225 Difference]: With dead ends: 14279 [2018-12-02 14:36:38,080 INFO L226 Difference]: Without dead ends: 12023 [2018-12-02 14:36:38,080 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-02 14:36:38,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12023 states. [2018-12-02 14:36:38,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12023 to 11433. [2018-12-02 14:36:38,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11433 states. [2018-12-02 14:36:38,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11433 states to 11433 states and 37545 transitions. [2018-12-02 14:36:38,201 INFO L78 Accepts]: Start accepts. Automaton has 11433 states and 37545 transitions. Word has length 72 [2018-12-02 14:36:38,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:38,201 INFO L480 AbstractCegarLoop]: Abstraction has 11433 states and 37545 transitions. [2018-12-02 14:36:38,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:36:38,201 INFO L276 IsEmpty]: Start isEmpty. Operand 11433 states and 37545 transitions. [2018-12-02 14:36:38,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 14:36:38,211 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:38,212 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] [2018-12-02 14:36:38,212 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:38,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:38,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1409942006, now seen corresponding path program 1 times [2018-12-02 14:36:38,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:38,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:38,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:38,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:38,214 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:38,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:38,246 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-02 14:36:38,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:36:38,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 14:36:38,246 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:38,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:36:38,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:36:38,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 14:36:38,247 INFO L87 Difference]: Start difference. First operand 11433 states and 37545 transitions. Second operand 4 states. [2018-12-02 14:36:38,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:38,400 INFO L93 Difference]: Finished difference Result 15878 states and 51191 transitions. [2018-12-02 14:36:38,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:36:38,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2018-12-02 14:36:38,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:38,418 INFO L225 Difference]: With dead ends: 15878 [2018-12-02 14:36:38,418 INFO L226 Difference]: Without dead ends: 15878 [2018-12-02 14:36:38,419 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-02 14:36:38,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15878 states. [2018-12-02 14:36:38,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15878 to 13895. [2018-12-02 14:36:38,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13895 states. [2018-12-02 14:36:38,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13895 states to 13895 states and 45044 transitions. [2018-12-02 14:36:38,569 INFO L78 Accepts]: Start accepts. Automaton has 13895 states and 45044 transitions. Word has length 91 [2018-12-02 14:36:38,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:38,570 INFO L480 AbstractCegarLoop]: Abstraction has 13895 states and 45044 transitions. [2018-12-02 14:36:38,570 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:36:38,570 INFO L276 IsEmpty]: Start isEmpty. Operand 13895 states and 45044 transitions. [2018-12-02 14:36:38,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 14:36:38,583 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:38,583 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] [2018-12-02 14:36:38,583 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:38,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:38,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1159544393, now seen corresponding path program 1 times [2018-12-02 14:36:38,583 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:38,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:38,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:38,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:38,585 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:38,636 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-02 14:36:38,636 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:36:38,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:36:38,636 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:38,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:36:38,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:36:38,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:36:38,637 INFO L87 Difference]: Start difference. First operand 13895 states and 45044 transitions. Second operand 6 states. [2018-12-02 14:36:38,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:38,949 INFO L93 Difference]: Finished difference Result 18245 states and 58549 transitions. [2018-12-02 14:36:38,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:36:38,949 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-02 14:36:38,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:38,968 INFO L225 Difference]: With dead ends: 18245 [2018-12-02 14:36:38,968 INFO L226 Difference]: Without dead ends: 17810 [2018-12-02 14:36:38,968 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-02 14:36:38,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17810 states. [2018-12-02 14:36:39,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17810 to 16895. [2018-12-02 14:36:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16895 states. [2018-12-02 14:36:39,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16895 states to 16895 states and 54549 transitions. [2018-12-02 14:36:39,142 INFO L78 Accepts]: Start accepts. Automaton has 16895 states and 54549 transitions. Word has length 91 [2018-12-02 14:36:39,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:39,142 INFO L480 AbstractCegarLoop]: Abstraction has 16895 states and 54549 transitions. [2018-12-02 14:36:39,142 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:36:39,142 INFO L276 IsEmpty]: Start isEmpty. Operand 16895 states and 54549 transitions. [2018-12-02 14:36:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 14:36:39,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:39,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:36:39,156 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:39,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:39,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1395330258, now seen corresponding path program 2 times [2018-12-02 14:36:39,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:39,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:39,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:39,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:39,158 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:39,234 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-02 14:36:39,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:36:39,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:36:39,234 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:39,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:36:39,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:36:39,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:36:39,235 INFO L87 Difference]: Start difference. First operand 16895 states and 54549 transitions. Second operand 7 states. [2018-12-02 14:36:39,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:39,587 INFO L93 Difference]: Finished difference Result 21628 states and 70031 transitions. [2018-12-02 14:36:39,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:36:39,588 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-02 14:36:39,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:39,612 INFO L225 Difference]: With dead ends: 21628 [2018-12-02 14:36:39,613 INFO L226 Difference]: Without dead ends: 21628 [2018-12-02 14:36:39,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:36:39,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21628 states. [2018-12-02 14:36:39,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21628 to 17725. [2018-12-02 14:36:39,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17725 states. [2018-12-02 14:36:39,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17725 states to 17725 states and 57628 transitions. [2018-12-02 14:36:39,819 INFO L78 Accepts]: Start accepts. Automaton has 17725 states and 57628 transitions. Word has length 91 [2018-12-02 14:36:39,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:39,819 INFO L480 AbstractCegarLoop]: Abstraction has 17725 states and 57628 transitions. [2018-12-02 14:36:39,819 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:36:39,819 INFO L276 IsEmpty]: Start isEmpty. Operand 17725 states and 57628 transitions. [2018-12-02 14:36:39,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 14:36:39,835 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:39,835 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:36:39,835 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:39,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:39,835 INFO L82 PathProgramCache]: Analyzing trace with hash -829778632, now seen corresponding path program 1 times [2018-12-02 14:36:39,835 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:39,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:39,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:36:39,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:39,836 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:39,882 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-02 14:36:39,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:36:39,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 14:36:39,883 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:39,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:36:39,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:36:39,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 14:36:39,883 INFO L87 Difference]: Start difference. First operand 17725 states and 57628 transitions. Second operand 5 states. [2018-12-02 14:36:40,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:40,128 INFO L93 Difference]: Finished difference Result 21707 states and 69733 transitions. [2018-12-02 14:36:40,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:36:40,128 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2018-12-02 14:36:40,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:40,150 INFO L225 Difference]: With dead ends: 21707 [2018-12-02 14:36:40,151 INFO L226 Difference]: Without dead ends: 21587 [2018-12-02 14:36:40,151 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-02 14:36:40,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21587 states. [2018-12-02 14:36:40,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21587 to 18260. [2018-12-02 14:36:40,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18260 states. [2018-12-02 14:36:40,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18260 states to 18260 states and 59176 transitions. [2018-12-02 14:36:40,347 INFO L78 Accepts]: Start accepts. Automaton has 18260 states and 59176 transitions. Word has length 91 [2018-12-02 14:36:40,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:40,347 INFO L480 AbstractCegarLoop]: Abstraction has 18260 states and 59176 transitions. [2018-12-02 14:36:40,347 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:36:40,347 INFO L276 IsEmpty]: Start isEmpty. Operand 18260 states and 59176 transitions. [2018-12-02 14:36:40,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 14:36:40,363 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:40,363 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] [2018-12-02 14:36:40,364 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:40,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:40,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1233112668, now seen corresponding path program 3 times [2018-12-02 14:36:40,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:40,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:40,365 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:40,365 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:40,365 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:40,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:36:40,428 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:36:40,428 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:36:40,428 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:40,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:36:40,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:36:40,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:36:40,429 INFO L87 Difference]: Start difference. First operand 18260 states and 59176 transitions. Second operand 7 states. [2018-12-02 14:36:40,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:40,753 INFO L93 Difference]: Finished difference Result 31458 states and 102091 transitions. [2018-12-02 14:36:40,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 14:36:40,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2018-12-02 14:36:40,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:40,790 INFO L225 Difference]: With dead ends: 31458 [2018-12-02 14:36:40,790 INFO L226 Difference]: Without dead ends: 31458 [2018-12-02 14:36:40,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:36:40,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31458 states. [2018-12-02 14:36:41,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31458 to 20931. [2018-12-02 14:36:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20931 states. [2018-12-02 14:36:41,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20931 states to 20931 states and 68313 transitions. [2018-12-02 14:36:41,064 INFO L78 Accepts]: Start accepts. Automaton has 20931 states and 68313 transitions. Word has length 91 [2018-12-02 14:36:41,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:41,065 INFO L480 AbstractCegarLoop]: Abstraction has 20931 states and 68313 transitions. [2018-12-02 14:36:41,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:36:41,065 INFO L276 IsEmpty]: Start isEmpty. Operand 20931 states and 68313 transitions. [2018-12-02 14:36:41,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 14:36:41,083 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:41,083 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] [2018-12-02 14:36:41,084 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:41,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:41,084 INFO L82 PathProgramCache]: Analyzing trace with hash 2120616349, now seen corresponding path program 1 times [2018-12-02 14:36:41,084 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:41,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:41,085 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:36:41,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:41,085 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:36:41,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:36:41,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:36:41,141 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:41,142 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:36:41,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:36:41,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:36:41,142 INFO L87 Difference]: Start difference. First operand 20931 states and 68313 transitions. Second operand 6 states. [2018-12-02 14:36:41,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:41,347 INFO L93 Difference]: Finished difference Result 29491 states and 95659 transitions. [2018-12-02 14:36:41,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:36:41,347 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-02 14:36:41,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:41,382 INFO L225 Difference]: With dead ends: 29491 [2018-12-02 14:36:41,382 INFO L226 Difference]: Without dead ends: 29491 [2018-12-02 14:36:41,382 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:36:41,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29491 states. [2018-12-02 14:36:41,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29491 to 23426. [2018-12-02 14:36:41,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23426 states. [2018-12-02 14:36:41,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23426 states to 23426 states and 76389 transitions. [2018-12-02 14:36:41,662 INFO L78 Accepts]: Start accepts. Automaton has 23426 states and 76389 transitions. Word has length 91 [2018-12-02 14:36:41,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:41,663 INFO L480 AbstractCegarLoop]: Abstraction has 23426 states and 76389 transitions. [2018-12-02 14:36:41,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:36:41,663 INFO L276 IsEmpty]: Start isEmpty. Operand 23426 states and 76389 transitions. [2018-12-02 14:36:41,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-12-02 14:36:41,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:41,682 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] [2018-12-02 14:36:41,683 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:41,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:41,683 INFO L82 PathProgramCache]: Analyzing trace with hash -844096675, now seen corresponding path program 1 times [2018-12-02 14:36:41,683 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:41,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:41,684 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:41,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:41,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:41,760 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-02 14:36:41,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:36:41,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 14:36:41,760 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:41,761 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:36:41,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:36:41,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:36:41,761 INFO L87 Difference]: Start difference. First operand 23426 states and 76389 transitions. Second operand 6 states. [2018-12-02 14:36:41,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:41,894 INFO L93 Difference]: Finished difference Result 22594 states and 72725 transitions. [2018-12-02 14:36:41,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:36:41,894 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2018-12-02 14:36:41,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:41,918 INFO L225 Difference]: With dead ends: 22594 [2018-12-02 14:36:41,918 INFO L226 Difference]: Without dead ends: 22594 [2018-12-02 14:36:41,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:36:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22594 states. [2018-12-02 14:36:42,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22594 to 17111. [2018-12-02 14:36:42,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17111 states. [2018-12-02 14:36:42,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17111 states to 17111 states and 55509 transitions. [2018-12-02 14:36:42,187 INFO L78 Accepts]: Start accepts. Automaton has 17111 states and 55509 transitions. Word has length 91 [2018-12-02 14:36:42,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:42,187 INFO L480 AbstractCegarLoop]: Abstraction has 17111 states and 55509 transitions. [2018-12-02 14:36:42,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:36:42,187 INFO L276 IsEmpty]: Start isEmpty. Operand 17111 states and 55509 transitions. [2018-12-02 14:36:42,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 14:36:42,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:42,201 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] [2018-12-02 14:36:42,202 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:42,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:42,202 INFO L82 PathProgramCache]: Analyzing trace with hash -75405535, now seen corresponding path program 1 times [2018-12-02 14:36:42,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:42,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:42,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:42,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:42,203 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:42,264 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-02 14:36:42,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:36:42,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:36:42,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:42,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:36:42,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:36:42,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:36:42,265 INFO L87 Difference]: Start difference. First operand 17111 states and 55509 transitions. Second operand 7 states. [2018-12-02 14:36:42,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:42,487 INFO L93 Difference]: Finished difference Result 18441 states and 58783 transitions. [2018-12-02 14:36:42,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 14:36:42,487 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-02 14:36:42,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:42,507 INFO L225 Difference]: With dead ends: 18441 [2018-12-02 14:36:42,507 INFO L226 Difference]: Without dead ends: 18441 [2018-12-02 14:36:42,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:36:42,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18441 states. [2018-12-02 14:36:42,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18441 to 14731. [2018-12-02 14:36:42,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14731 states. [2018-12-02 14:36:42,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14731 states to 14731 states and 46785 transitions. [2018-12-02 14:36:42,671 INFO L78 Accepts]: Start accepts. Automaton has 14731 states and 46785 transitions. Word has length 93 [2018-12-02 14:36:42,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:42,671 INFO L480 AbstractCegarLoop]: Abstraction has 14731 states and 46785 transitions. [2018-12-02 14:36:42,671 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:36:42,671 INFO L276 IsEmpty]: Start isEmpty. Operand 14731 states and 46785 transitions. [2018-12-02 14:36:42,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 14:36:42,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:42,684 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] [2018-12-02 14:36:42,684 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:42,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:42,684 INFO L82 PathProgramCache]: Analyzing trace with hash 886208482, now seen corresponding path program 1 times [2018-12-02 14:36:42,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:42,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:42,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:42,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:42,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:42,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:42,780 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-02 14:36:42,780 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:36:42,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 14:36:42,780 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:42,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 14:36:42,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 14:36:42,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:36:42,781 INFO L87 Difference]: Start difference. First operand 14731 states and 46785 transitions. Second operand 8 states. [2018-12-02 14:36:42,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:42,997 INFO L93 Difference]: Finished difference Result 16988 states and 53438 transitions. [2018-12-02 14:36:42,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 14:36:42,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 93 [2018-12-02 14:36:42,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:43,014 INFO L225 Difference]: With dead ends: 16988 [2018-12-02 14:36:43,014 INFO L226 Difference]: Without dead ends: 16988 [2018-12-02 14:36:43,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2018-12-02 14:36:43,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16988 states. [2018-12-02 14:36:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16988 to 16344. [2018-12-02 14:36:43,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16344 states. [2018-12-02 14:36:43,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16344 states to 16344 states and 51641 transitions. [2018-12-02 14:36:43,182 INFO L78 Accepts]: Start accepts. Automaton has 16344 states and 51641 transitions. Word has length 93 [2018-12-02 14:36:43,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:43,183 INFO L480 AbstractCegarLoop]: Abstraction has 16344 states and 51641 transitions. [2018-12-02 14:36:43,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 14:36:43,183 INFO L276 IsEmpty]: Start isEmpty. Operand 16344 states and 51641 transitions. [2018-12-02 14:36:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 14:36:43,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:43,197 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] [2018-12-02 14:36:43,197 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:43,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:43,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1773712163, now seen corresponding path program 1 times [2018-12-02 14:36:43,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:43,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:43,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:43,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:43,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:43,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:43,288 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-02 14:36:43,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:36:43,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 14:36:43,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:43,289 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 14:36:43,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 14:36:43,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:36:43,289 INFO L87 Difference]: Start difference. First operand 16344 states and 51641 transitions. Second operand 10 states. [2018-12-02 14:36:44,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:44,094 INFO L93 Difference]: Finished difference Result 30335 states and 95605 transitions. [2018-12-02 14:36:44,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 14:36:44,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-12-02 14:36:44,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:44,117 INFO L225 Difference]: With dead ends: 30335 [2018-12-02 14:36:44,118 INFO L226 Difference]: Without dead ends: 20914 [2018-12-02 14:36:44,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=271, Unknown=0, NotChecked=0, Total=342 [2018-12-02 14:36:44,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20914 states. [2018-12-02 14:36:44,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20914 to 17254. [2018-12-02 14:36:44,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17254 states. [2018-12-02 14:36:44,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17254 states to 17254 states and 54264 transitions. [2018-12-02 14:36:44,330 INFO L78 Accepts]: Start accepts. Automaton has 17254 states and 54264 transitions. Word has length 93 [2018-12-02 14:36:44,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:44,331 INFO L480 AbstractCegarLoop]: Abstraction has 17254 states and 54264 transitions. [2018-12-02 14:36:44,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 14:36:44,331 INFO L276 IsEmpty]: Start isEmpty. Operand 17254 states and 54264 transitions. [2018-12-02 14:36:44,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 14:36:44,346 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:44,346 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:36:44,347 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:44,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:44,347 INFO L82 PathProgramCache]: Analyzing trace with hash 530462971, now seen corresponding path program 2 times [2018-12-02 14:36:44,347 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:44,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:44,348 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:44,348 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:44,348 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:44,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:44,470 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-02 14:36:44,470 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:36:44,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 14:36:44,470 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:44,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 14:36:44,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 14:36:44,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:36:44,471 INFO L87 Difference]: Start difference. First operand 17254 states and 54264 transitions. Second operand 10 states. [2018-12-02 14:36:45,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:45,039 INFO L93 Difference]: Finished difference Result 32450 states and 102165 transitions. [2018-12-02 14:36:45,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 14:36:45,039 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2018-12-02 14:36:45,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:45,057 INFO L225 Difference]: With dead ends: 32450 [2018-12-02 14:36:45,057 INFO L226 Difference]: Without dead ends: 15314 [2018-12-02 14:36:45,057 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2018-12-02 14:36:45,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15314 states. [2018-12-02 14:36:45,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15314 to 15314. [2018-12-02 14:36:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15314 states. [2018-12-02 14:36:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15314 states to 15314 states and 48036 transitions. [2018-12-02 14:36:45,254 INFO L78 Accepts]: Start accepts. Automaton has 15314 states and 48036 transitions. Word has length 93 [2018-12-02 14:36:45,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:45,255 INFO L480 AbstractCegarLoop]: Abstraction has 15314 states and 48036 transitions. [2018-12-02 14:36:45,255 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 14:36:45,255 INFO L276 IsEmpty]: Start isEmpty. Operand 15314 states and 48036 transitions. [2018-12-02 14:36:45,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 14:36:45,268 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:45,268 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] [2018-12-02 14:36:45,268 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:45,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:45,268 INFO L82 PathProgramCache]: Analyzing trace with hash -1667491465, now seen corresponding path program 3 times [2018-12-02 14:36:45,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:45,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:45,269 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:36:45,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:45,269 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:45,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:45,319 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-02 14:36:45,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:36:45,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 14:36:45,319 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:45,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:36:45,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:36:45,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 14:36:45,319 INFO L87 Difference]: Start difference. First operand 15314 states and 48036 transitions. Second operand 7 states. [2018-12-02 14:36:45,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:45,636 INFO L93 Difference]: Finished difference Result 26707 states and 84110 transitions. [2018-12-02 14:36:45,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:36:45,636 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2018-12-02 14:36:45,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:45,647 INFO L225 Difference]: With dead ends: 26707 [2018-12-02 14:36:45,647 INFO L226 Difference]: Without dead ends: 10415 [2018-12-02 14:36:45,647 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-02 14:36:45,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10415 states. [2018-12-02 14:36:45,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10415 to 10415. [2018-12-02 14:36:45,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2018-12-02 14:36:45,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32764 transitions. [2018-12-02 14:36:45,742 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32764 transitions. Word has length 93 [2018-12-02 14:36:45,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:45,742 INFO L480 AbstractCegarLoop]: Abstraction has 10415 states and 32764 transitions. [2018-12-02 14:36:45,742 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:36:45,742 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32764 transitions. [2018-12-02 14:36:45,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 14:36:45,750 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:45,750 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] [2018-12-02 14:36:45,751 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:45,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:45,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1558601563, now seen corresponding path program 4 times [2018-12-02 14:36:45,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:45,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:45,752 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:36:45,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:45,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:45,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:36:45,843 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-02 14:36:45,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:36:45,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 14:36:45,843 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:36:45,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 14:36:45,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 14:36:45,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 14:36:45,843 INFO L87 Difference]: Start difference. First operand 10415 states and 32764 transitions. Second operand 11 states. [2018-12-02 14:36:46,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:36:46,375 INFO L93 Difference]: Finished difference Result 18734 states and 58484 transitions. [2018-12-02 14:36:46,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 14:36:46,375 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 93 [2018-12-02 14:36:46,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:36:46,387 INFO L225 Difference]: With dead ends: 18734 [2018-12-02 14:36:46,387 INFO L226 Difference]: Without dead ends: 11916 [2018-12-02 14:36:46,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=310, Unknown=0, NotChecked=0, Total=380 [2018-12-02 14:36:46,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11916 states. [2018-12-02 14:36:46,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11916 to 10424. [2018-12-02 14:36:46,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10424 states. [2018-12-02 14:36:46,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10424 states to 10424 states and 32775 transitions. [2018-12-02 14:36:46,489 INFO L78 Accepts]: Start accepts. Automaton has 10424 states and 32775 transitions. Word has length 93 [2018-12-02 14:36:46,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:36:46,489 INFO L480 AbstractCegarLoop]: Abstraction has 10424 states and 32775 transitions. [2018-12-02 14:36:46,489 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 14:36:46,489 INFO L276 IsEmpty]: Start isEmpty. Operand 10424 states and 32775 transitions. [2018-12-02 14:36:46,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 14:36:46,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:36:46,498 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] [2018-12-02 14:36:46,498 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 14:36:46,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:36:46,498 INFO L82 PathProgramCache]: Analyzing trace with hash -260946119, now seen corresponding path program 5 times [2018-12-02 14:36:46,498 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:36:46,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:46,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:36:46,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:36:46,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:36:46,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:36:46,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 14:36:46,533 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 14:36:46,600 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 14:36:46,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:36:46 BasicIcfg [2018-12-02 14:36:46,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 14:36:46,601 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:36:46,601 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:36:46,601 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:36:46,602 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:35:10" (3/4) ... [2018-12-02 14:36:46,603 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 14:36:46,690 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_584107c6-2617-43c6-bcc8-c0d0197c4178/bin-2019/utaipan/witness.graphml [2018-12-02 14:36:46,690 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:36:46,691 INFO L168 Benchmark]: Toolchain (without parser) took 97055.04 ms. Allocated memory was 1.0 GB in the beginning and 7.4 GB in the end (delta: 6.3 GB). Free memory was 952.4 MB in the beginning and 5.6 GB in the end (delta: -4.6 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-02 14:36:46,692 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:36:46,692 INFO L168 Benchmark]: CACSL2BoogieTranslator took 349.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 952.4 MB in the beginning and 1.2 GB in the end (delta: -199.9 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. [2018-12-02 14:36:46,692 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:36:46,692 INFO L168 Benchmark]: Boogie Preprocessor took 20.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:36:46,693 INFO L168 Benchmark]: RCFGBuilder took 314.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2018-12-02 14:36:46,693 INFO L168 Benchmark]: TraceAbstraction took 96245.85 ms. Allocated memory was 1.2 GB in the beginning and 7.4 GB in the end (delta: 6.2 GB). Free memory was 1.1 GB in the beginning and 5.6 GB in the end (delta: -4.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. [2018-12-02 14:36:46,693 INFO L168 Benchmark]: Witness Printer took 88.74 ms. Allocated memory is still 7.4 GB. Free memory was 5.6 GB in the beginning and 5.6 GB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2018-12-02 14:36:46,695 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 349.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 179.8 MB). Free memory was 952.4 MB in the beginning and 1.2 GB in the end (delta: -199.9 MB). Peak memory consumption was 31.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 314.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 96245.85 ms. Allocated memory was 1.2 GB in the beginning and 7.4 GB in the end (delta: 6.2 GB). Free memory was 1.1 GB in the beginning and 5.6 GB in the end (delta: -4.5 GB). Peak memory consumption was 1.7 GB. Max. memory is 11.5 GB. * Witness Printer took 88.74 ms. Allocated memory is still 7.4 GB. Free memory was 5.6 GB in the beginning and 5.6 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L676] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L678] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L680] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L681] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L682] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L684] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L686] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L688] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L689] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L690] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L691] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L692] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L693] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L694] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L695] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L696] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L697] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L698] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}] [L699] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L700] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L701] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L702] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L704] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L705] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L706] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L796] -1 pthread_t t1018; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L797] FCALL, FORK -1 pthread_create(&t1018, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L798] -1 pthread_t t1019; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L799] FCALL, FORK -1 pthread_create(&t1019, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L800] -1 pthread_t t1020; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L801] FCALL, FORK -1 pthread_create(&t1020, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L753] 0 y$w_buff1 = y$w_buff0 [L754] 0 y$w_buff0 = 1 [L755] 0 y$w_buff1_used = y$w_buff0_used [L756] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L758] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L759] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L760] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L761] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L762] 0 y$r_buff0_thd3 = (_Bool)1 [L765] 0 z = 1 [L768] 0 __unbuffered_p2_EAX = z [L771] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 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=0, __unbuffered_p1_EAX=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L710] 1 a = 1 [L713] 1 x = 1 [L718] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] 2 x = 2 [L728] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L729] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L730] 2 y$flush_delayed = weak$$choice2 [L731] 2 y$mem_tmp = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __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=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __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=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L774] 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) [L775] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __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=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L775] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L776] 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 [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __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=1, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L732] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L776] 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 [L777] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __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=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __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=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L734] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __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=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L735] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __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=1, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L736] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __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=1, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L778] 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_p1_EAX=0, __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=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 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 [L781] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __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=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __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=1, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L737] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L738] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __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=1, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L739] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __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=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __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=1, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 2 y = y$flush_delayed ? y$mem_tmp : y [L741] 2 y$flush_delayed = (_Bool)0 [L746] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __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=1, weak$$choice2=1, x=2, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 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_p1_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] 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_p1_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L807] -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) [L808] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L808] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 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_p1_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L809] -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 [L810] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L811] 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_p1_EAX=0, __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=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] -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 [L814] -1 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __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=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=1, 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_p1_EAX=0, __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=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=1, 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_p1_EAX=0, __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=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=1, 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, 219 locations, 3 error locations. UNSAFE Result, 96.1s OverallTime, 24 OverallIterations, 1 TraceHistogramMax, 25.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6782 SDtfs, 8798 SDslu, 19130 SDs, 0 SdLazy, 6783 SolverSat, 302 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 66 SyntacticMatches, 14 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=273285occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 49.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 590574 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1889 NumberOfCodeBlocks, 1889 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1773 ConstructedInterpolants, 0 QuantifiedInterpolants, 358777 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...