./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix015_pso.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_6452797d-ec52-44d5-8e9a-f56b1c3db4eb/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6452797d-ec52-44d5-8e9a-f56b1c3db4eb/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6452797d-ec52-44d5-8e9a-f56b1c3db4eb/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6452797d-ec52-44d5-8e9a-f56b1c3db4eb/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix015_pso.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6452797d-ec52-44d5-8e9a-f56b1c3db4eb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6452797d-ec52-44d5-8e9a-f56b1c3db4eb/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 f307346aec6f29e68c8dfd90bd8a8b0631cc8549 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 11:35:40,869 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 11:35:40,870 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 11:35:40,876 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 11:35:40,876 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 11:35:40,877 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 11:35:40,878 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 11:35:40,879 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 11:35:40,880 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 11:35:40,881 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 11:35:40,882 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 11:35:40,882 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 11:35:40,883 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 11:35:40,883 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 11:35:40,884 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 11:35:40,885 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 11:35:40,885 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 11:35:40,887 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 11:35:40,888 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 11:35:40,889 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 11:35:40,890 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 11:35:40,891 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 11:35:40,892 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 11:35:40,892 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 11:35:40,892 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 11:35:40,893 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 11:35:40,894 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 11:35:40,894 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 11:35:40,895 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 11:35:40,896 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 11:35:40,896 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 11:35:40,896 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 11:35:40,896 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 11:35:40,897 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 11:35:40,897 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 11:35:40,898 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 11:35:40,898 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6452797d-ec52-44d5-8e9a-f56b1c3db4eb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 11:35:40,906 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 11:35:40,906 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 11:35:40,907 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 11:35:40,907 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 11:35:40,907 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 11:35:40,907 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 11:35:40,907 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 11:35:40,908 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 11:35:40,908 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 11:35:40,908 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 11:35:40,908 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 11:35:40,908 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 11:35:40,908 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 11:35:40,909 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 11:35:40,909 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 11:35:40,909 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 11:35:40,909 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 11:35:40,910 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 11:35:40,910 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 11:35:40,910 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 11:35:40,910 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 11:35:40,910 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 11:35:40,910 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 11:35:40,910 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 11:35:40,911 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 11:35:40,911 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 11:35:40,911 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 11:35:40,911 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 11:35:40,911 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 11:35:40,911 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 11:35:40,912 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 11:35:40,912 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 11:35:40,912 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 11:35:40,912 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 11:35:40,912 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 11:35:40,912 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 11:35:40,912 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_6452797d-ec52-44d5-8e9a-f56b1c3db4eb/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 -> f307346aec6f29e68c8dfd90bd8a8b0631cc8549 [2018-12-09 11:35:40,934 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 11:35:40,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 11:35:40,942 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 11:35:40,943 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 11:35:40,943 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 11:35:40,944 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6452797d-ec52-44d5-8e9a-f56b1c3db4eb/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix015_pso.opt_false-unreach-call.i [2018-12-09 11:35:40,978 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6452797d-ec52-44d5-8e9a-f56b1c3db4eb/bin-2019/utaipan/data/251c4dc4e/75dfa299657a45188308436b1bfb22dc/FLAGe23726a88 [2018-12-09 11:35:41,383 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 11:35:41,383 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6452797d-ec52-44d5-8e9a-f56b1c3db4eb/sv-benchmarks/c/pthread-wmm/mix015_pso.opt_false-unreach-call.i [2018-12-09 11:35:41,391 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6452797d-ec52-44d5-8e9a-f56b1c3db4eb/bin-2019/utaipan/data/251c4dc4e/75dfa299657a45188308436b1bfb22dc/FLAGe23726a88 [2018-12-09 11:35:41,724 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6452797d-ec52-44d5-8e9a-f56b1c3db4eb/bin-2019/utaipan/data/251c4dc4e/75dfa299657a45188308436b1bfb22dc [2018-12-09 11:35:41,729 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 11:35:41,731 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 11:35:41,732 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 11:35:41,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 11:35:41,738 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 11:35:41,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:35:41" (1/1) ... [2018-12-09 11:35:41,744 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@126510b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:35:41, skipping insertion in model container [2018-12-09 11:35:41,744 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 11:35:41" (1/1) ... [2018-12-09 11:35:41,752 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 11:35:41,773 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 11:35:41,956 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:35:41,964 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 11:35:42,051 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 11:35:42,083 INFO L195 MainTranslator]: Completed translation [2018-12-09 11:35:42,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:35:42 WrapperNode [2018-12-09 11:35:42,084 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 11:35:42,084 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 11:35:42,084 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 11:35:42,084 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 11:35:42,090 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:35:42" (1/1) ... [2018-12-09 11:35:42,101 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:35:42" (1/1) ... [2018-12-09 11:35:42,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 11:35:42,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 11:35:42,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 11:35:42,121 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 11:35:42,127 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:35:42" (1/1) ... [2018-12-09 11:35:42,127 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:35:42" (1/1) ... [2018-12-09 11:35:42,130 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:35:42" (1/1) ... [2018-12-09 11:35:42,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:35:42" (1/1) ... [2018-12-09 11:35:42,136 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:35:42" (1/1) ... [2018-12-09 11:35:42,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:35:42" (1/1) ... [2018-12-09 11:35:42,140 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:35:42" (1/1) ... [2018-12-09 11:35:42,142 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 11:35:42,143 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 11:35:42,143 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 11:35:42,143 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 11:35:42,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:35:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6452797d-ec52-44d5-8e9a-f56b1c3db4eb/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 11:35:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 11:35:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 11:35:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 11:35:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 11:35:42,179 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 11:35:42,179 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 11:35:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 11:35:42,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 11:35:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 11:35:42,180 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 11:35:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 11:35:42,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 11:35:42,180 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 11:35:42,182 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 11:35:42,556 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 11:35:42,556 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 11:35:42,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:35:42 BoogieIcfgContainer [2018-12-09 11:35:42,557 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 11:35:42,557 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 11:35:42,557 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 11:35:42,559 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 11:35:42,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 11:35:41" (1/3) ... [2018-12-09 11:35:42,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68435842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:35:42, skipping insertion in model container [2018-12-09 11:35:42,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 11:35:42" (2/3) ... [2018-12-09 11:35:42,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68435842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 11:35:42, skipping insertion in model container [2018-12-09 11:35:42,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:35:42" (3/3) ... [2018-12-09 11:35:42,562 INFO L112 eAbstractionObserver]: Analyzing ICFG mix015_pso.opt_false-unreach-call.i [2018-12-09 11:35:42,589 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,590 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,590 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,590 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,590 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,590 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,590 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,590 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,590 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,591 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,591 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,591 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,591 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,591 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,591 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,591 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,591 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,591 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,592 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,592 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,593 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,594 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,595 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,596 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,597 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,598 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,599 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,600 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,601 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,601 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,601 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,602 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,602 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,602 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,602 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,602 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,602 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,602 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,602 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,602 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,602 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,603 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,604 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,605 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,606 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,607 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,608 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,609 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,610 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,611 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,612 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 11:35:42,619 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 11:35:42,619 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 11:35:42,626 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 11:35:42,640 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 11:35:42,658 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 11:35:42,659 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 11:35:42,659 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 11:35:42,659 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 11:35:42,659 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 11:35:42,659 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 11:35:42,659 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 11:35:42,659 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 11:35:42,669 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 190places, 242 transitions [2018-12-09 11:38:05,219 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 445147 states. [2018-12-09 11:38:05,221 INFO L276 IsEmpty]: Start isEmpty. Operand 445147 states. [2018-12-09 11:38:05,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-09 11:38:05,229 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:38:05,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:38:05,231 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:38:05,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:38:05,235 INFO L82 PathProgramCache]: Analyzing trace with hash -339585471, now seen corresponding path program 1 times [2018-12-09 11:38:05,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:38:05,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:38:05,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:38:05,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:38:05,271 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:38:05,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:38:05,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:38:05,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:38:05,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:38:05,377 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:38:05,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:38:05,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:38:05,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:38:05,395 INFO L87 Difference]: Start difference. First operand 445147 states. Second operand 4 states. [2018-12-09 11:38:13,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:38:13,738 INFO L93 Difference]: Finished difference Result 810627 states and 3886644 transitions. [2018-12-09 11:38:13,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:38:13,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-09 11:38:13,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:38:16,175 INFO L225 Difference]: With dead ends: 810627 [2018-12-09 11:38:16,175 INFO L226 Difference]: Without dead ends: 530977 [2018-12-09 11:38:16,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:38:29,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530977 states. [2018-12-09 11:38:35,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530977 to 307957. [2018-12-09 11:38:35,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307957 states. [2018-12-09 11:38:36,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307957 states to 307957 states and 1493658 transitions. [2018-12-09 11:38:36,400 INFO L78 Accepts]: Start accepts. Automaton has 307957 states and 1493658 transitions. Word has length 48 [2018-12-09 11:38:36,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:38:36,401 INFO L480 AbstractCegarLoop]: Abstraction has 307957 states and 1493658 transitions. [2018-12-09 11:38:36,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:38:36,401 INFO L276 IsEmpty]: Start isEmpty. Operand 307957 states and 1493658 transitions. [2018-12-09 11:38:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 11:38:36,411 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:38:36,412 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] [2018-12-09 11:38:36,412 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:38:36,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:38:36,412 INFO L82 PathProgramCache]: Analyzing trace with hash -48370061, now seen corresponding path program 1 times [2018-12-09 11:38:36,412 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:38:36,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:38:36,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:38:36,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:38:36,415 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:38:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:38:36,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:38:36,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:38:36,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:38:36,462 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:38:36,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:38:36,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:38:36,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:38:36,464 INFO L87 Difference]: Start difference. First operand 307957 states and 1493658 transitions. Second operand 3 states. [2018-12-09 11:38:41,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:38:41,285 INFO L93 Difference]: Finished difference Result 307957 states and 1492633 transitions. [2018-12-09 11:38:41,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:38:41,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2018-12-09 11:38:41,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:38:42,402 INFO L225 Difference]: With dead ends: 307957 [2018-12-09 11:38:42,403 INFO L226 Difference]: Without dead ends: 307957 [2018-12-09 11:38:42,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:38:47,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307957 states. [2018-12-09 11:38:51,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307957 to 307957. [2018-12-09 11:38:51,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307957 states. [2018-12-09 11:38:52,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307957 states to 307957 states and 1492633 transitions. [2018-12-09 11:38:52,946 INFO L78 Accepts]: Start accepts. Automaton has 307957 states and 1492633 transitions. Word has length 56 [2018-12-09 11:38:52,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:38:52,946 INFO L480 AbstractCegarLoop]: Abstraction has 307957 states and 1492633 transitions. [2018-12-09 11:38:52,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:38:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 307957 states and 1492633 transitions. [2018-12-09 11:38:52,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-12-09 11:38:52,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:38:52,953 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] [2018-12-09 11:38:52,953 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:38:52,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:38:52,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1694440274, now seen corresponding path program 1 times [2018-12-09 11:38:52,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:38:52,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:38:52,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:38:52,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:38:52,957 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:38:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:38:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:38:53,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:38:53,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:38:53,018 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:38:53,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:38:53,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:38:53,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:38:53,018 INFO L87 Difference]: Start difference. First operand 307957 states and 1492633 transitions. Second operand 4 states. [2018-12-09 11:38:58,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:38:58,232 INFO L93 Difference]: Finished difference Result 272411 states and 1286588 transitions. [2018-12-09 11:38:58,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:38:58,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2018-12-09 11:38:58,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:38:58,924 INFO L225 Difference]: With dead ends: 272411 [2018-12-09 11:38:58,924 INFO L226 Difference]: Without dead ends: 258311 [2018-12-09 11:38:58,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:39:03,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258311 states. [2018-12-09 11:39:06,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258311 to 258311. [2018-12-09 11:39:06,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258311 states. [2018-12-09 11:39:07,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258311 states to 258311 states and 1232395 transitions. [2018-12-09 11:39:07,395 INFO L78 Accepts]: Start accepts. Automaton has 258311 states and 1232395 transitions. Word has length 56 [2018-12-09 11:39:07,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:39:07,395 INFO L480 AbstractCegarLoop]: Abstraction has 258311 states and 1232395 transitions. [2018-12-09 11:39:07,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:39:07,395 INFO L276 IsEmpty]: Start isEmpty. Operand 258311 states and 1232395 transitions. [2018-12-09 11:39:07,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 11:39:07,401 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:39:07,401 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-09 11:39:07,401 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:39:07,401 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:39:07,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1611734580, now seen corresponding path program 1 times [2018-12-09 11:39:07,401 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:39:07,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:07,403 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:39:07,403 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:07,403 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:39:07,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:39:07,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:39:07,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:39:07,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:39:07,442 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:39:07,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:39:07,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:39:07,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:39:07,443 INFO L87 Difference]: Start difference. First operand 258311 states and 1232395 transitions. Second operand 5 states. [2018-12-09 11:39:07,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:39:07,713 INFO L93 Difference]: Finished difference Result 61671 states and 252911 transitions. [2018-12-09 11:39:07,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:39:07,714 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-09 11:39:07,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:39:07,821 INFO L225 Difference]: With dead ends: 61671 [2018-12-09 11:39:07,822 INFO L226 Difference]: Without dead ends: 49979 [2018-12-09 11:39:07,822 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:39:07,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49979 states. [2018-12-09 11:39:08,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49979 to 49519. [2018-12-09 11:39:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49519 states. [2018-12-09 11:39:08,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49519 states to 49519 states and 199433 transitions. [2018-12-09 11:39:08,926 INFO L78 Accepts]: Start accepts. Automaton has 49519 states and 199433 transitions. Word has length 57 [2018-12-09 11:39:08,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:39:08,927 INFO L480 AbstractCegarLoop]: Abstraction has 49519 states and 199433 transitions. [2018-12-09 11:39:08,927 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:39:08,927 INFO L276 IsEmpty]: Start isEmpty. Operand 49519 states and 199433 transitions. [2018-12-09 11:39:08,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 11:39:08,929 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:39:08,929 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-09 11:39:08,929 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:39:08,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:39:08,930 INFO L82 PathProgramCache]: Analyzing trace with hash 828222952, now seen corresponding path program 1 times [2018-12-09 11:39:08,930 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:39:08,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:08,931 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:39:08,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:08,931 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:39:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:39:08,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:39:08,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:39:08,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:39:08,974 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:39:08,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:39:08,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:39:08,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:39:08,975 INFO L87 Difference]: Start difference. First operand 49519 states and 199433 transitions. Second operand 5 states. [2018-12-09 11:39:09,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:39:09,577 INFO L93 Difference]: Finished difference Result 100165 states and 398362 transitions. [2018-12-09 11:39:09,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:39:09,578 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2018-12-09 11:39:09,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:39:09,788 INFO L225 Difference]: With dead ends: 100165 [2018-12-09 11:39:09,788 INFO L226 Difference]: Without dead ends: 99790 [2018-12-09 11:39:09,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:39:10,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99790 states. [2018-12-09 11:39:11,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99790 to 66558. [2018-12-09 11:39:11,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66558 states. [2018-12-09 11:39:11,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66558 states to 66558 states and 261441 transitions. [2018-12-09 11:39:11,228 INFO L78 Accepts]: Start accepts. Automaton has 66558 states and 261441 transitions. Word has length 57 [2018-12-09 11:39:11,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:39:11,228 INFO L480 AbstractCegarLoop]: Abstraction has 66558 states and 261441 transitions. [2018-12-09 11:39:11,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:39:11,228 INFO L276 IsEmpty]: Start isEmpty. Operand 66558 states and 261441 transitions. [2018-12-09 11:39:11,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-09 11:39:11,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:39:11,231 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] [2018-12-09 11:39:11,232 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:39:11,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:39:11,232 INFO L82 PathProgramCache]: Analyzing trace with hash -2059079538, now seen corresponding path program 1 times [2018-12-09 11:39:11,232 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:39:11,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:11,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:39:11,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:11,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:39:11,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:39:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:39:11,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:39:11,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:39:11,251 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:39:11,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:39:11,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:39:11,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:39:11,251 INFO L87 Difference]: Start difference. First operand 66558 states and 261441 transitions. Second operand 3 states. [2018-12-09 11:39:11,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:39:11,760 INFO L93 Difference]: Finished difference Result 122934 states and 477436 transitions. [2018-12-09 11:39:11,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:39:11,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2018-12-09 11:39:11,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:39:12,017 INFO L225 Difference]: With dead ends: 122934 [2018-12-09 11:39:12,017 INFO L226 Difference]: Without dead ends: 122914 [2018-12-09 11:39:12,018 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:39:12,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122914 states. [2018-12-09 11:39:13,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122914 to 103769. [2018-12-09 11:39:13,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103769 states. [2018-12-09 11:39:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103769 states to 103769 states and 403303 transitions. [2018-12-09 11:39:13,847 INFO L78 Accepts]: Start accepts. Automaton has 103769 states and 403303 transitions. Word has length 59 [2018-12-09 11:39:13,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:39:13,848 INFO L480 AbstractCegarLoop]: Abstraction has 103769 states and 403303 transitions. [2018-12-09 11:39:13,848 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:39:13,848 INFO L276 IsEmpty]: Start isEmpty. Operand 103769 states and 403303 transitions. [2018-12-09 11:39:13,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-09 11:39:13,855 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:39:13,855 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] [2018-12-09 11:39:13,855 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:39:13,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:39:13,855 INFO L82 PathProgramCache]: Analyzing trace with hash 422957529, now seen corresponding path program 1 times [2018-12-09 11:39:13,855 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:39:13,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:13,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:39:13,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:13,857 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:39:13,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:39:13,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:39:13,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:39:13,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 11:39:13,939 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:39:13,940 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 11:39:13,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 11:39:13,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:39:13,940 INFO L87 Difference]: Start difference. First operand 103769 states and 403303 transitions. Second operand 8 states. [2018-12-09 11:39:15,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:39:15,178 INFO L93 Difference]: Finished difference Result 140479 states and 532646 transitions. [2018-12-09 11:39:15,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 11:39:15,178 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2018-12-09 11:39:15,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:39:15,460 INFO L225 Difference]: With dead ends: 140479 [2018-12-09 11:39:15,460 INFO L226 Difference]: Without dead ends: 140014 [2018-12-09 11:39:15,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2018-12-09 11:39:15,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140014 states. [2018-12-09 11:39:16,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140014 to 105818. [2018-12-09 11:39:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105818 states. [2018-12-09 11:39:19,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105818 states to 105818 states and 410088 transitions. [2018-12-09 11:39:19,669 INFO L78 Accepts]: Start accepts. Automaton has 105818 states and 410088 transitions. Word has length 63 [2018-12-09 11:39:19,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:39:19,670 INFO L480 AbstractCegarLoop]: Abstraction has 105818 states and 410088 transitions. [2018-12-09 11:39:19,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 11:39:19,670 INFO L276 IsEmpty]: Start isEmpty. Operand 105818 states and 410088 transitions. [2018-12-09 11:39:19,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 11:39:19,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:39:19,694 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:39:19,695 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:39:19,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:39:19,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1246120427, now seen corresponding path program 1 times [2018-12-09 11:39:19,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:39:19,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:19,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:39:19,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:19,697 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:39:19,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:39:19,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:39:19,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:39:19,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:39:19,764 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:39:19,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:39:19,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:39:19,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:39:19,765 INFO L87 Difference]: Start difference. First operand 105818 states and 410088 transitions. Second operand 6 states. [2018-12-09 11:39:21,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:39:21,159 INFO L93 Difference]: Finished difference Result 249350 states and 954618 transitions. [2018-12-09 11:39:21,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-09 11:39:21,159 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-12-09 11:39:21,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:39:21,958 INFO L225 Difference]: With dead ends: 249350 [2018-12-09 11:39:21,958 INFO L226 Difference]: Without dead ends: 249030 [2018-12-09 11:39:21,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-09 11:39:22,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249030 states. [2018-12-09 11:39:24,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249030 to 156108. [2018-12-09 11:39:24,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156108 states. [2018-12-09 11:39:24,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156108 states to 156108 states and 592792 transitions. [2018-12-09 11:39:24,861 INFO L78 Accepts]: Start accepts. Automaton has 156108 states and 592792 transitions. Word has length 74 [2018-12-09 11:39:24,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:39:24,861 INFO L480 AbstractCegarLoop]: Abstraction has 156108 states and 592792 transitions. [2018-12-09 11:39:24,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:39:24,861 INFO L276 IsEmpty]: Start isEmpty. Operand 156108 states and 592792 transitions. [2018-12-09 11:39:24,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 11:39:24,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:39:24,923 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:39:24,924 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:39:24,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:39:24,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1848798614, now seen corresponding path program 1 times [2018-12-09 11:39:24,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:39:24,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:24,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:39:24,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:24,925 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:39:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:39:25,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:39:25,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:39:25,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:39:25,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:39:25,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:39:25,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:39:25,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:39:25,006 INFO L87 Difference]: Start difference. First operand 156108 states and 592792 transitions. Second operand 7 states. [2018-12-09 11:39:26,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:39:26,955 INFO L93 Difference]: Finished difference Result 242605 states and 920052 transitions. [2018-12-09 11:39:26,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 11:39:26,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2018-12-09 11:39:26,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:39:27,508 INFO L225 Difference]: With dead ends: 242605 [2018-12-09 11:39:27,508 INFO L226 Difference]: Without dead ends: 241357 [2018-12-09 11:39:27,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-12-09 11:39:28,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241357 states. [2018-12-09 11:39:31,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241357 to 221191. [2018-12-09 11:39:31,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221191 states. [2018-12-09 11:39:31,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221191 states to 221191 states and 838930 transitions. [2018-12-09 11:39:31,717 INFO L78 Accepts]: Start accepts. Automaton has 221191 states and 838930 transitions. Word has length 81 [2018-12-09 11:39:31,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:39:31,718 INFO L480 AbstractCegarLoop]: Abstraction has 221191 states and 838930 transitions. [2018-12-09 11:39:31,718 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:39:31,718 INFO L276 IsEmpty]: Start isEmpty. Operand 221191 states and 838930 transitions. [2018-12-09 11:39:31,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 11:39:31,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:39:31,814 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:39:31,814 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:39:31,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:39:31,814 INFO L82 PathProgramCache]: Analyzing trace with hash 51847255, now seen corresponding path program 1 times [2018-12-09 11:39:31,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:39:31,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:31,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:39:31,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:31,816 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:39:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:39:31,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:39:31,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:39:31,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 11:39:31,903 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:39:31,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 11:39:31,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 11:39:31,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:39:31,904 INFO L87 Difference]: Start difference. First operand 221191 states and 838930 transitions. Second operand 8 states. [2018-12-09 11:39:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:39:34,075 INFO L93 Difference]: Finished difference Result 264605 states and 995964 transitions. [2018-12-09 11:39:34,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 11:39:34,076 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2018-12-09 11:39:34,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:39:34,669 INFO L225 Difference]: With dead ends: 264605 [2018-12-09 11:39:34,669 INFO L226 Difference]: Without dead ends: 264605 [2018-12-09 11:39:34,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2018-12-09 11:39:35,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264605 states. [2018-12-09 11:39:38,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264605 to 234279. [2018-12-09 11:39:38,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234279 states. [2018-12-09 11:39:39,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234279 states to 234279 states and 886386 transitions. [2018-12-09 11:39:39,013 INFO L78 Accepts]: Start accepts. Automaton has 234279 states and 886386 transitions. Word has length 81 [2018-12-09 11:39:39,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:39:39,014 INFO L480 AbstractCegarLoop]: Abstraction has 234279 states and 886386 transitions. [2018-12-09 11:39:39,014 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 11:39:39,014 INFO L276 IsEmpty]: Start isEmpty. Operand 234279 states and 886386 transitions. [2018-12-09 11:39:39,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-09 11:39:39,108 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:39:39,108 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:39:39,108 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:39:39,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:39:39,109 INFO L82 PathProgramCache]: Analyzing trace with hash 939350936, now seen corresponding path program 1 times [2018-12-09 11:39:39,109 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:39:39,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:39,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:39:39,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:39,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:39:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:39:39,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:39:39,145 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:39:39,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:39:39,146 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:39:39,146 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:39:39,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:39:39,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:39:39,146 INFO L87 Difference]: Start difference. First operand 234279 states and 886386 transitions. Second operand 3 states. [2018-12-09 11:39:40,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:39:40,317 INFO L93 Difference]: Finished difference Result 196919 states and 731802 transitions. [2018-12-09 11:39:40,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:39:40,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-09 11:39:40,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:39:40,734 INFO L225 Difference]: With dead ends: 196919 [2018-12-09 11:39:40,735 INFO L226 Difference]: Without dead ends: 196023 [2018-12-09 11:39:40,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:39:41,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196023 states. [2018-12-09 11:39:45,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196023 to 183304. [2018-12-09 11:39:45,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183304 states. [2018-12-09 11:39:46,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183304 states to 183304 states and 682992 transitions. [2018-12-09 11:39:46,121 INFO L78 Accepts]: Start accepts. Automaton has 183304 states and 682992 transitions. Word has length 81 [2018-12-09 11:39:46,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:39:46,121 INFO L480 AbstractCegarLoop]: Abstraction has 183304 states and 682992 transitions. [2018-12-09 11:39:46,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:39:46,121 INFO L276 IsEmpty]: Start isEmpty. Operand 183304 states and 682992 transitions. [2018-12-09 11:39:46,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 11:39:46,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:39:46,210 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] [2018-12-09 11:39:46,210 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:39:46,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:39:46,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1103979428, now seen corresponding path program 1 times [2018-12-09 11:39:46,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:39:46,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:46,212 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:39:46,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:46,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:39:46,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:39:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:39:46,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:39:46,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:39:46,280 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:39:46,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:39:46,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:39:46,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:39:46,280 INFO L87 Difference]: Start difference. First operand 183304 states and 682992 transitions. Second operand 7 states. [2018-12-09 11:39:48,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:39:48,001 INFO L93 Difference]: Finished difference Result 271087 states and 1012125 transitions. [2018-12-09 11:39:48,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 11:39:48,001 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2018-12-09 11:39:48,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:39:48,614 INFO L225 Difference]: With dead ends: 271087 [2018-12-09 11:39:48,614 INFO L226 Difference]: Without dead ends: 271087 [2018-12-09 11:39:48,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-12-09 11:39:49,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271087 states. [2018-12-09 11:39:52,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271087 to 228911. [2018-12-09 11:39:52,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228911 states. [2018-12-09 11:39:52,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228911 states to 228911 states and 854941 transitions. [2018-12-09 11:39:52,744 INFO L78 Accepts]: Start accepts. Automaton has 228911 states and 854941 transitions. Word has length 82 [2018-12-09 11:39:52,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:39:52,744 INFO L480 AbstractCegarLoop]: Abstraction has 228911 states and 854941 transitions. [2018-12-09 11:39:52,744 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:39:52,744 INFO L276 IsEmpty]: Start isEmpty. Operand 228911 states and 854941 transitions. [2018-12-09 11:39:53,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-12-09 11:39:53,161 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:39:53,161 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] [2018-12-09 11:39:53,161 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:39:53,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:39:53,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1991483109, now seen corresponding path program 1 times [2018-12-09 11:39:53,162 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:39:53,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:53,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:39:53,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:53,163 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:39:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:39:53,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:39:53,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:39:53,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:39:53,206 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:39:53,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:39:53,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:39:53,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:39:53,206 INFO L87 Difference]: Start difference. First operand 228911 states and 854941 transitions. Second operand 6 states. [2018-12-09 11:39:53,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:39:53,493 INFO L93 Difference]: Finished difference Result 78479 states and 263197 transitions. [2018-12-09 11:39:53,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 11:39:53,494 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2018-12-09 11:39:53,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:39:53,598 INFO L225 Difference]: With dead ends: 78479 [2018-12-09 11:39:53,598 INFO L226 Difference]: Without dead ends: 67103 [2018-12-09 11:39:53,599 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-09 11:39:53,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67103 states. [2018-12-09 11:39:54,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67103 to 40413. [2018-12-09 11:39:54,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40413 states. [2018-12-09 11:39:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40413 states to 40413 states and 135753 transitions. [2018-12-09 11:39:54,246 INFO L78 Accepts]: Start accepts. Automaton has 40413 states and 135753 transitions. Word has length 82 [2018-12-09 11:39:54,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:39:54,247 INFO L480 AbstractCegarLoop]: Abstraction has 40413 states and 135753 transitions. [2018-12-09 11:39:54,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:39:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 40413 states and 135753 transitions. [2018-12-09 11:39:54,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 11:39:54,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:39:54,287 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:39:54,287 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:39:54,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:39:54,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1402014901, now seen corresponding path program 1 times [2018-12-09 11:39:54,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:39:54,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:54,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:39:54,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:54,288 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:39:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:39:54,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-09 11:39:54,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:39:54,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:39:54,319 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:39:54,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:39:54,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:39:54,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:39:54,320 INFO L87 Difference]: Start difference. First operand 40413 states and 135753 transitions. Second operand 4 states. [2018-12-09 11:39:54,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:39:54,723 INFO L93 Difference]: Finished difference Result 79407 states and 257347 transitions. [2018-12-09 11:39:54,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:39:54,724 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-12-09 11:39:54,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:39:54,837 INFO L225 Difference]: With dead ends: 79407 [2018-12-09 11:39:54,837 INFO L226 Difference]: Without dead ends: 79407 [2018-12-09 11:39:54,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:39:54,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79407 states. [2018-12-09 11:39:56,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79407 to 60113. [2018-12-09 11:39:56,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60113 states. [2018-12-09 11:39:57,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60113 states to 60113 states and 198448 transitions. [2018-12-09 11:39:57,081 INFO L78 Accepts]: Start accepts. Automaton has 60113 states and 198448 transitions. Word has length 111 [2018-12-09 11:39:57,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:39:57,081 INFO L480 AbstractCegarLoop]: Abstraction has 60113 states and 198448 transitions. [2018-12-09 11:39:57,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:39:57,081 INFO L276 IsEmpty]: Start isEmpty. Operand 60113 states and 198448 transitions. [2018-12-09 11:39:57,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 11:39:57,148 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:39:57,148 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:39:57,148 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:39:57,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:39:57,148 INFO L82 PathProgramCache]: Analyzing trace with hash -157250420, now seen corresponding path program 1 times [2018-12-09 11:39:57,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:39:57,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:57,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:39:57,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:57,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:39:57,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:39:57,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:39:57,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:39:57,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:39:57,240 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:39:57,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:39:57,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:39:57,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:39:57,241 INFO L87 Difference]: Start difference. First operand 60113 states and 198448 transitions. Second operand 7 states. [2018-12-09 11:39:57,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:39:57,888 INFO L93 Difference]: Finished difference Result 82473 states and 268791 transitions. [2018-12-09 11:39:57,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 11:39:57,889 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-09 11:39:57,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:39:58,002 INFO L225 Difference]: With dead ends: 82473 [2018-12-09 11:39:58,002 INFO L226 Difference]: Without dead ends: 82473 [2018-12-09 11:39:58,002 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 11:39:58,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82473 states. [2018-12-09 11:39:58,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82473 to 69163. [2018-12-09 11:39:58,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69163 states. [2018-12-09 11:39:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69163 states to 69163 states and 228228 transitions. [2018-12-09 11:39:59,037 INFO L78 Accepts]: Start accepts. Automaton has 69163 states and 228228 transitions. Word has length 111 [2018-12-09 11:39:59,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:39:59,037 INFO L480 AbstractCegarLoop]: Abstraction has 69163 states and 228228 transitions. [2018-12-09 11:39:59,037 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:39:59,038 INFO L276 IsEmpty]: Start isEmpty. Operand 69163 states and 228228 transitions. [2018-12-09 11:39:59,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 11:39:59,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:39:59,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:39:59,114 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:39:59,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:39:59,114 INFO L82 PathProgramCache]: Analyzing trace with hash 54100493, now seen corresponding path program 1 times [2018-12-09 11:39:59,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:39:59,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:59,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:39:59,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:39:59,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:39:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:39:59,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:39:59,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:39:59,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:39:59,171 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:39:59,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:39:59,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:39:59,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:39:59,172 INFO L87 Difference]: Start difference. First operand 69163 states and 228228 transitions. Second operand 7 states. [2018-12-09 11:39:59,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:39:59,922 INFO L93 Difference]: Finished difference Result 113223 states and 372472 transitions. [2018-12-09 11:39:59,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 11:39:59,923 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-09 11:39:59,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:00,107 INFO L225 Difference]: With dead ends: 113223 [2018-12-09 11:40:00,107 INFO L226 Difference]: Without dead ends: 113223 [2018-12-09 11:40:00,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-12-09 11:40:00,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113223 states. [2018-12-09 11:40:01,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113223 to 105795. [2018-12-09 11:40:01,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105795 states. [2018-12-09 11:40:01,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105795 states to 105795 states and 348418 transitions. [2018-12-09 11:40:01,701 INFO L78 Accepts]: Start accepts. Automaton has 105795 states and 348418 transitions. Word has length 111 [2018-12-09 11:40:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:01,701 INFO L480 AbstractCegarLoop]: Abstraction has 105795 states and 348418 transitions. [2018-12-09 11:40:01,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:40:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 105795 states and 348418 transitions. [2018-12-09 11:40:01,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 11:40:01,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:01,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:01,842 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:40:01,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:01,842 INFO L82 PathProgramCache]: Analyzing trace with hash -456433684, now seen corresponding path program 1 times [2018-12-09 11:40:01,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:40:01,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:01,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:01,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:01,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:40:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:01,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:01,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:01,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:40:01,900 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:40:01,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:40:01,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:40:01,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:40:01,901 INFO L87 Difference]: Start difference. First operand 105795 states and 348418 transitions. Second operand 4 states. [2018-12-09 11:40:02,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:02,367 INFO L93 Difference]: Finished difference Result 106371 states and 350290 transitions. [2018-12-09 11:40:02,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 11:40:02,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-12-09 11:40:02,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:02,541 INFO L225 Difference]: With dead ends: 106371 [2018-12-09 11:40:02,541 INFO L226 Difference]: Without dead ends: 106243 [2018-12-09 11:40:02,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:40:02,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106243 states. [2018-12-09 11:40:03,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106243 to 103908. [2018-12-09 11:40:03,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103908 states. [2018-12-09 11:40:04,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103908 states to 103908 states and 342389 transitions. [2018-12-09 11:40:04,095 INFO L78 Accepts]: Start accepts. Automaton has 103908 states and 342389 transitions. Word has length 111 [2018-12-09 11:40:04,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:04,096 INFO L480 AbstractCegarLoop]: Abstraction has 103908 states and 342389 transitions. [2018-12-09 11:40:04,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:40:04,096 INFO L276 IsEmpty]: Start isEmpty. Operand 103908 states and 342389 transitions. [2018-12-09 11:40:04,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 11:40:04,235 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:04,235 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:04,235 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:40:04,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:04,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1154078572, now seen corresponding path program 1 times [2018-12-09 11:40:04,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:40:04,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:04,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:04,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:04,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:40:04,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:04,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:04,332 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:04,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 11:40:04,332 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:40:04,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 11:40:04,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 11:40:04,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:40:04,333 INFO L87 Difference]: Start difference. First operand 103908 states and 342389 transitions. Second operand 7 states. [2018-12-09 11:40:04,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:04,960 INFO L93 Difference]: Finished difference Result 120185 states and 391151 transitions. [2018-12-09 11:40:04,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:40:04,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 111 [2018-12-09 11:40:04,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:05,151 INFO L225 Difference]: With dead ends: 120185 [2018-12-09 11:40:05,152 INFO L226 Difference]: Without dead ends: 120185 [2018-12-09 11:40:05,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-09 11:40:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120185 states. [2018-12-09 11:40:06,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120185 to 74986. [2018-12-09 11:40:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74986 states. [2018-12-09 11:40:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74986 states to 74986 states and 247920 transitions. [2018-12-09 11:40:06,507 INFO L78 Accepts]: Start accepts. Automaton has 74986 states and 247920 transitions. Word has length 111 [2018-12-09 11:40:06,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:06,507 INFO L480 AbstractCegarLoop]: Abstraction has 74986 states and 247920 transitions. [2018-12-09 11:40:06,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 11:40:06,507 INFO L276 IsEmpty]: Start isEmpty. Operand 74986 states and 247920 transitions. [2018-12-09 11:40:06,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 11:40:06,595 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:06,595 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:06,596 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:40:06,596 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:06,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2041582253, now seen corresponding path program 1 times [2018-12-09 11:40:06,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:40:06,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:06,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:06,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:06,597 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:40:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:06,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:06,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:40:06,655 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:40:06,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:40:06,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:40:06,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:40:06,656 INFO L87 Difference]: Start difference. First operand 74986 states and 247920 transitions. Second operand 4 states. [2018-12-09 11:40:07,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:07,044 INFO L93 Difference]: Finished difference Result 76986 states and 253215 transitions. [2018-12-09 11:40:07,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:40:07,044 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2018-12-09 11:40:07,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:07,164 INFO L225 Difference]: With dead ends: 76986 [2018-12-09 11:40:07,164 INFO L226 Difference]: Without dead ends: 76986 [2018-12-09 11:40:07,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:40:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76986 states. [2018-12-09 11:40:08,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76986 to 75531. [2018-12-09 11:40:08,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75531 states. [2018-12-09 11:40:08,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75531 states to 75531 states and 248856 transitions. [2018-12-09 11:40:08,180 INFO L78 Accepts]: Start accepts. Automaton has 75531 states and 248856 transitions. Word has length 111 [2018-12-09 11:40:08,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:08,180 INFO L480 AbstractCegarLoop]: Abstraction has 75531 states and 248856 transitions. [2018-12-09 11:40:08,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:40:08,180 INFO L276 IsEmpty]: Start isEmpty. Operand 75531 states and 248856 transitions. [2018-12-09 11:40:08,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 11:40:08,275 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:08,275 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:08,275 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:40:08,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:08,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1547240839, now seen corresponding path program 2 times [2018-12-09 11:40:08,276 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:40:08,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:08,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:08,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:08,277 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:40:08,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:08,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:08,356 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:08,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:40:08,356 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:40:08,356 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:40:08,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:40:08,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:40:08,356 INFO L87 Difference]: Start difference. First operand 75531 states and 248856 transitions. Second operand 6 states. [2018-12-09 11:40:08,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:08,807 INFO L93 Difference]: Finished difference Result 78551 states and 257797 transitions. [2018-12-09 11:40:08,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:40:08,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-12-09 11:40:08,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:08,928 INFO L225 Difference]: With dead ends: 78551 [2018-12-09 11:40:08,928 INFO L226 Difference]: Without dead ends: 78551 [2018-12-09 11:40:08,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:40:09,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78551 states. [2018-12-09 11:40:09,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78551 to 75531. [2018-12-09 11:40:09,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75531 states. [2018-12-09 11:40:10,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75531 states to 75531 states and 248816 transitions. [2018-12-09 11:40:10,074 INFO L78 Accepts]: Start accepts. Automaton has 75531 states and 248816 transitions. Word has length 111 [2018-12-09 11:40:10,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:10,074 INFO L480 AbstractCegarLoop]: Abstraction has 75531 states and 248816 transitions. [2018-12-09 11:40:10,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:40:10,074 INFO L276 IsEmpty]: Start isEmpty. Operand 75531 states and 248816 transitions. [2018-12-09 11:40:10,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 11:40:10,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:10,156 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:10,156 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:40:10,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:10,156 INFO L82 PathProgramCache]: Analyzing trace with hash -863762927, now seen corresponding path program 3 times [2018-12-09 11:40:10,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:40:10,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:10,157 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:40:10,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:10,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:40:10,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:10,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:10,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:10,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 11:40:10,220 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:40:10,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 11:40:10,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 11:40:10,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 11:40:10,221 INFO L87 Difference]: Start difference. First operand 75531 states and 248816 transitions. Second operand 6 states. [2018-12-09 11:40:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:10,799 INFO L93 Difference]: Finished difference Result 92594 states and 304658 transitions. [2018-12-09 11:40:10,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:40:10,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-12-09 11:40:10,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:10,944 INFO L225 Difference]: With dead ends: 92594 [2018-12-09 11:40:10,944 INFO L226 Difference]: Without dead ends: 92594 [2018-12-09 11:40:10,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 11:40:11,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92594 states. [2018-12-09 11:40:11,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92594 to 77116. [2018-12-09 11:40:11,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77116 states. [2018-12-09 11:40:12,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77116 states to 77116 states and 253964 transitions. [2018-12-09 11:40:12,044 INFO L78 Accepts]: Start accepts. Automaton has 77116 states and 253964 transitions. Word has length 111 [2018-12-09 11:40:12,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:12,044 INFO L480 AbstractCegarLoop]: Abstraction has 77116 states and 253964 transitions. [2018-12-09 11:40:12,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 11:40:12,044 INFO L276 IsEmpty]: Start isEmpty. Operand 77116 states and 253964 transitions. [2018-12-09 11:40:12,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-12-09 11:40:12,136 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:12,136 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:12,136 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:40:12,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:12,137 INFO L82 PathProgramCache]: Analyzing trace with hash 796875473, now seen corresponding path program 4 times [2018-12-09 11:40:12,137 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:40:12,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:12,138 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:40:12,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:12,138 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:40:12,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:12,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:12,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:12,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 11:40:12,177 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:40:12,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 11:40:12,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 11:40:12,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 11:40:12,177 INFO L87 Difference]: Start difference. First operand 77116 states and 253964 transitions. Second operand 5 states. [2018-12-09 11:40:12,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:12,705 INFO L93 Difference]: Finished difference Result 91869 states and 298273 transitions. [2018-12-09 11:40:12,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 11:40:12,705 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 111 [2018-12-09 11:40:12,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:12,838 INFO L225 Difference]: With dead ends: 91869 [2018-12-09 11:40:12,838 INFO L226 Difference]: Without dead ends: 91869 [2018-12-09 11:40:12,839 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 11:40:13,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91869 states. [2018-12-09 11:40:13,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91869 to 80236. [2018-12-09 11:40:13,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80236 states. [2018-12-09 11:40:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80236 states to 80236 states and 263345 transitions. [2018-12-09 11:40:13,918 INFO L78 Accepts]: Start accepts. Automaton has 80236 states and 263345 transitions. Word has length 111 [2018-12-09 11:40:13,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:13,918 INFO L480 AbstractCegarLoop]: Abstraction has 80236 states and 263345 transitions. [2018-12-09 11:40:13,918 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 11:40:13,918 INFO L276 IsEmpty]: Start isEmpty. Operand 80236 states and 263345 transitions. [2018-12-09 11:40:14,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:40:14,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:14,015 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:14,015 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:40:14,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:14,015 INFO L82 PathProgramCache]: Analyzing trace with hash -1439988210, now seen corresponding path program 1 times [2018-12-09 11:40:14,015 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:40:14,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:14,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:14,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:14,016 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:40:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:14,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:14,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 11:40:14,116 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:40:14,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 11:40:14,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 11:40:14,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-12-09 11:40:14,117 INFO L87 Difference]: Start difference. First operand 80236 states and 263345 transitions. Second operand 12 states. [2018-12-09 11:40:15,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:15,461 INFO L93 Difference]: Finished difference Result 147552 states and 479234 transitions. [2018-12-09 11:40:15,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 11:40:15,462 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 113 [2018-12-09 11:40:15,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:15,667 INFO L225 Difference]: With dead ends: 147552 [2018-12-09 11:40:15,667 INFO L226 Difference]: Without dead ends: 136120 [2018-12-09 11:40:15,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=612, Unknown=0, NotChecked=0, Total=756 [2018-12-09 11:40:15,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136120 states. [2018-12-09 11:40:17,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136120 to 100091. [2018-12-09 11:40:17,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100091 states. [2018-12-09 11:40:17,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100091 states to 100091 states and 329229 transitions. [2018-12-09 11:40:17,318 INFO L78 Accepts]: Start accepts. Automaton has 100091 states and 329229 transitions. Word has length 113 [2018-12-09 11:40:17,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:17,318 INFO L480 AbstractCegarLoop]: Abstraction has 100091 states and 329229 transitions. [2018-12-09 11:40:17,318 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 11:40:17,318 INFO L276 IsEmpty]: Start isEmpty. Operand 100091 states and 329229 transitions. [2018-12-09 11:40:17,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:40:17,455 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:17,455 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:17,455 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:40:17,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:17,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1682974836, now seen corresponding path program 2 times [2018-12-09 11:40:17,455 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:40:17,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:17,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:17,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:17,457 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:40:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:17,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:17,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:17,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:40:17,494 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:40:17,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:40:17,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:40:17,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:17,494 INFO L87 Difference]: Start difference. First operand 100091 states and 329229 transitions. Second operand 3 states. [2018-12-09 11:40:17,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:17,980 INFO L93 Difference]: Finished difference Result 104891 states and 343414 transitions. [2018-12-09 11:40:17,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:40:17,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-12-09 11:40:17,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:18,147 INFO L225 Difference]: With dead ends: 104891 [2018-12-09 11:40:18,147 INFO L226 Difference]: Without dead ends: 104891 [2018-12-09 11:40:18,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:18,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104891 states. [2018-12-09 11:40:19,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104891 to 104201. [2018-12-09 11:40:19,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104201 states. [2018-12-09 11:40:19,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104201 states to 104201 states and 341397 transitions. [2018-12-09 11:40:19,592 INFO L78 Accepts]: Start accepts. Automaton has 104201 states and 341397 transitions. Word has length 113 [2018-12-09 11:40:19,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:19,592 INFO L480 AbstractCegarLoop]: Abstraction has 104201 states and 341397 transitions. [2018-12-09 11:40:19,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:40:19,592 INFO L276 IsEmpty]: Start isEmpty. Operand 104201 states and 341397 transitions. [2018-12-09 11:40:19,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:40:19,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:19,731 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:19,731 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:40:19,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:19,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1836320102, now seen corresponding path program 3 times [2018-12-09 11:40:19,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:40:19,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:19,733 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:40:19,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:19,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:40:19,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:19,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:19,854 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:19,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 11:40:19,854 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:40:19,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 11:40:19,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 11:40:19,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-09 11:40:19,854 INFO L87 Difference]: Start difference. First operand 104201 states and 341397 transitions. Second operand 13 states. [2018-12-09 11:40:22,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:22,230 INFO L93 Difference]: Finished difference Result 197907 states and 648622 transitions. [2018-12-09 11:40:22,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-12-09 11:40:22,230 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 113 [2018-12-09 11:40:22,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:22,526 INFO L225 Difference]: With dead ends: 197907 [2018-12-09 11:40:22,526 INFO L226 Difference]: Without dead ends: 170521 [2018-12-09 11:40:22,527 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=778, Unknown=0, NotChecked=0, Total=930 [2018-12-09 11:40:22,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170521 states. [2018-12-09 11:40:24,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170521 to 139811. [2018-12-09 11:40:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139811 states. [2018-12-09 11:40:24,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139811 states to 139811 states and 460980 transitions. [2018-12-09 11:40:24,912 INFO L78 Accepts]: Start accepts. Automaton has 139811 states and 460980 transitions. Word has length 113 [2018-12-09 11:40:24,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:24,912 INFO L480 AbstractCegarLoop]: Abstraction has 139811 states and 460980 transitions. [2018-12-09 11:40:24,912 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 11:40:24,912 INFO L276 IsEmpty]: Start isEmpty. Operand 139811 states and 460980 transitions. [2018-12-09 11:40:25,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:40:25,091 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:25,091 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:25,092 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:40:25,092 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:25,092 INFO L82 PathProgramCache]: Analyzing trace with hash -89858118, now seen corresponding path program 4 times [2018-12-09 11:40:25,092 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:40:25,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:25,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:40:25,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:25,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:40:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:25,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:25,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:25,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 11:40:25,149 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:40:25,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 11:40:25,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 11:40:25,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:40:25,150 INFO L87 Difference]: Start difference. First operand 139811 states and 460980 transitions. Second operand 4 states. [2018-12-09 11:40:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:25,745 INFO L93 Difference]: Finished difference Result 163311 states and 535685 transitions. [2018-12-09 11:40:25,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 11:40:25,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2018-12-09 11:40:25,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:26,027 INFO L225 Difference]: With dead ends: 163311 [2018-12-09 11:40:26,027 INFO L226 Difference]: Without dead ends: 163311 [2018-12-09 11:40:26,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 11:40:26,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163311 states. [2018-12-09 11:40:27,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163311 to 158036. [2018-12-09 11:40:27,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158036 states. [2018-12-09 11:40:28,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158036 states to 158036 states and 519030 transitions. [2018-12-09 11:40:28,344 INFO L78 Accepts]: Start accepts. Automaton has 158036 states and 519030 transitions. Word has length 113 [2018-12-09 11:40:28,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:28,344 INFO L480 AbstractCegarLoop]: Abstraction has 158036 states and 519030 transitions. [2018-12-09 11:40:28,344 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 11:40:28,344 INFO L276 IsEmpty]: Start isEmpty. Operand 158036 states and 519030 transitions. [2018-12-09 11:40:28,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:40:28,581 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:28,581 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:28,582 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:40:28,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:28,582 INFO L82 PathProgramCache]: Analyzing trace with hash -1115350117, now seen corresponding path program 1 times [2018-12-09 11:40:28,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:40:28,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:28,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:28,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:28,583 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:40:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:28,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:28,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:28,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 11:40:28,621 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:40:28,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 11:40:28,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 11:40:28,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:28,622 INFO L87 Difference]: Start difference. First operand 158036 states and 519030 transitions. Second operand 3 states. [2018-12-09 11:40:29,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:29,188 INFO L93 Difference]: Finished difference Result 160781 states and 527506 transitions. [2018-12-09 11:40:29,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 11:40:29,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2018-12-09 11:40:29,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:29,468 INFO L225 Difference]: With dead ends: 160781 [2018-12-09 11:40:29,468 INFO L226 Difference]: Without dead ends: 160781 [2018-12-09 11:40:29,469 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 11:40:29,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160781 states. [2018-12-09 11:40:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160781 to 160366. [2018-12-09 11:40:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160366 states. [2018-12-09 11:40:31,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160366 states to 160366 states and 526279 transitions. [2018-12-09 11:40:31,859 INFO L78 Accepts]: Start accepts. Automaton has 160366 states and 526279 transitions. Word has length 113 [2018-12-09 11:40:31,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:31,859 INFO L480 AbstractCegarLoop]: Abstraction has 160366 states and 526279 transitions. [2018-12-09 11:40:31,859 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 11:40:31,859 INFO L276 IsEmpty]: Start isEmpty. Operand 160366 states and 526279 transitions. [2018-12-09 11:40:32,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:40:32,086 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:32,086 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:32,086 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:40:32,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:32,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1104033990, now seen corresponding path program 1 times [2018-12-09 11:40:32,087 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:40:32,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:32,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:32,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:32,088 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:40:32,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:32,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:32,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:32,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 11:40:32,167 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:40:32,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 11:40:32,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 11:40:32,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 11:40:32,167 INFO L87 Difference]: Start difference. First operand 160366 states and 526279 transitions. Second operand 10 states. [2018-12-09 11:40:33,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:33,554 INFO L93 Difference]: Finished difference Result 217718 states and 712853 transitions. [2018-12-09 11:40:33,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 11:40:33,555 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 113 [2018-12-09 11:40:33,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:33,666 INFO L225 Difference]: With dead ends: 217718 [2018-12-09 11:40:33,666 INFO L226 Difference]: Without dead ends: 76490 [2018-12-09 11:40:33,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-09 11:40:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76490 states. [2018-12-09 11:40:34,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76490 to 76490. [2018-12-09 11:40:34,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76490 states. [2018-12-09 11:40:34,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76490 states to 76490 states and 236339 transitions. [2018-12-09 11:40:34,548 INFO L78 Accepts]: Start accepts. Automaton has 76490 states and 236339 transitions. Word has length 113 [2018-12-09 11:40:34,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:34,549 INFO L480 AbstractCegarLoop]: Abstraction has 76490 states and 236339 transitions. [2018-12-09 11:40:34,549 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 11:40:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 76490 states and 236339 transitions. [2018-12-09 11:40:34,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:40:34,631 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:34,631 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:34,631 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:40:34,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:34,632 INFO L82 PathProgramCache]: Analyzing trace with hash 652208486, now seen corresponding path program 2 times [2018-12-09 11:40:34,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:40:34,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:34,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:34,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:34,633 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:40:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:34,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:34,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:34,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 11:40:34,692 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:40:34,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 11:40:34,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 11:40:34,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:40:34,692 INFO L87 Difference]: Start difference. First operand 76490 states and 236339 transitions. Second operand 8 states. [2018-12-09 11:40:35,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:35,272 INFO L93 Difference]: Finished difference Result 95221 states and 296926 transitions. [2018-12-09 11:40:35,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 11:40:35,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-09 11:40:35,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:35,296 INFO L225 Difference]: With dead ends: 95221 [2018-12-09 11:40:35,296 INFO L226 Difference]: Without dead ends: 18409 [2018-12-09 11:40:35,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-12-09 11:40:35,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18409 states. [2018-12-09 11:40:35,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18409 to 18405. [2018-12-09 11:40:35,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18405 states. [2018-12-09 11:40:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18405 states to 18405 states and 60073 transitions. [2018-12-09 11:40:35,493 INFO L78 Accepts]: Start accepts. Automaton has 18405 states and 60073 transitions. Word has length 113 [2018-12-09 11:40:35,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:35,493 INFO L480 AbstractCegarLoop]: Abstraction has 18405 states and 60073 transitions. [2018-12-09 11:40:35,493 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 11:40:35,493 INFO L276 IsEmpty]: Start isEmpty. Operand 18405 states and 60073 transitions. [2018-12-09 11:40:35,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:40:35,509 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:35,509 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:35,510 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:40:35,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:35,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1990998278, now seen corresponding path program 1 times [2018-12-09 11:40:35,510 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:40:35,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:35,511 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:40:35,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:35,511 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:40:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:35,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:35,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:35,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 11:40:35,607 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:40:35,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 11:40:35,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 11:40:35,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-09 11:40:35,607 INFO L87 Difference]: Start difference. First operand 18405 states and 60073 transitions. Second operand 8 states. [2018-12-09 11:40:35,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:35,833 INFO L93 Difference]: Finished difference Result 21678 states and 69728 transitions. [2018-12-09 11:40:35,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 11:40:35,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 113 [2018-12-09 11:40:35,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:35,859 INFO L225 Difference]: With dead ends: 21678 [2018-12-09 11:40:35,860 INFO L226 Difference]: Without dead ends: 21678 [2018-12-09 11:40:35,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2018-12-09 11:40:35,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21678 states. [2018-12-09 11:40:36,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21678 to 19622. [2018-12-09 11:40:36,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19622 states. [2018-12-09 11:40:36,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19622 states to 19622 states and 63574 transitions. [2018-12-09 11:40:36,081 INFO L78 Accepts]: Start accepts. Automaton has 19622 states and 63574 transitions. Word has length 113 [2018-12-09 11:40:36,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:36,081 INFO L480 AbstractCegarLoop]: Abstraction has 19622 states and 63574 transitions. [2018-12-09 11:40:36,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 11:40:36,081 INFO L276 IsEmpty]: Start isEmpty. Operand 19622 states and 63574 transitions. [2018-12-09 11:40:36,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:40:36,099 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:36,099 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:36,099 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:40:36,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:36,100 INFO L82 PathProgramCache]: Analyzing trace with hash -1103494597, now seen corresponding path program 2 times [2018-12-09 11:40:36,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:40:36,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:36,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 11:40:36,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:36,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:40:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 11:40:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 11:40:36,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 11:40:36,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 11:40:36,202 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 11:40:36,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 11:40:36,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 11:40:36,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-09 11:40:36,202 INFO L87 Difference]: Start difference. First operand 19622 states and 63574 transitions. Second operand 13 states. [2018-12-09 11:40:36,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 11:40:36,733 INFO L93 Difference]: Finished difference Result 32254 states and 102851 transitions. [2018-12-09 11:40:36,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 11:40:36,734 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 113 [2018-12-09 11:40:36,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 11:40:36,762 INFO L225 Difference]: With dead ends: 32254 [2018-12-09 11:40:36,762 INFO L226 Difference]: Without dead ends: 23687 [2018-12-09 11:40:36,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-09 11:40:36,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23687 states. [2018-12-09 11:40:36,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23687 to 20008. [2018-12-09 11:40:36,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20008 states. [2018-12-09 11:40:36,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20008 states to 20008 states and 64562 transitions. [2018-12-09 11:40:36,995 INFO L78 Accepts]: Start accepts. Automaton has 20008 states and 64562 transitions. Word has length 113 [2018-12-09 11:40:36,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 11:40:36,995 INFO L480 AbstractCegarLoop]: Abstraction has 20008 states and 64562 transitions. [2018-12-09 11:40:36,995 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 11:40:36,995 INFO L276 IsEmpty]: Start isEmpty. Operand 20008 states and 64562 transitions. [2018-12-09 11:40:37,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-12-09 11:40:37,012 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 11:40:37,012 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 11:40:37,012 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 11:40:37,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 11:40:37,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1575828745, now seen corresponding path program 3 times [2018-12-09 11:40:37,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 11:40:37,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:37,013 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 11:40:37,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 11:40:37,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 11:40:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:40:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 11:40:37,055 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 11:40:37,141 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 11:40:37,142 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 11:40:37 BasicIcfg [2018-12-09 11:40:37,142 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 11:40:37,142 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 11:40:37,142 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 11:40:37,142 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 11:40:37,143 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 11:35:42" (3/4) ... [2018-12-09 11:40:37,145 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 11:40:37,228 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6452797d-ec52-44d5-8e9a-f56b1c3db4eb/bin-2019/utaipan/witness.graphml [2018-12-09 11:40:37,228 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 11:40:37,229 INFO L168 Benchmark]: Toolchain (without parser) took 295499.53 ms. Allocated memory was 1.0 GB in the beginning and 8.2 GB in the end (delta: 7.2 GB). Free memory was 950.6 MB in the beginning and 5.8 GB in the end (delta: -4.9 GB). Peak memory consumption was 2.3 GB. Max. memory is 11.5 GB. [2018-12-09 11:40:37,230 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:40:37,230 INFO L168 Benchmark]: CACSL2BoogieTranslator took 351.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -158.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. [2018-12-09 11:40:37,230 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2018-12-09 11:40:37,230 INFO L168 Benchmark]: Boogie Preprocessor took 21.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 11:40:37,230 INFO L168 Benchmark]: RCFGBuilder took 414.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2018-12-09 11:40:37,230 INFO L168 Benchmark]: TraceAbstraction took 294584.71 ms. Allocated memory was 1.2 GB in the beginning and 8.2 GB in the end (delta: 7.0 GB). Free memory was 1.0 GB in the beginning and 5.9 GB in the end (delta: -4.9 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2018-12-09 11:40:37,231 INFO L168 Benchmark]: Witness Printer took 86.03 ms. Allocated memory is still 8.2 GB. Free memory was 5.9 GB in the beginning and 5.8 GB in the end (delta: 79.6 MB). Peak memory consumption was 79.6 MB. Max. memory is 11.5 GB. [2018-12-09 11:40:37,231 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 351.68 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 136.8 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -158.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 21.61 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 414.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 294584.71 ms. Allocated memory was 1.2 GB in the beginning and 8.2 GB in the end (delta: 7.0 GB). Free memory was 1.0 GB in the beginning and 5.9 GB in the end (delta: -4.9 GB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. * Witness Printer took 86.03 ms. Allocated memory is still 8.2 GB. Free memory was 5.9 GB in the beginning and 5.8 GB in the end (delta: 79.6 MB). Peak memory consumption was 79.6 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0] [L682] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L684] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L685] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L686] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L688] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L690] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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] [L692] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0] [L693] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0] [L694] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0] [L695] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L696] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L697] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L698] -1 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L699] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L700] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L701] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L702] -1 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L703] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L704] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L705] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L706] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L707] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L708] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L709] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L710] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] -1 pthread_t t396; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] FCALL, FORK -1 pthread_create(&t396, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] -1 pthread_t t397; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] FCALL, FORK -1 pthread_create(&t397, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] -1 pthread_t t398; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] FCALL, FORK -1 pthread_create(&t398, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] 0 z$w_buff1 = z$w_buff0 [L764] 0 z$w_buff0 = 1 [L765] 0 z$w_buff1_used = z$w_buff0_used [L766] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L769] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L770] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L771] 0 z$r_buff1_thd3 = z$r_buff0_thd3 [L772] 0 z$r_buff0_thd3 = (_Bool)1 [L775] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L776] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L777] 0 z$flush_delayed = weak$$choice2 [L778] 0 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 0 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L780] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L781] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L782] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L783] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L784] EXPR 0 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 0 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L785] EXPR 0 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 0 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 0 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 0 z = z$flush_delayed ? z$mem_tmp : z [L788] 0 z$flush_delayed = (_Bool)0 [L791] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L714] 1 a = 1 [L717] 1 x = 1 [L720] 1 __unbuffered_p0_EAX = x [L723] 1 __unbuffered_p0_EBX = y [L728] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L735] 2 y = 1 [L738] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L739] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L740] 2 z$flush_delayed = weak$$choice2 [L741] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L743] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L744] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L744] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L745] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L745] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L746] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L746] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L747] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L748] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L749] 2 __unbuffered_p1_EAX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L794] 0 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L795] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 z = z$flush_delayed ? z$mem_tmp : z [L751] 2 z$flush_delayed = (_Bool)0 [L756] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L796] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L797] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] 0 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L798] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] 0 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L801] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L828] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L829] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L830] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L831] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L831] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L834] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __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=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 305 locations, 3 error locations. UNSAFE Result, 294.4s OverallTime, 32 OverallIterations, 1 TraceHistogramMax, 53.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12636 SDtfs, 16176 SDslu, 38658 SDs, 0 SdLazy, 12258 SolverSat, 518 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 376 GetRequests, 100 SyntacticMatches, 24 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=445147occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 93.2s AutomataMinimizationTime, 31 MinimizatonAttempts, 733062 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 3006 NumberOfCodeBlocks, 3006 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2862 ConstructedInterpolants, 0 QuantifiedInterpolants, 712062 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...